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-174881266100080.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 PolyORBNT-PT-S05J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100080
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 164K 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 17K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 232K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 31K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 PolyORBNT-PT-S05J20-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748898308294

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:05:09] [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 21:05:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:05:09] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2025-06-02 21:05:09] [INFO ] Transformed 349 places.
[2025-06-02 21:05:09] [INFO ] Transformed 1210 transitions.
[2025-06-02 21:05:09] [INFO ] Parsed PT model containing 349 places and 1210 transitions and 8824 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 21:05:09] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2025-06-02 21:05:10] [INFO ] Computed 62 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[70, 32, 384, 1, 1, 27, 64, 79, 21, 128, 1, 32, 21, 4, 1, 96]
RANDOM walk for 10000 steps (687 resets) in 90 ms. (109 steps per ms)
FORMULA PolyORBNT-PT-S05J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120010 steps (1942 resets) in 269 ms. (444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 3, 1, 2, 1, 1, 3, 1, 1, 1, 3] Max Struct:[70, 32, 384, 27, 64, 79, 21, 128, 32, 21, 4, 96]
[2025-06-02 21:05:10] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
[2025-06-02 21:05:10] [INFO ] Invariant cache hit.
[2025-06-02 21:05:10] [INFO ] [Real]Absence check using 42 positive place invariants in 36 ms returned sat
[2025-06-02 21:05:10] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 153 ms returned unsat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned sat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 18 ms returned unsat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 11 ms returned unsat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned sat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 9 ms returned unsat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive place invariants in 9 ms returned sat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 8 ms returned unsat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive place invariants in 9 ms returned sat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 18 ms returned unsat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 20 ms returned unsat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive place invariants in 18 ms returned sat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 11 ms returned sat
[2025-06-02 21:05:11] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2025-06-02 21:05:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:05:12] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2025-06-02 21:05:12] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 14 ms returned sat
[2025-06-02 21:05:12] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2025-06-02 21:05:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:05:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 77 ms returned sat
[2025-06-02 21:05:12] [INFO ] Deduced a trap composed of 183 places in 207 ms of which 12 ms to minimize.
[2025-06-02 21:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2025-06-02 21:05:12] [INFO ] Computed and/alt/rep : 349/889/349 causal constraints (skipped 196 transitions) in 46 ms.
[2025-06-02 21:05:12] [INFO ] Added : 17 causal constraints over 4 iterations in 278 ms. Result :sat
Minimization took 503 ms.
[2025-06-02 21:05:13] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2025-06-02 21:05:13] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 8 ms returned unsat
[2025-06-02 21:05:13] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2025-06-02 21:05:13] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 4 ms returned unsat
[2025-06-02 21:05:13] [INFO ] [Real]Absence check using 42 positive place invariants in 9 ms returned sat
[2025-06-02 21:05:13] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 12 ms returned unsat
[2025-06-02 21:05:13] [INFO ] [Real]Absence check using 42 positive place invariants in 9 ms returned sat
[2025-06-02 21:05:13] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 3, 1, 2, 1, 1, 3, 1, 1, 1, 3] Max Struct:[1, 1, 3, 1, 2, 1, 1, 128, 1, 1, 1, 3]
FORMULA PolyORBNT-PT-S05J20-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[128]
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 292 transition count 503
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 292 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 290 transition count 501
Applied a total of 113 rules in 137 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
Running 495 sub problems to find dead transitions.
[2025-06-02 21:05:14] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2025-06-02 21:05:14] [INFO ] Computed 57 invariants in 8 ms
[2025-06-02 21:05:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/290 variables, 5/57 constraints. Problems are: Problem set: 95 solved, 400 unsolved
[2025-06-02 21:05:24] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 1/58 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 497/787 variables, 290/348 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/787 variables, 1/349 constraints. Problems are: Problem set: 95 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 787/787 variables, and 349 constraints, problems are : Problem set: 95 solved, 400 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 95 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 42/42 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 10/52 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 1/53 constraints. Problems are: Problem set: 95 solved, 400 unsolved
[2025-06-02 21:05:35] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 1/54 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/54 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 5/290 variables, 5/59 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/59 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 497/787 variables, 290/349 constraints. Problems are: Problem set: 95 solved, 400 unsolved
SMT process timed out in 41027ms, After SMT, problems are : Problem set: 95 solved, 400 unsolved
Search for dead transitions found 95 dead transitions in 41062ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 290/349 places, 406/555 transitions.
Applied a total of 0 rules in 19 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41252 ms. Remains : 290/349 places, 406/555 transitions.
[2025-06-02 21:05:55] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2025-06-02 21:05:55] [INFO ] Computed 57 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (51916 resets) in 3080 ms. (324 steps per ms)
BEST_FIRST walk for 1000001 steps (7105 resets) in 860 ms. (1161 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2025-06-02 21:05:59] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:05:59] [INFO ] Invariant cache hit.
[2025-06-02 21:05:59] [INFO ] [Real]Absence check using 43 positive place invariants in 8 ms returned sat
[2025-06-02 21:05:59] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 7 ms returned sat
[2025-06-02 21:05:59] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2025-06-02 21:05:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:05:59] [INFO ] [Nat]Absence check using 43 positive place invariants in 8 ms returned sat
[2025-06-02 21:05:59] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 6 ms returned sat
[2025-06-02 21:05:59] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2025-06-02 21:05:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:05:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-02 21:05:59] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:05:59] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:05:59] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2025-06-02 21:05:59] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2025-06-02 21:06:00] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:06:00] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 2 ms to minimize.
[2025-06-02 21:06:00] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:06:00] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:06:00] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:06:00] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:06:00] [INFO ] Deduced a trap composed of 111 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:06:01] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2025-06-02 21:06:01] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2025-06-02 21:06:01] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:06:01] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 3 ms to minimize.
[2025-06-02 21:06:01] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2025-06-02 21:06:01] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2025-06-02 21:06:02] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:06:02] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:06:02] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:06:02] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:06:02] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:06:02] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:06:02] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:06:02] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:06:06] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:06:07] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:06:07] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:06:07] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:06:07] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:06:07] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:06:07] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 4 ms to minimize.
[2025-06-02 21:06:07] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:06:08] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:06:08] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:06:08] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:06:08] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:06:09] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:06:09] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:06:09] [INFO ] Deduced a trap composed of 110 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:06:09] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:06:09] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:06:09] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:06:10] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:06:14] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 15409 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 16 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 12 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-02 21:06:14] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:06:14] [INFO ] Invariant cache hit.
[2025-06-02 21:06:15] [INFO ] Implicit Places using invariants in 294 ms returned []
[2025-06-02 21:06:15] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:06:15] [INFO ] Invariant cache hit.
[2025-06-02 21:06:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:06:16] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2025-06-02 21:06:16] [INFO ] Redundant transitions in 28 ms returned []
Running 400 sub problems to find dead transitions.
[2025-06-02 21:06:16] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:06:16] [INFO ] Invariant cache hit.
[2025-06-02 21:06:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:06:19] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:06:19] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:06:19] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:06:20] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:06:20] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2025-06-02 21:06:20] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2025-06-02 21:06:20] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 3 ms to minimize.
[2025-06-02 21:06:20] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:06:20] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2025-06-02 21:06:20] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 5 ms to minimize.
[2025-06-02 21:06:20] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2025-06-02 21:06:21] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 2 ms to minimize.
[2025-06-02 21:06:21] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:06:21] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:06:21] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2025-06-02 21:06:21] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 1 ms to minimize.
[2025-06-02 21:06:21] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:06:21] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 2 ms to minimize.
[2025-06-02 21:06:21] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2025-06-02 21:06:22] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:06:22] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:06:22] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2025-06-02 21:06:22] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:06:22] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:06:22] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2025-06-02 21:06:22] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:06:23] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:06:23] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2025-06-02 21:06:23] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:06:23] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:06:23] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:06:23] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:06:23] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:06:23] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:06:24] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:06:24] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:06:24] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2025-06-02 21:06:24] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:06:24] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:06:24] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:06:27] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:06:27] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:06:27] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:06:29] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:06:29] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
[2025-06-02 21:06:29] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:06:29] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:06:29] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2025-06-02 21:06:29] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 3 ms to minimize.
[2025-06-02 21:06:29] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:06:30] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:06:30] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:06:30] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:06:30] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2025-06-02 21:06:30] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:06:30] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:06:30] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:06:31] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:06:31] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2025-06-02 21:06:31] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:06:31] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:06:31] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:06:31] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:06:32] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:06:32] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:06:33] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:06:33] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:06:33] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:06:33] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:06:33] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:06:33] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:06:33] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:06:34] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:06:34] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:06:34] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:06:34] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:06:34] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:06:34] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:06:34] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:06:34] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:06:35] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:06:35] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:06:35] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 5/290 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 400 unsolved
SMT process timed out in 30350ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 30354ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32362 ms. Remains : 290/290 places, 406/406 transitions.
RANDOM walk for 40000 steps (2104 resets) in 1012 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (282 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (293 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
[2025-06-02 21:06:47] [INFO ] Flatten gal took : 130 ms
[2025-06-02 21:06:48] [INFO ] Flatten gal took : 77 ms
[2025-06-02 21:06:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5678131577287491809.gal : 21 ms
[2025-06-02 21:06:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1953780877938286889.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/ReachabilityCardinality5678131577287491809.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1953780877938286889.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/ReachabilityCardinality1953780877938286889.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 82
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :82 after 122
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :122 after 1055
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1055 after 28435
Interrupted probabilistic random walk after 324900 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 2
Probabilistic random walk after 324900 steps, saw 99406 distinct states, run finished after 3004 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-02 21:06:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:06:50] [INFO ] Invariant cache hit.
[2025-06-02 21:06:50] [INFO ] State equation strengthened by 1 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/269 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/288 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:06:51] [INFO ] Deduced a trap composed of 89 places in 628 ms of which 2 ms to minimize.
[2025-06-02 21:06:52] [INFO ] Deduced a trap composed of 96 places in 429 ms of which 2 ms to minimize.
[2025-06-02 21:06:52] [INFO ] Deduced a trap composed of 110 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:06:52] [INFO ] Deduced a trap composed of 83 places in 300 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/289 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 402/691 variables, 289/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/691 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/691 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/692 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/692 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/692 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 692/692 variables, and 352 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2242 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/269 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/288 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 107 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 3 ms to minimize.
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 116 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 116 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:06:55] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:06:55] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:06:55] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:06:55] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:06:55] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:06:55] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:06:55] [INFO ] Deduced a trap composed of 116 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:06:55] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:06:55] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:06:56] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:06:56] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:06:56] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:06:56] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:06:56] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:06:56] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:06:56] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:06:56] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:06:56] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:06:57] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 1 ms to minimize.
[2025-06-02 21:06:57] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:06:57] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:06:57] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:06:57] [INFO ] Deduced a trap composed of 119 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:06:57] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2025-06-02 21:06:57] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:06:57] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:06:57] [INFO ] Deduced a trap composed of 109 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:06:58] [INFO ] Deduced a trap composed of 116 places in 98 ms of which 2 ms to minimize.
SMT process timed out in 7266ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 12 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Running 400 sub problems to find dead transitions.
[2025-06-02 21:06:58] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:06:58] [INFO ] Invariant cache hit.
[2025-06-02 21:06:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:07:00] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:07:00] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:07:00] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:07:01] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:07:01] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:01] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:07:01] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2025-06-02 21:07:01] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:07:01] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:07:01] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:07:01] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:07:02] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:07:02] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:07:02] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:07:02] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:07:02] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:07:02] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:02] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:02] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:03] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:07:03] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:03] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:07:03] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:07:03] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:07:04] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:07:04] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2025-06-02 21:07:04] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2025-06-02 21:07:04] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:04] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:04] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:04] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:07:04] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:07:05] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:07:05] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:07:05] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:05] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:07:05] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:07:05] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:05] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:07:05] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:07:08] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:09] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:07:09] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:07:10] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:07:10] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:07:10] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:11] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:11] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:11] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:07:11] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:11] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:07:11] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 3 ms to minimize.
[2025-06-02 21:07:11] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:07:11] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:07:12] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:07:12] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:12] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:07:12] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:12] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:07:12] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:07:12] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:07:13] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:07:13] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:07:14] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:07:14] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:14] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:07:15] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:07:15] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:07:15] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:07:15] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2025-06-02 21:07:15] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:15] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:15] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:07:15] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:07:15] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:07:16] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 3 ms to minimize.
[2025-06-02 21:07:16] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:07:16] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:07:16] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:07:16] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:07:16] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:07:17] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:07:17] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/692 variables, and 135 constraints, problems are : Problem set: 0 solved, 400 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 9/14 constraints, State Equation: 0/290 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 83/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:07:21] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2025-06-02 21:07:28] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2025-06-02 21:07:29] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:07:29] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 1 ms to minimize.
[2025-06-02 21:07:30] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:07:30] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:07:30] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:30] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:07:30] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:07:30] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:07:30] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:07:31] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:07:31] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:07:31] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:07:31] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:31] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:07:31] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:07:32] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:07:32] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:07:32] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/692 variables, and 155 constraints, problems are : Problem set: 0 solved, 400 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 9/14 constraints, State Equation: 0/290 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/400 constraints, Known Traps: 103/103 constraints]
After SMT, in 40404ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 40409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40423 ms. Remains : 290/290 places, 406/406 transitions.
[2025-06-02 21:07:38] [INFO ] Flatten gal took : 54 ms
[2025-06-02 21:07:38] [INFO ] Applying decomposition
[2025-06-02 21:07:38] [INFO ] Flatten gal took : 58 ms
RANDOM walk for 40000 steps (2090 resets) in 526 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (277 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (260 resets) in 124 ms. (320 steps per ms) remains 2/2 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/graph80599229379233663.txt' '-o' '/tmp/graph80599229379233663.bin' '-w' '/tmp/graph80599229379233663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph80599229379233663.bin' '-l' '-1' '-v' '-w' '/tmp/graph80599229379233663.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:07:38] [INFO ] Decomposing Gal with order
[2025-06-02 21:07:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:07:38] [INFO ] Removed a total of 517 redundant transitions.
[2025-06-02 21:07:38] [INFO ] Flatten gal took : 144 ms
[2025-06-02 21:07:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 20 ms.
[2025-06-02 21:07:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1571238363545950580.gal : 10 ms
[2025-06-02 21:07:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality317939502880923676.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/ReachabilityCardinality1571238363545950580.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality317939502880923676.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 ...306
Loading property file /tmp/ReachabilityCardinality317939502880923676.prop.
Interrupted probabilistic random walk after 382478 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 2
Probabilistic random walk after 382478 steps, saw 117889 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2025-06-02 21:07:41] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:07:41] [INFO ] Invariant cache hit.
[2025-06-02 21:07:41] [INFO ] State equation strengthened by 1 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/269 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/288 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:07:41] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:07:42] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:42] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:42] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/289 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 402/691 variables, 289/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/691 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/691 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/692 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/692 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/692 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 692/692 variables, and 352 constraints, problems are : Problem set: 0 solved, 2 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/269 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/288 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:07:42] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2025-06-02 21:07:42] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:07:42] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 18 ms to minimize.
[2025-06-02 21:07:43] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:07:43] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:07:43] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:07:43] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:43] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:07:43] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:07:43] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:07:43] [INFO ] Deduced a trap composed of 105 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:07:43] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:07:43] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:44] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:07:44] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:07:44] [INFO ] Deduced a trap composed of 116 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:07:44] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 2 ms to minimize.
[2025-06-02 21:07:44] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:07:44] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:07:44] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:07:44] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:07:44] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:07:45] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:07:45] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:45] [INFO ] Deduced a trap composed of 116 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:07:45] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:07:45] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:07:45] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:07:45] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:07:45] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:07:45] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:07:46] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:07:46] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:07:46] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:46] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:07:46] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:07:46] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:46] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:07:46] [INFO ] Deduced a trap composed of 114 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:07:46] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:07:47] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 2 ms to minimize.
[2025-06-02 21:07:47] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2025-06-02 21:07:47] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 1 ms to minimize.
[2025-06-02 21:07:47] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:07:47] [INFO ] Deduced a trap composed of 109 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:07:47] [INFO ] Deduced a trap composed of 116 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:47] [INFO ] Deduced a trap composed of 116 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:07:47] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:07:48] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:07:48] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:07:48] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:07:48] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:07:48] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2025-06-02 21:07:48] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:48] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:07:48] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:07:49] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:07:49] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:07:49] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:07:49] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:07:49] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:49] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:49] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:07:49] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:07:50] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:50] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:07:50] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:07:50] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:07:50] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:50] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:50] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:50] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:51] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:07:51] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:07:51] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:51] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:07:51] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:51] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:51] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:52] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:07:52] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:52] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 3 ms to minimize.
[2025-06-02 21:07:52] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 9 ms to minimize.
[2025-06-02 21:07:52] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:52] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:52] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:07:52] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:07:53] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 3 ms to minimize.
[2025-06-02 21:07:53] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:07:53] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:07:53] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:07:53] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:53] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:07:53] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:07:53] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:07:54] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:07:54] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:07:54] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:07:54] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:07:54] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:07:54] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:07:55] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:07:55] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2025-06-02 21:07:55] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:08:04] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:08:04] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/692 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 35725 ms.
Refiners :[Positive P Invariants (semi-flows): 42/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/290 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 110/110 constraints]
After SMT, in 36532ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 18 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 12 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-02 21:08:18] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:08:18] [INFO ] Invariant cache hit.
[2025-06-02 21:08:18] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-06-02 21:08:18] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:08:18] [INFO ] Invariant cache hit.
[2025-06-02 21:08:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:08:20] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
[2025-06-02 21:08:20] [INFO ] Redundant transitions in 10 ms returned []
Running 400 sub problems to find dead transitions.
[2025-06-02 21:08:20] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:08:20] [INFO ] Invariant cache hit.
[2025-06-02 21:08:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:08:22] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:08:22] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:08:23] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:08:23] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:08:23] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:08:23] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:08:23] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:08:23] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:08:23] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:08:24] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:08:24] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:08:24] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:08:24] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:08:24] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:08:24] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:08:24] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:08:25] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:08:25] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:08:25] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2025-06-02 21:08:25] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:08:25] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:08:25] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:08:26] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:08:26] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:08:26] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:08:26] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:08:26] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:08:26] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:08:26] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:08:26] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:08:26] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:08:27] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:08:27] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:08:27] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:08:27] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:08:27] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:08:27] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:08:27] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:08:27] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:08:28] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:08:31] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:08:31] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:08:31] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:08:32] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:08:33] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:08:33] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:08:33] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:08:33] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:08:33] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:08:33] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:08:33] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:08:33] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:08:33] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:08:33] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:08:34] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 3 ms to minimize.
[2025-06-02 21:08:34] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:08:34] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:08:34] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:08:34] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:08:34] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:08:34] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:08:35] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:08:35] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:08:36] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:08:36] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:08:36] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:08:39] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:08:39] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 5/290 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 400 unsolved
SMT process timed out in 30368ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 30372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32341 ms. Remains : 290/290 places, 406/406 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Starting property specific reduction for PolyORBNT-PT-S05J20-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2025-06-02 21:08:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:08:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (510 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10001 steps (66 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2025-06-02 21:08:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:08:50] [INFO ] Invariant cache hit.
[2025-06-02 21:08:50] [INFO ] [Real]Absence check using 43 positive place invariants in 8 ms returned sat
[2025-06-02 21:08:50] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 7 ms returned sat
[2025-06-02 21:08:50] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-06-02 21:08:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:08:50] [INFO ] [Nat]Absence check using 43 positive place invariants in 8 ms returned sat
[2025-06-02 21:08:50] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 6 ms returned sat
[2025-06-02 21:08:51] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2025-06-02 21:08:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:08:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-02 21:08:51] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:08:51] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 1 ms to minimize.
[2025-06-02 21:08:51] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:08:51] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:08:51] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:08:51] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:08:51] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:08:52] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:08:52] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:08:52] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:08:52] [INFO ] Deduced a trap composed of 111 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:08:52] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:08:52] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:08:52] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:08:54] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:08:54] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:08:54] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:08:54] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:08:54] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 3827 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 11 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Running 400 sub problems to find dead transitions.
[2025-06-02 21:08:54] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:08:54] [INFO ] Invariant cache hit.
[2025-06-02 21:08:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:08:57] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:08:57] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:08:57] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:09:00] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:09:00] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:09:00] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:09:00] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:09:00] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:09:01] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:09:01] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:09:01] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:09:01] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:09:01] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:09:01] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:09:01] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:09:01] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:09:02] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:09:02] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:09:02] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:09:02] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:09:02] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:09:02] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2025-06-02 21:09:02] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:09:02] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:09:06] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:09:06] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:09:06] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:09:07] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:09:07] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 1 ms to minimize.
[2025-06-02 21:09:08] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:09:08] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2025-06-02 21:09:08] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:09:08] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:09:08] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:09:08] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:09:08] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:09:08] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:09:08] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:09:09] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:09:09] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:09:09] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2025-06-02 21:09:09] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:09:09] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:09:09] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:09:09] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:09:10] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2025-06-02 21:09:10] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:09:11] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:09:11] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:09:11] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:09:11] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:09:12] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:09:12] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:09:12] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:09:12] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:09:12] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:09:12] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:09:12] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:09:12] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:09:12] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:09:13] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:09:13] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:09:13] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:09:13] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:09:13] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 1 ms to minimize.
[2025-06-02 21:09:13] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 5 ms to minimize.
[2025-06-02 21:09:14] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/692 variables, and 135 constraints, problems are : Problem set: 0 solved, 400 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 9/14 constraints, State Equation: 0/290 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 83/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:09:18] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2025-06-02 21:09:25] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2025-06-02 21:09:26] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:09:26] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:09:26] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2025-06-02 21:09:28] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:09:28] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:09:28] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:09:28] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:09:28] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:09:28] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:09:29] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:09:29] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/692 variables, and 155 constraints, problems are : Problem set: 0 solved, 400 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 9/14 constraints, State Equation: 0/290 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/400 constraints, Known Traps: 103/103 constraints]
After SMT, in 40345ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 40349ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40361 ms. Remains : 290/290 places, 406/406 transitions.
[2025-06-02 21:09:35] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:09:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (52345 resets) in 3047 ms. (328 steps per ms)
BEST_FIRST walk for 1000001 steps (7107 resets) in 859 ms. (1162 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2025-06-02 21:09:39] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:09:39] [INFO ] Invariant cache hit.
[2025-06-02 21:09:39] [INFO ] [Real]Absence check using 43 positive place invariants in 10 ms returned sat
[2025-06-02 21:09:39] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 7 ms returned sat
[2025-06-02 21:09:39] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2025-06-02 21:09:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:09:39] [INFO ] [Nat]Absence check using 43 positive place invariants in 8 ms returned sat
[2025-06-02 21:09:39] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 6 ms returned sat
[2025-06-02 21:09:39] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2025-06-02 21:09:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:09:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-02 21:09:39] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2025-06-02 21:09:39] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 1 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 2 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 1 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 101 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:09:42] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:09:42] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:09:42] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2025-06-02 21:09:42] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:09:42] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2025-06-02 21:09:42] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:09:42] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:09:42] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 1 ms to minimize.
[2025-06-02 21:09:43] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 1 ms to minimize.
[2025-06-02 21:09:49] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:09:49] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:09:49] [INFO ] Deduced a trap composed of 110 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:09:49] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:09:49] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:09:50] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 1 ms to minimize.
[2025-06-02 21:09:50] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:09:55] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 15370 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 12 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-02 21:09:55] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:09:55] [INFO ] Invariant cache hit.
[2025-06-02 21:09:55] [INFO ] Implicit Places using invariants in 293 ms returned []
[2025-06-02 21:09:55] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:09:55] [INFO ] Invariant cache hit.
[2025-06-02 21:09:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:09:57] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
[2025-06-02 21:09:57] [INFO ] Redundant transitions in 6 ms returned []
Running 400 sub problems to find dead transitions.
[2025-06-02 21:09:57] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:09:57] [INFO ] Invariant cache hit.
[2025-06-02 21:09:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:09:59] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:09:59] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:09:59] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:10:00] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:10:00] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:10:00] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:10:00] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:10:00] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:10:00] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:10:00] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:10:00] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:10:01] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:10:01] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:10:01] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:10:01] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:10:01] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:10:01] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:10:01] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:10:01] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:10:02] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:10:02] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:10:02] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:10:02] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:10:02] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:10:03] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:10:03] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:10:03] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:10:03] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:10:03] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:10:03] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2025-06-02 21:10:03] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2025-06-02 21:10:03] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:10:04] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:10:04] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:10:04] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:10:04] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:10:04] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:10:04] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:10:04] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:10:04] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:10:08] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:08] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:10:08] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:10:09] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:10:09] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:10:12] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 1 ms to minimize.
[2025-06-02 21:10:12] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:10:13] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:10:13] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:10:13] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 1 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 1 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:10:16] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 1 ms to minimize.
[2025-06-02 21:10:16] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 5/290 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 400 unsolved
SMT process timed out in 30326ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 30332ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32282 ms. Remains : 290/290 places, 406/406 transitions.
[2025-06-02 21:10:27] [INFO ] Flatten gal took : 59 ms
[2025-06-02 21:10:27] [INFO ] Flatten gal took : 31 ms
[2025-06-02 21:10:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11842468947024553702.gal : 4 ms
[2025-06-02 21:10:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16698384933475628719.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/ReachabilityCardinality11842468947024553702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16698384933475628719.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (2105 resets) in 300 ms. (132 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (291 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (296 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16698384933475628719.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 82
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :82 after 122
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :122 after 1055
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1055 after 28435
Interrupted probabilistic random walk after 356654 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 2
Probabilistic random walk after 356654 steps, saw 109665 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2025-06-02 21:10:30] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:10:30] [INFO ] Invariant cache hit.
[2025-06-02 21:10:30] [INFO ] State equation strengthened by 1 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/269 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/288 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:10:30] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:10:30] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:30] [INFO ] Deduced a trap composed of 110 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:31] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/289 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 402/691 variables, 289/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/691 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/691 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/692 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/692 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/692 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 692/692 variables, and 352 constraints, problems are : Problem set: 0 solved, 2 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/269 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/288 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:10:31] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:10:31] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:10:31] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:10:31] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:10:31] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:10:31] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:10:32] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:10:32] [INFO ] Deduced a trap composed of 104 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:10:32] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2025-06-02 21:10:32] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:10:32] [INFO ] Deduced a trap composed of 105 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:10:32] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:10:32] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:10:32] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:10:32] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2025-06-02 21:10:32] [INFO ] Deduced a trap composed of 116 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:33] [INFO ] Deduced a trap composed of 116 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:10:33] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:10:33] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:10:33] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:10:33] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:33] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:10:33] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:10:33] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:10:33] [INFO ] Deduced a trap composed of 116 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:33] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:34] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:10:34] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:10:34] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:10:34] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:10:34] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:10:34] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:10:34] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:34] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:10:34] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:10:35] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:35] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:10:35] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:10:35] [INFO ] Deduced a trap composed of 114 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:10:35] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:10:35] [INFO ] Deduced a trap composed of 119 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:10:35] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2025-06-02 21:10:35] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:35] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:10:35] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:10:36] [INFO ] Deduced a trap composed of 116 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:10:36] [INFO ] Deduced a trap composed of 116 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:10:36] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
SMT process timed out in 5746ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 8 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Running 400 sub problems to find dead transitions.
[2025-06-02 21:10:36] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:10:36] [INFO ] Invariant cache hit.
[2025-06-02 21:10:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:10:38] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:10:38] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:38] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:39] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:10:39] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2025-06-02 21:10:39] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:10:39] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:39] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2025-06-02 21:10:39] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 2 ms to minimize.
[2025-06-02 21:10:39] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:40] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:10:40] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2025-06-02 21:10:40] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:10:40] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:40] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:10:40] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:10:40] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:10:40] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:41] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:41] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:10:41] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2025-06-02 21:10:41] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2025-06-02 21:10:41] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:41] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:10:46] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:10:46] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:10:47] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:10:48] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:10:48] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
[2025-06-02 21:10:48] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:48] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:10:48] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:10:50] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:10:50] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:10:50] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:10:50] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2025-06-02 21:10:50] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:10:51] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:10:51] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2025-06-02 21:10:51] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:10:52] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:10:52] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:10:52] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:10:52] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:10:52] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2025-06-02 21:10:52] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
[2025-06-02 21:10:53] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:10:53] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:10:53] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2025-06-02 21:10:53] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:10:53] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:10:53] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:10:53] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:10:53] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:10:53] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:10:54] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:10:54] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:10:54] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/692 variables, and 135 constraints, problems are : Problem set: 0 solved, 400 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 9/14 constraints, State Equation: 0/290 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 83/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:11:00] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2025-06-02 21:11:06] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2025-06-02 21:11:07] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:11:07] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:11:08] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:11:08] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:11:08] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:11:08] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:11:08] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:11:08] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:11:08] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:11:09] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:11:09] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:11:09] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:11:09] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:11:09] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:11:09] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2025-06-02 21:11:09] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:11:10] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:11:10] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/692 variables, and 155 constraints, problems are : Problem set: 0 solved, 400 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 9/14 constraints, State Equation: 0/290 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/400 constraints, Known Traps: 103/103 constraints]
After SMT, in 40350ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 40355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40365 ms. Remains : 290/290 places, 406/406 transitions.
RANDOM walk for 40000 steps (2063 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (264 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (300 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2025-06-02 21:11:17] [INFO ] Flatten gal took : 23 ms
[2025-06-02 21:11:17] [INFO ] Applying decomposition
[2025-06-02 21:11:17] [INFO ] Flatten gal took : 20 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/graph3454735327928726203.txt' '-o' '/tmp/graph3454735327928726203.bin' '-w' '/tmp/graph3454735327928726203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3454735327928726203.bin' '-l' '-1' '-v' '-w' '/tmp/graph3454735327928726203.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:11:17] [INFO ] Decomposing Gal with order
[2025-06-02 21:11:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:11:17] [INFO ] Removed a total of 517 redundant transitions.
[2025-06-02 21:11:17] [INFO ] Flatten gal took : 61 ms
[2025-06-02 21:11:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 13 ms.
[2025-06-02 21:11:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9410895498419627478.gal : 6 ms
[2025-06-02 21:11:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9427265752470119647.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/ReachabilityCardinality9410895498419627478.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9427265752470119647.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/ReachabilityCardinality9427265752470119647.prop.
Interrupted probabilistic random walk after 341167 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 2
Probabilistic random walk after 341167 steps, saw 104676 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2025-06-02 21:11:19] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:11:19] [INFO ] Invariant cache hit.
[2025-06-02 21:11:19] [INFO ] State equation strengthened by 1 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/269 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/288 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:11:20] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:11:20] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 6 ms to minimize.
[2025-06-02 21:11:20] [INFO ] Deduced a trap composed of 110 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:11:20] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/289 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 402/691 variables, 289/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/691 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/691 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/692 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/692 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/692 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 692/692 variables, and 352 constraints, problems are : Problem set: 0 solved, 2 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 152/269 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/288 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:11:20] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2025-06-02 21:11:20] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:11:20] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:11:21] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:11:21] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:11:21] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:11:21] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 1 ms to minimize.
[2025-06-02 21:11:21] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:11:21] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:11:21] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:11:21] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2025-06-02 21:11:21] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:11:22] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:11:22] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:11:22] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:11:22] [INFO ] Deduced a trap composed of 116 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:11:22] [INFO ] Deduced a trap composed of 116 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:11:22] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:11:22] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:11:22] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:11:22] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:11:22] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:11:23] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:11:23] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:11:23] [INFO ] Deduced a trap composed of 116 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:11:23] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:11:23] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:11:23] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 1 ms to minimize.
[2025-06-02 21:11:23] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:11:23] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:11:24] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:11:24] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:11:24] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:11:24] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:11:24] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 1 ms to minimize.
[2025-06-02 21:11:24] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:11:24] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:11:24] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:11:25] [INFO ] Deduced a trap composed of 114 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:11:25] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:11:25] [INFO ] Deduced a trap composed of 119 places in 111 ms of which 3 ms to minimize.
[2025-06-02 21:11:25] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2025-06-02 21:11:25] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:11:25] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:11:25] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 1 ms to minimize.
[2025-06-02 21:11:25] [INFO ] Deduced a trap composed of 116 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:11:25] [INFO ] Deduced a trap composed of 116 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:11:26] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:11:26] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:11:26] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:11:26] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:11:26] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 2 ms to minimize.
[2025-06-02 21:11:26] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2025-06-02 21:11:26] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:11:26] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 2 ms to minimize.
[2025-06-02 21:11:27] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:11:27] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2025-06-02 21:11:27] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:11:27] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:11:27] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:11:27] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:11:27] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 1 ms to minimize.
[2025-06-02 21:11:27] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:11:28] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2025-06-02 21:11:28] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:11:28] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 1 ms to minimize.
[2025-06-02 21:11:28] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2025-06-02 21:11:28] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 1 ms to minimize.
[2025-06-02 21:11:28] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:11:28] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:11:28] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:11:29] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:11:29] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:11:29] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 1 ms to minimize.
[2025-06-02 21:11:29] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:11:29] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2025-06-02 21:11:29] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 1 ms to minimize.
[2025-06-02 21:11:29] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 1 ms to minimize.
[2025-06-02 21:11:30] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 1 ms to minimize.
[2025-06-02 21:11:30] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:11:30] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 1 ms to minimize.
[2025-06-02 21:11:30] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 1 ms to minimize.
[2025-06-02 21:11:30] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2025-06-02 21:11:30] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:11:30] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:11:30] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 1 ms to minimize.
[2025-06-02 21:11:31] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:11:31] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:11:31] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2025-06-02 21:11:31] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 1 ms to minimize.
[2025-06-02 21:11:31] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2025-06-02 21:11:31] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:11:31] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:11:31] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:11:32] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 1 ms to minimize.
[2025-06-02 21:11:32] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:11:32] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:11:32] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:11:32] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
[2025-06-02 21:11:32] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:11:33] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:11:33] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2025-06-02 21:11:33] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:11:33] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:11:39] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/692 variables, and 165 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29604 ms.
Refiners :[Positive P Invariants (semi-flows): 42/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/290 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 109/109 constraints]
After SMT, in 30311ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 11 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 8 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-02 21:11:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:11:50] [INFO ] Invariant cache hit.
[2025-06-02 21:11:50] [INFO ] Implicit Places using invariants in 274 ms returned []
[2025-06-02 21:11:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:11:50] [INFO ] Invariant cache hit.
[2025-06-02 21:11:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:11:52] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 1919 ms to find 0 implicit places.
[2025-06-02 21:11:52] [INFO ] Redundant transitions in 2 ms returned []
Running 400 sub problems to find dead transitions.
[2025-06-02 21:11:52] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2025-06-02 21:11:52] [INFO ] Invariant cache hit.
[2025-06-02 21:11:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:11:54] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:11:54] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 2 ms to minimize.
[2025-06-02 21:11:54] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:11:55] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 1 ms to minimize.
[2025-06-02 21:11:55] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:11:55] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:11:55] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:11:55] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:11:55] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:11:55] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:11:56] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:11:56] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:11:56] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 1 ms to minimize.
[2025-06-02 21:11:56] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:11:56] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2025-06-02 21:11:56] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2025-06-02 21:11:56] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:11:56] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:11:57] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:11:57] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:11:57] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:11:57] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:11:57] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:11:58] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2025-06-02 21:11:58] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:11:58] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:11:58] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:11:58] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:11:58] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:11:58] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:11:58] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:11:58] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:11:59] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 1 ms to minimize.
[2025-06-02 21:11:59] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:11:59] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:11:59] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 1 ms to minimize.
[2025-06-02 21:11:59] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:11:59] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:11:59] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:12:00] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:12:03] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:12:03] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 2 ms to minimize.
[2025-06-02 21:12:03] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:12:04] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2025-06-02 21:12:05] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:12:05] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:12:05] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:12:05] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:12:05] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:12:05] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2025-06-02 21:12:05] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:12:05] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:12:05] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2025-06-02 21:12:06] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2025-06-02 21:12:06] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 1 ms to minimize.
[2025-06-02 21:12:06] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:12:06] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:12:06] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2025-06-02 21:12:06] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:12:06] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2025-06-02 21:12:07] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2025-06-02 21:12:07] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2025-06-02 21:12:07] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2025-06-02 21:12:08] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2025-06-02 21:12:08] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2025-06-02 21:12:08] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:12:09] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:12:09] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:12:09] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2025-06-02 21:12:09] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:12:09] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 1 ms to minimize.
[2025-06-02 21:12:09] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2025-06-02 21:12:09] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2025-06-02 21:12:09] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:12:10] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2025-06-02 21:12:10] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2025-06-02 21:12:10] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2025-06-02 21:12:10] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:12:10] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2025-06-02 21:12:10] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2025-06-02 21:12:10] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:12:11] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:12:11] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 5/290 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 400 unsolved
SMT process timed out in 30305ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 30308ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32245 ms. Remains : 290/290 places, 406/406 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Ending property specific reduction for PolyORBNT-PT-S05J20-UpperBounds-09 in 211815 ms.
[2025-06-02 21:12:22] [INFO ] Flatten gal took : 18 ms
[2025-06-02 21:12:22] [INFO ] Applying decomposition
[2025-06-02 21:12:22] [INFO ] Flatten gal took : 18 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/graph12899546362597707025.txt' '-o' '/tmp/graph12899546362597707025.bin' '-w' '/tmp/graph12899546362597707025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12899546362597707025.bin' '-l' '-1' '-v' '-w' '/tmp/graph12899546362597707025.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:12:22] [INFO ] Decomposing Gal with order
[2025-06-02 21:12:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:12:22] [INFO ] Removed a total of 424 redundant transitions.
[2025-06-02 21:12:22] [INFO ] Flatten gal took : 42 ms
[2025-06-02 21:12:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 6 ms.
[2025-06-02 21:12:22] [INFO ] Time to serialize gal into /tmp/UpperBounds4916139979585204502.gal : 5 ms
[2025-06-02 21:12:22] [INFO ] Time to serialize properties into /tmp/UpperBounds14164669859805270161.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/UpperBounds4916139979585204502.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14164669859805270161.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds14164669859805270161.prop.
ITS-tools command line returned an error code 137
[2025-06-02 21:20:31] [INFO ] Flatten gal took : 26 ms
[2025-06-02 21:20:31] [INFO ] Time to serialize gal into /tmp/UpperBounds428472418218910145.gal : 4 ms
[2025-06-02 21:20:31] [INFO ] Time to serialize properties into /tmp/UpperBounds9921161256449663798.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/UpperBounds428472418218910145.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9921161256449663798.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/UpperBounds9921161256449663798.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.27496e+08,883.267,13165052,2,6.99598e+06,5,4.49633e+07,6,0,1585,1.00981e+07,0
Total reachable state count : 327495725

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property PolyORBNT-PT-S05J20-UpperBounds-09 :0 <= place_523_1 <= 3
FORMULA PolyORBNT-PT-S05J20-UpperBounds-09 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBNT-PT-S05J20-UpperBounds-09,0,888.168,13165052,1,0,7,4.49633e+07,9,1,2162,1.00981e+07,4
Total runtime 1814359 ms.

BK_STOP 1748900124034

--------------------
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="PolyORBNT-PT-S05J20"
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 PolyORBNT-PT-S05J20, 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-174881266100080"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J20.tgz
mv PolyORBNT-PT-S05J20 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;