fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r226-smll-174903490600067
Last Updated
June 24, 2025

About the Execution of ITS-Tools for StigmergyCommit-PT-06a

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 368167.00 0.00 0.00 TFFTTFTFTFFFFFFF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490600067.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 itstools
Input is StigmergyCommit-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490600067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749072053450

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-04 21:20:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 21:20:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 21:20:56] [INFO ] Load time of PNML (sax parser for PT used): 608 ms
[2025-06-04 21:20:56] [INFO ] Transformed 256 places.
[2025-06-04 21:20:56] [INFO ] Transformed 2816 transitions.
[2025-06-04 21:20:56] [INFO ] Found NUPN structural information;
[2025-06-04 21:20:56] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 890 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 587/587 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 206 transition count 530
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 206 transition count 530
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 106 place count 206 transition count 524
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 131 place count 181 transition count 492
Iterating global reduction 1 with 25 rules applied. Total rules applied 156 place count 181 transition count 492
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 162 place count 181 transition count 486
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 167 place count 176 transition count 481
Iterating global reduction 2 with 5 rules applied. Total rules applied 172 place count 176 transition count 481
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 177 place count 171 transition count 476
Iterating global reduction 2 with 5 rules applied. Total rules applied 182 place count 171 transition count 476
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 187 place count 166 transition count 471
Iterating global reduction 2 with 5 rules applied. Total rules applied 192 place count 166 transition count 471
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 196 place count 162 transition count 467
Iterating global reduction 2 with 4 rules applied. Total rules applied 200 place count 162 transition count 467
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 204 place count 162 transition count 463
Applied a total of 204 rules in 190 ms. Remains 162 /256 variables (removed 94) and now considering 463/587 (removed 124) transitions.
[2025-06-04 21:20:57] [INFO ] Flow matrix only has 455 transitions (discarded 8 similar events)
// Phase 1: matrix 455 rows 162 cols
[2025-06-04 21:20:57] [INFO ] Computed 2 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:20:57] [INFO ] Implicit Places using invariants in 654 ms returned []
[2025-06-04 21:20:57] [INFO ] Flow matrix only has 455 transitions (discarded 8 similar events)
[2025-06-04 21:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:20:58] [INFO ] State equation strengthened by 324 read => feed constraints.
[2025-06-04 21:20:59] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned [161]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2873 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/256 places, 463/587 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 145 transition count 447
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 145 transition count 447
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 145 transition count 442
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 140 transition count 437
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 140 transition count 437
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 135 transition count 432
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 135 transition count 432
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 131 transition count 428
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 131 transition count 428
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 127 transition count 424
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 127 transition count 424
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 123 transition count 420
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 123 transition count 420
Applied a total of 81 rules in 26 ms. Remains 123 /161 variables (removed 38) and now considering 420/463 (removed 43) transitions.
[2025-06-04 21:20:59] [INFO ] Flow matrix only has 412 transitions (discarded 8 similar events)
// Phase 1: matrix 412 rows 123 cols
[2025-06-04 21:20:59] [INFO ] Computed 1 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:20:59] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-04 21:20:59] [INFO ] Flow matrix only has 412 transitions (discarded 8 similar events)
[2025-06-04 21:20:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:21:00] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:21:00] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 123/256 places, 420/587 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3514 ms. Remains : 123/256 places, 420/587 transitions.
Support contains 17 out of 123 places after structural reductions.
[2025-06-04 21:21:00] [INFO ] Flatten gal took : 135 ms
[2025-06-04 21:21:00] [INFO ] Flatten gal took : 87 ms
[2025-06-04 21:21:00] [INFO ] Input system was already deterministic with 420 transitions.
RANDOM walk for 40000 steps (22 resets) in 4561 ms. (8 steps per ms) remains 0/10 properties
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(!p1))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 420/420 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 113 transition count 410
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 113 transition count 410
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 106 transition count 403
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 106 transition count 403
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 106 transition count 400
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 102 transition count 396
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 102 transition count 396
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 99 transition count 393
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 99 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 99 transition count 392
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 97 transition count 390
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 97 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 95 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 95 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 95 transition count 387
Applied a total of 61 rules in 22 ms. Remains 95 /123 variables (removed 28) and now considering 387/420 (removed 33) transitions.
[2025-06-04 21:21:02] [INFO ] Flow matrix only has 379 transitions (discarded 8 similar events)
// Phase 1: matrix 379 rows 95 cols
[2025-06-04 21:21:02] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:21:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-04 21:21:02] [INFO ] Flow matrix only has 379 transitions (discarded 8 similar events)
[2025-06-04 21:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:21:02] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:21:02] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2025-06-04 21:21:02] [INFO ] Flow matrix only has 379 transitions (discarded 8 similar events)
[2025-06-04 21:21:02] [INFO ] Invariant cache hit.
[2025-06-04 21:21:02] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:09] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:09] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:09] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:09] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:10] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:10] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:10] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:10] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:11] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:11] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:11] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:11] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:11] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:11] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:11] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:11] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:12] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:12] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:12] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:12] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:12] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:12] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:12] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:13] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:13] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:13] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:13] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:13] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:13] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:13] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:13] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:14] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:14] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:14] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:14] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:14] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:14] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:14] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:14] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:14] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:16] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:16] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:16] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:16] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:16] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:17] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:17] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:17] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:17] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:18] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:18] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:18] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:18] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:19] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:19] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:19] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:22] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:22] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:22] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:22] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:22] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:22] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:24] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:24] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:28] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:29] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 473/474 variables, and 162 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 0/260 constraints, PredecessorRefiner: 386/124 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:39] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:39] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 378/473 variables, 95/164 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 259/423 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 124/547 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/474 variables, and 547 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 386/124 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61611ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 61641ms
Starting structural reductions in LTL mode, iteration 1 : 95/123 places, 387/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62068 ms. Remains : 95/123 places, 387/420 transitions.
Stuttering acceptance computed with spot in 594 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-01
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-01 finished in 62750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (G(p1) U X(G(p2)))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 420/420 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 115 transition count 412
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 115 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 115 transition count 410
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 110 transition count 405
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 110 transition count 405
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 110 transition count 402
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 108 transition count 400
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 108 transition count 400
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 106 transition count 398
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 106 transition count 398
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 104 transition count 396
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 104 transition count 396
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 103 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 103 transition count 395
Applied a total of 45 rules in 17 ms. Remains 103 /123 variables (removed 20) and now considering 395/420 (removed 25) transitions.
[2025-06-04 21:22:05] [INFO ] Flow matrix only has 387 transitions (discarded 8 similar events)
// Phase 1: matrix 387 rows 103 cols
[2025-06-04 21:22:05] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:22:05] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-04 21:22:05] [INFO ] Flow matrix only has 387 transitions (discarded 8 similar events)
[2025-06-04 21:22:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:22:05] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:22:05] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2025-06-04 21:22:05] [INFO ] Flow matrix only has 387 transitions (discarded 8 similar events)
[2025-06-04 21:22:05] [INFO ] Invariant cache hit.
[2025-06-04 21:22:05] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:11] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:11] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:12] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:12] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:12] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:12] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:12] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:12] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:13] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:13] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:13] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:13] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:13] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:13] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:13] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:13] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:14] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:14] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:14] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:14] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:14] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:15] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:15] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:15] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:15] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:15] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:15] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:15] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:15] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:15] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:16] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:16] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:16] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:16] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:16] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:16] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:16] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:17] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:18] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:18] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:21] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:21] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:21] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:21] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:22] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:22] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:22] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:22] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:22] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:22] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:22] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:23] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:23] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:23] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:23] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:23] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:23] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:23] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:23] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:23] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:24] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:24] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:24] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:24] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:25] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:25] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:25] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:25] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:27] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:27] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:27] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:27] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:29] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:32] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:34] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:34] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/490 variables, and 77 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/103 constraints, ReadFeed: 0/260 constraints, PredecessorRefiner: 394/132 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:39] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:40] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:22:47] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (OVERLAPS) 386/489 variables, 103/184 constraints. Problems are: Problem set: 0 solved, 394 unsolved
SMT process timed out in 60908ms, After SMT, problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60918ms
Starting structural reductions in LTL mode, iteration 1 : 103/123 places, 395/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61466 ms. Remains : 103/123 places, 395/420 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-02
Product exploration explored 100000 steps with 33336 reset in 488 ms.
Product exploration explored 100000 steps with 33304 reset in 394 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 216 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND p1 (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1) p2)]
RANDOM walk for 40000 steps (20 resets) in 1026 ms. (38 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
[2025-06-04 21:23:08] [INFO ] Flow matrix only has 387 transitions (discarded 8 similar events)
[2025-06-04 21:23:08] [INFO ] Invariant cache hit.
[2025-06-04 21:23:08] [INFO ] State equation strengthened by 260 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 386/489 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 259/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/490 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/490 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 364 constraints, problems are : Problem set: 0 solved, 1 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:08] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:09] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:09] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:09] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:09] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:09] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:10] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:10] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:10] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:10] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:10] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:11] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:11] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:11] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:11] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:11] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:11] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:11] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:11] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:12] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:12] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:12] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:12] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:12] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:12] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:12] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:12] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:12] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 5 ms to minimize.
Problem apf4 is UNSAT
After SMT solving in domain Int declared 103/490 variables, and 29 constraints, problems are : Problem set: 1 solved, 0 unsolved in 4117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/103 constraints, ReadFeed: 0/260 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4382ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 14 factoid took 534 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND p1 (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1) p2)]
Stuttering acceptance computed with spot in 221 ms :[(AND p1 (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1) p2)]
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 395/395 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 102 transition count 367
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 75 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 74 transition count 366
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 56 place count 74 transition count 360
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 68 place count 68 transition count 360
Performed 30 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 128 place count 38 transition count 321
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 166 place count 38 transition count 283
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 176 place count 33 transition count 278
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 181 place count 33 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 227 transitions
Redundant transition composition rules discarded 227 transitions
Iterating global reduction 5 with 227 rules applied. Total rules applied 408 place count 33 transition count 46
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 422 place count 26 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 25 transition count 38
Applied a total of 423 rules in 174 ms. Remains 25 /103 variables (removed 78) and now considering 38/395 (removed 357) transitions.
[2025-06-04 21:23:14] [INFO ] Flow matrix only has 31 transitions (discarded 7 similar events)
// Phase 1: matrix 31 rows 25 cols
[2025-06-04 21:23:14] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:23:14] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-04 21:23:14] [INFO ] Flow matrix only has 31 transitions (discarded 7 similar events)
[2025-06-04 21:23:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:23:14] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-04 21:23:14] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:23:14] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2025-06-04 21:23:14] [INFO ] Flow matrix only has 31 transitions (discarded 7 similar events)
[2025-06-04 21:23:14] [INFO ] Invariant cache hit.
[2025-06-04 21:23:14] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:16] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:16] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 30/55 variables, 25/64 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 1/56 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 0/56 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 73 constraints, problems are : Problem set: 0 solved, 37 unsolved in 3512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:18] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:18] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 30/55 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 37/112 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 1/56 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 113 constraints, problems are : Problem set: 0 solved, 37 unsolved in 3135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6664ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 6666ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/103 places, 38/395 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6960 ms. Remains : 25/103 places, 38/395 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 185 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND p1 (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1) p2)]
RANDOM walk for 40000 steps (4090 resets) in 595 ms. (67 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (1372 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
[2025-06-04 21:23:21] [INFO ] Flow matrix only has 31 transitions (discarded 7 similar events)
[2025-06-04 21:23:21] [INFO ] Invariant cache hit.
[2025-06-04 21:23:21] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/55 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/56 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 1 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:21] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:21] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:22] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Int declared 55/56 variables, and 44 constraints, problems are : Problem set: 1 solved, 0 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1149ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 16 factoid took 477 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND p1 (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1) p2)]
Stuttering acceptance computed with spot in 221 ms :[(AND p1 (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1) p2)]
Stuttering acceptance computed with spot in 220 ms :[(AND p1 (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1) p2)]
Product exploration explored 100000 steps with 0 reset in 266 ms.
Product exploration explored 100000 steps with 0 reset in 277 ms.
Built C files in :
/tmp/ltsmin9580510362825336875
[2025-06-04 21:23:24] [INFO ] Computing symmetric may disable matrix : 38 transitions.
[2025-06-04 21:23:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:23:24] [INFO ] Computing symmetric may enable matrix : 38 transitions.
[2025-06-04 21:23:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:23:24] [INFO ] Computing Do-Not-Accords matrix : 38 transitions.
[2025-06-04 21:23:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:23:24] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9580510362825336875
Running compilation step : cd /tmp/ltsmin9580510362825336875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 500 ms.
Running link step : cd /tmp/ltsmin9580510362825336875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin9580510362825336875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9884527040550821584.hoa' '--buchi-type=spotba'
LTSmin run took 182 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-02 finished in 80221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 420/420 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 112 transition count 409
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 112 transition count 409
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 112 transition count 407
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 106 transition count 401
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 106 transition count 401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 106 transition count 400
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 42 place count 101 transition count 395
Iterating global reduction 2 with 5 rules applied. Total rules applied 47 place count 101 transition count 395
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 97 transition count 391
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 97 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 97 transition count 390
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 59 place count 94 transition count 387
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 94 transition count 387
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 92 transition count 385
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 92 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 92 transition count 384
Applied a total of 67 rules in 29 ms. Remains 92 /123 variables (removed 31) and now considering 384/420 (removed 36) transitions.
[2025-06-04 21:23:25] [INFO ] Flow matrix only has 376 transitions (discarded 8 similar events)
// Phase 1: matrix 376 rows 92 cols
[2025-06-04 21:23:25] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:23:25] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-04 21:23:25] [INFO ] Flow matrix only has 376 transitions (discarded 8 similar events)
[2025-06-04 21:23:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:23:25] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:23:25] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2025-06-04 21:23:25] [INFO ] Flow matrix only has 376 transitions (discarded 8 similar events)
[2025-06-04 21:23:25] [INFO ] Invariant cache hit.
[2025-06-04 21:23:25] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:31] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:31] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:31] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:32] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:32] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:32] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:32] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:32] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:33] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:33] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:33] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:33] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:33] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:33] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:34] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:34] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:34] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:34] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:34] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:34] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:35] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:35] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:35] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:35] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:35] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:35] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:36] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:37] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:37] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:37] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:37] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:37] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:39] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:39] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:39] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:40] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:40] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:40] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:40] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:41] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:41] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:42] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:42] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:42] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:42] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:42] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:42] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:42] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:42] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:43] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:43] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:43] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:44] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:44] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:44] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:46] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:47] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:47] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:47] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:47] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 8 (OVERLAPS) 375/467 variables, 92/162 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 259/421 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/468 variables, and 421 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 383/121 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:59] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:59] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:59] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:00] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:00] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:03] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:10] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 6 (OVERLAPS) 375/467 variables, 92/169 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 259/428 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/468 variables, and 549 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 383/121 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60944ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60948ms
Starting structural reductions in LTL mode, iteration 1 : 92/123 places, 384/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61479 ms. Remains : 92/123 places, 384/420 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-05 finished in 61705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 420/420 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 111 transition count 408
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 111 transition count 408
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 111 transition count 406
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 104 transition count 399
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 104 transition count 399
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 104 transition count 397
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 99 transition count 392
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 99 transition count 392
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 95 transition count 388
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 95 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 95 transition count 387
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 92 transition count 384
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 92 transition count 384
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 90 transition count 382
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 90 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 90 transition count 381
Applied a total of 72 rules in 23 ms. Remains 90 /123 variables (removed 33) and now considering 381/420 (removed 39) transitions.
[2025-06-04 21:24:27] [INFO ] Flow matrix only has 373 transitions (discarded 8 similar events)
// Phase 1: matrix 373 rows 90 cols
[2025-06-04 21:24:27] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:27] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-04 21:24:27] [INFO ] Flow matrix only has 373 transitions (discarded 8 similar events)
[2025-06-04 21:24:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:27] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:24:27] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-04 21:24:27] [INFO ] Flow matrix only has 373 transitions (discarded 8 similar events)
[2025-06-04 21:24:27] [INFO ] Invariant cache hit.
[2025-06-04 21:24:27] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:33] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:33] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:33] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:33] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:33] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:34] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:34] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:34] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:34] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:34] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:34] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:35] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:35] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:35] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:35] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:35] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:35] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:35] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:36] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:36] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:36] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:36] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:36] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:37] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:37] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:37] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:37] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:37] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:37] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:37] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:37] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:37] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:38] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:38] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:38] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:38] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:38] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:38] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:38] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:38] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:40] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:40] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:41] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:41] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:41] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:41] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:41] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:41] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:41] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:41] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:42] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:43] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:43] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:43] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:43] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:43] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:43] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:45] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:46] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:46] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:46] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:46] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:49] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:49] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:49] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:49] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:50] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:51] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:53] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:53] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 380 unsolved
SMT process timed out in 30926ms, After SMT, problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 30929ms
Starting structural reductions in LTL mode, iteration 1 : 90/123 places, 381/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31385 ms. Remains : 90/123 places, 381/420 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-10 finished in 31595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 420/420 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 111 transition count 408
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 111 transition count 408
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 111 transition count 406
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 104 transition count 399
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 104 transition count 399
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 104 transition count 396
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 47 place count 100 transition count 392
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 100 transition count 392
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 97 transition count 389
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 97 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 97 transition count 388
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 95 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 95 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 94 transition count 385
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 94 transition count 385
Applied a total of 64 rules in 20 ms. Remains 94 /123 variables (removed 29) and now considering 385/420 (removed 35) transitions.
[2025-06-04 21:24:58] [INFO ] Flow matrix only has 377 transitions (discarded 8 similar events)
// Phase 1: matrix 377 rows 94 cols
[2025-06-04 21:24:58] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:58] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-04 21:24:58] [INFO ] Flow matrix only has 377 transitions (discarded 8 similar events)
[2025-06-04 21:24:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:58] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:24:59] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2025-06-04 21:24:59] [INFO ] Flow matrix only has 377 transitions (discarded 8 similar events)
[2025-06-04 21:24:59] [INFO ] Invariant cache hit.
[2025-06-04 21:24:59] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:04] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:04] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:04] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:05] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:05] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:05] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:05] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:05] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:05] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:06] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:06] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:06] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:06] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:06] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:06] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:06] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:07] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:07] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:07] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:07] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:07] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:08] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:08] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:08] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:08] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:08] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:08] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:08] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:08] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:08] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:08] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:09] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:09] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:09] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:09] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:09] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:09] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:09] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:10] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:10] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:12] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:12] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:12] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:12] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:12] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:12] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:14] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:14] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:14] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:14] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:14] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:14] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:14] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:14] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:15] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:17] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:17] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:17] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:17] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:17] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:17] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:19] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:19] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:19] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:20] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 8 (OVERLAPS) 376/470 variables, 94/160 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 259/419 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/471 variables, and 419 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 384/122 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:33] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:33] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:34] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:34] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:40] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 6 (OVERLAPS) 376/470 variables, 94/165 constraints. Problems are: Problem set: 0 solved, 384 unsolved
SMT process timed out in 60918ms, After SMT, problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 60921ms
Starting structural reductions in LTL mode, iteration 1 : 94/123 places, 385/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61439 ms. Remains : 94/123 places, 385/420 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-13 finished in 61570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 420/420 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 111 transition count 408
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 111 transition count 408
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 111 transition count 406
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 34 place count 103 transition count 398
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 103 transition count 398
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 103 transition count 395
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 98 transition count 390
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 98 transition count 390
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 94 transition count 386
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 94 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 94 transition count 385
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 67 place count 91 transition count 382
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 91 transition count 382
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 89 transition count 380
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 89 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 89 transition count 379
Applied a total of 75 rules in 19 ms. Remains 89 /123 variables (removed 34) and now considering 379/420 (removed 41) transitions.
[2025-06-04 21:26:00] [INFO ] Flow matrix only has 371 transitions (discarded 8 similar events)
// Phase 1: matrix 371 rows 89 cols
[2025-06-04 21:26:00] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:00] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-04 21:26:00] [INFO ] Flow matrix only has 371 transitions (discarded 8 similar events)
[2025-06-04 21:26:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:00] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:26:00] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2025-06-04 21:26:00] [INFO ] Flow matrix only has 371 transitions (discarded 8 similar events)
[2025-06-04 21:26:00] [INFO ] Invariant cache hit.
[2025-06-04 21:26:00] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:05] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:05] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:06] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:06] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:06] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:06] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:06] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:06] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:07] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:07] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:07] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:07] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:07] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:07] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:08] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:08] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:08] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:08] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:08] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:08] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:09] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:09] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:09] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:09] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:09] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:09] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:09] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:09] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:09] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:10] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:10] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:10] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:10] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:10] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:10] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:10] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:10] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:11] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:11] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:11] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:13] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:13] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:13] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:13] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:14] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:14] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:14] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:14] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:14] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:14] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:14] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:14] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:15] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:15] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:16] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:16] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:16] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:16] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:16] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:17] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:17] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:17] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:17] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:17] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:17] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:18] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:18] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:20] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:20] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:20] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:20] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:21] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:21] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (OVERLAPS) 370/459 variables, 89/164 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 259/423 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/460 variables, and 423 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 378/116 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:34] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:34] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:35] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (OVERLAPS) 370/459 variables, 89/167 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 259/426 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/460 variables, and 542 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 378/116 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60793ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60796ms
Starting structural reductions in LTL mode, iteration 1 : 89/123 places, 379/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61285 ms. Remains : 89/123 places, 379/420 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-15
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-15 finished in 61402 ms.
All properties solved by simple procedures.
Total runtime 366107 ms.

BK_STOP 1749072421617

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="StigmergyCommit-PT-06a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-06a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490600067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-06a.tgz
mv StigmergyCommit-PT-06a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;