Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994300428.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 SieveSingleMsgMbox-PT-d1m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994300428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 450K 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 SieveSingleMsgMbox-PT-d1m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749163125681

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 22:38:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 22:38:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 22:38:47] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2025-06-05 22:38:47] [INFO ] Transformed 1295 places.
[2025-06-05 22:38:47] [INFO ] Transformed 749 transitions.
[2025-06-05 22:38:47] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 303 place count 196 transition count 392
Iterating global reduction 1 with 46 rules applied. Total rules applied 349 place count 196 transition count 392
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 354 place count 196 transition count 387
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 384 place count 166 transition count 357
Iterating global reduction 2 with 30 rules applied. Total rules applied 414 place count 166 transition count 357
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 423 place count 166 transition count 348
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 441 place count 148 transition count 329
Iterating global reduction 3 with 18 rules applied. Total rules applied 459 place count 148 transition count 329
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 493 place count 148 transition count 295
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 497 place count 144 transition count 289
Iterating global reduction 4 with 4 rules applied. Total rules applied 501 place count 144 transition count 289
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 505 place count 140 transition count 285
Iterating global reduction 4 with 4 rules applied. Total rules applied 509 place count 140 transition count 285
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 511 place count 138 transition count 282
Iterating global reduction 4 with 2 rules applied. Total rules applied 513 place count 138 transition count 282
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 515 place count 136 transition count 280
Iterating global reduction 4 with 2 rules applied. Total rules applied 517 place count 136 transition count 280
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 519 place count 134 transition count 278
Iterating global reduction 4 with 2 rules applied. Total rules applied 521 place count 134 transition count 278
Applied a total of 521 rules in 86 ms. Remains 134 /259 variables (removed 125) and now considering 278/749 (removed 471) transitions.
// Phase 1: matrix 278 rows 134 cols
[2025-06-05 22:38:47] [INFO ] Computed 5 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:38:47] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-06-05 22:38:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:38:47] [INFO ] State equation strengthened by 186 read => feed constraints.
[2025-06-05 22:38:49] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2025-06-05 22:38:49] [INFO ] Invariant cache hit.
[2025-06-05 22:38:49] [INFO ] State equation strengthened by 186 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:53] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:38:53] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (OVERLAPS) 278/412 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 186/327 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 277 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/412 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 327 constraints, problems are : Problem set: 0 solved, 277 unsolved in 28225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 134/134 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (OVERLAPS) 278/412 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 186/327 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 277/604 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:39:30] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/412 variables, and 605 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 134/134 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58567ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 58579ms
Starting structural reductions in LTL mode, iteration 1 : 134/259 places, 278/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60507 ms. Remains : 134/259 places, 278/749 transitions.
Support contains 26 out of 134 places after structural reductions.
[2025-06-05 22:39:48] [INFO ] Flatten gal took : 44 ms
[2025-06-05 22:39:48] [INFO ] Flatten gal took : 39 ms
[2025-06-05 22:39:48] [INFO ] Input system was already deterministic with 278 transitions.
Support contains 25 out of 134 places (down from 26) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 23
RANDOM walk for 40000 steps (8909 resets) in 2256 ms. (17 steps per ms) remains 20/23 properties
BEST_FIRST walk for 4004 steps (178 resets) in 99 ms. (40 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (202 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (187 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (183 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (205 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (203 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (406 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (184 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (184 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (176 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (437 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (187 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (199 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (211 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (183 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (187 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (194 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (199 resets) in 53 ms. (74 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (182 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (178 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
[2025-06-05 22:39:49] [INFO ] Invariant cache hit.
[2025-06-05 22:39:49] [INFO ] State equation strengthened by 186 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 53/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 8/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 32/115 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:39:49] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 264/379 variables, 115/121 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 172/293 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 33/412 variables, 19/312 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 14/326 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/412 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 326 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2747 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 134/134 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 53/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 8/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 32/115 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 264/379 variables, 115/121 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 172/293 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 33/412 variables, 19/313 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 14/327 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 19/346 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/412 variables, and 346 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 134/134 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7819ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 278/278 transitions.
Graph (complete) has 487 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 276
Applied a total of 3 rules in 44 ms. Remains 133 /134 variables (removed 1) and now considering 276/278 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 133/134 places, 276/278 transitions.
RANDOM walk for 40000 steps (8924 resets) in 543 ms. (73 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (194 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (188 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (174 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (185 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (196 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (199 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (423 resets) in 51 ms. (76 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (182 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (195 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (199 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (408 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (186 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (202 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (184 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (211 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (187 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (180 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (188 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (174 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (192 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 796242 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :17 out of 20
Probabilistic random walk after 796242 steps, saw 379196 distinct states, run finished after 3008 ms. (steps per millisecond=264 ) properties seen :17
// Phase 1: matrix 276 rows 133 cols
[2025-06-05 22:40:00] [INFO ] Computed 4 invariants in 3 ms
[2025-06-05 22:40:00] [INFO ] State equation strengthened by 184 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 115/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 284/403 variables, 123/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 161/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/409 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 6/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/409 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 321 constraints, problems are : Problem set: 0 solved, 3 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 115/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 284/403 variables, 123/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 161/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/409 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:40:02] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/409 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 325 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2287 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2768ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2284 ms.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 276/276 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 119 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 119 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 119 transition count 157
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 107 transition count 145
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 107 transition count 145
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 65 place count 107 transition count 136
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 101 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 101 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 101 transition count 127
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 98 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 98 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 95 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 95 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 93 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 93 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 98 place count 93 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 91 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 90 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 90 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 89 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 88 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 88 transition count 110
Applied a total of 108 rules in 32 ms. Remains 88 /133 variables (removed 45) and now considering 110/276 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 88/133 places, 110/276 transitions.
RANDOM walk for 40000 steps (8856 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1864 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1884 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 750215 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :0 out of 3
Probabilistic random walk after 750215 steps, saw 336653 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
// Phase 1: matrix 110 rows 88 cols
[2025-06-05 22:40:08] [INFO ] Computed 4 invariants in 1 ms
[2025-06-05 22:40:08] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 114/193 variables, 79/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 35/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5/198 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 5/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 144 constraints, problems are : Problem set: 0 solved, 3 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 114/193 variables, 79/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 35/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5/198 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 5/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/198 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 147 constraints, problems are : Problem set: 0 solved, 3 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 766ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3318 ms.
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 88/88 places, 110/110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2025-06-05 22:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:40:13] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-05 22:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:40:13] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-05 22:40:13] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:40:13] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-05 22:40:13] [INFO ] Invariant cache hit.
[2025-06-05 22:40:13] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/198 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 144 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5837 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/198 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 109/253 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:40:23] [INFO ] Deduced a trap along path composed of 17 places in 48 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 254 constraints, problems are : Problem set: 0 solved, 109 unsolved in 17194 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23073ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 23073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23338 ms. Remains : 88/88 places, 110/110 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 88 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 84 transition count 105
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 9 place count 84 transition count 92
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 35 place count 71 transition count 92
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 2 with 14 rules applied. Total rules applied 49 place count 64 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 63 transition count 85
Applied a total of 51 rules in 26 ms. Remains 63 /88 variables (removed 25) and now considering 85/110 (removed 25) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 85 rows 63 cols
[2025-06-05 22:40:36] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:40:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 22:40:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 22:40:36] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:40:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 22:40:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 22:40:36] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2025-06-05 22:40:36] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-05 22:40:36] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 321 ms.
Computed a total of 19 stabilizing places and 35 stable transitions
Graph (complete) has 537 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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)))'
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 118 transition count 151
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 118 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 118 transition count 148
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 49 place count 104 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 63 place count 104 transition count 134
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 104 transition count 126
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 78 place count 97 transition count 117
Iterating global reduction 2 with 7 rules applied. Total rules applied 85 place count 97 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 97 transition count 114
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 94 transition count 111
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 94 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 91 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 91 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 89 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 108 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 84 transition count 98
Applied a total of 116 rules in 26 ms. Remains 84 /134 variables (removed 50) and now considering 98/278 (removed 180) transitions.
// Phase 1: matrix 98 rows 84 cols
[2025-06-05 22:40:37] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:40:37] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 22:40:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:40:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-05 22:40:37] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:40:37] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2025-06-05 22:40:37] [INFO ] Invariant cache hit.
[2025-06-05 22:40:37] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:40:38] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:40:38] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:40:39] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:40:39] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:40:41] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 6 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/182 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:40:42] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:40:43] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 7 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/182 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/182 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 140 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:40:45] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 98/182 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 44/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 97/238 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:40:52] [INFO ] Deduced a trap along path composed of 4 places in 19 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 239 constraints, problems are : Problem set: 0 solved, 97 unsolved in 15822 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23957ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 23957ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/134 places, 98/278 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24244 ms. Remains : 84/134 places, 98/278 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 finished in 24516 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' '!(((((p0 U X(p1))||X(F(p2))) U G(p3)) U X(!p1)))'
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 121 transition count 174
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 121 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 121 transition count 173
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 109 transition count 161
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 109 transition count 161
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 59 place count 109 transition count 153
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 104 transition count 146
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 104 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 104 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 102 transition count 142
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 102 transition count 142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 100 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 100 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 99 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 99 transition count 139
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 98 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 98 transition count 138
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 97 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 97 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 96 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 96 transition count 135
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 95 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 95 transition count 134
Applied a total of 89 rules in 10 ms. Remains 95 /134 variables (removed 39) and now considering 134/278 (removed 144) transitions.
// Phase 1: matrix 134 rows 95 cols
[2025-06-05 22:41:01] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:41:01] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 22:41:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:41:01] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-05 22:41:01] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2025-06-05 22:41:02] [INFO ] Invariant cache hit.
[2025-06-05 22:41:02] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:03] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:03] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/229 variables, 95/102 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 71/173 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:05] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:06] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 8 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/229 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 175 constraints, problems are : Problem set: 0 solved, 133 unsolved in 8061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/229 variables, 95/104 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 133/308 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:14] [INFO ] Deduced a trap along path composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/229 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 309 constraints, problems are : Problem set: 0 solved, 133 unsolved in 25009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33120ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 33121ms
Starting structural reductions in LTL mode, iteration 1 : 95/134 places, 134/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33485 ms. Remains : 95/134 places, 134/278 transitions.
Stuttering acceptance computed with spot in 372 ms :[p1, p1, (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 459 ms.
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 324 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND (NOT p3) p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 24 ms. Reduced automaton from 8 states, 19 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 finished in 34637 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(p0)))'
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 118 transition count 151
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 118 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 118 transition count 148
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 49 place count 104 transition count 134
Iterating global reduction 1 with 14 rules applied. Total rules applied 63 place count 104 transition count 134
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 104 transition count 126
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 78 place count 97 transition count 117
Iterating global reduction 2 with 7 rules applied. Total rules applied 85 place count 97 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 97 transition count 114
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 94 transition count 111
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 94 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 91 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 91 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 89 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 108 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 84 transition count 98
Applied a total of 116 rules in 8 ms. Remains 84 /134 variables (removed 50) and now considering 98/278 (removed 180) transitions.
// Phase 1: matrix 98 rows 84 cols
[2025-06-05 22:41:36] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:41:36] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-05 22:41:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:41:36] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-05 22:41:36] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2025-06-05 22:41:36] [INFO ] Invariant cache hit.
[2025-06-05 22:41:36] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:37] [INFO ] Deduced a trap composed of 25 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-05 22:41:37] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/182 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:38] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:38] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:40] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 6 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/182 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:41] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:42] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 7 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/182 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/182 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 140 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8067 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:44] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 98/182 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 44/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 97/238 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:41:51] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 239 constraints, problems are : Problem set: 0 solved, 97 unsolved in 15695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23796ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 23797ms
Starting structural reductions in LTL mode, iteration 1 : 84/134 places, 98/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24014 ms. Remains : 84/134 places, 98/278 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 finished in 24149 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((!p0&&X(X(!p1)))) U ((!p2&&X((!p0&&X(X(!p1)))))||X(G((!p0&&X(X(!p1))))))))'
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 119 transition count 152
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 119 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 119 transition count 149
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 106 transition count 136
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 106 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 106 transition count 130
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 99 transition count 121
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 99 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 99 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 85 place count 96 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 88 place count 96 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 93 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 93 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 91 transition count 110
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 91 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 91 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 102 place count 89 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 88 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 87 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 87 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 86 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 86 transition count 102
Applied a total of 110 rules in 12 ms. Remains 86 /134 variables (removed 48) and now considering 102/278 (removed 176) transitions.
// Phase 1: matrix 102 rows 86 cols
[2025-06-05 22:42:00] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:42:00] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 22:42:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:42:00] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 22:42:00] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2025-06-05 22:42:00] [INFO ] Invariant cache hit.
[2025-06-05 22:42:00] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:01] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:01] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 102/188 variables, 86/93 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 46/139 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/188 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 139 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4787 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/188 variables, 86/93 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 46/139 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 101/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:09] [INFO ] Deduced a trap along path composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 241 constraints, problems are : Problem set: 0 solved, 101 unsolved in 17148 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 21975ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 21976ms
Starting structural reductions in LTL mode, iteration 1 : 86/134 places, 102/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22292 ms. Remains : 86/134 places, 102/278 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR p0 p1), (OR p0 p1), true, p1, p1, p1, p1, p1, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-05
Product exploration explored 100000 steps with 28541 reset in 158 ms.
Product exploration explored 100000 steps with 28522 reset in 171 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 277 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 137 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[p1, p1, p1, p1, true]
RANDOM walk for 40000 steps (9011 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1895 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4070 steps, run visited all 1 properties in 8 ms. (steps per millisecond=508 )
Probabilistic random walk after 4070 steps, saw 1793 distinct states, run finished after 11 ms. (steps per millisecond=370 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 14 factoid took 169 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 163 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 86 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-06-05 22:42:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:42:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 22:42:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:42:24] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 22:42:24] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2025-06-05 22:42:24] [INFO ] Invariant cache hit.
[2025-06-05 22:42:24] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:25] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:25] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 102/188 variables, 86/93 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 46/139 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/188 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 139 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4782 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/188 variables, 86/93 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 46/139 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 101/240 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:33] [INFO ] Deduced a trap along path composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 241 constraints, problems are : Problem set: 0 solved, 101 unsolved in 17590 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 22417ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 22418ms
Finished structural reductions in LTL mode , in 1 iterations and 22717 ms. Remains : 86/86 places, 102/102 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 277 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[p1, p1, p1, p1, true]
RANDOM walk for 40000 steps (8974 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1958 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4070 steps, run visited all 1 properties in 7 ms. (steps per millisecond=581 )
Probabilistic random walk after 4070 steps, saw 1793 distinct states, run finished after 7 ms. (steps per millisecond=581 ) properties seen :1
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 142 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 121 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 28572 reset in 237 ms.
Product exploration explored 100000 steps with 28598 reset in 178 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 148 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 102/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 92
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 82 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 82 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 82 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 81 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 81 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 80 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 79 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 79 transition count 84
Applied a total of 17 rules in 24 ms. Remains 79 /86 variables (removed 7) and now considering 84/102 (removed 18) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:42:48] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
// Phase 1: matrix 84 rows 79 cols
[2025-06-05 22:42:48] [INFO ] Computed 5 invariants in 1 ms
[2025-06-05 22:42:48] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:49] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:49] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/163 variables, 79/86 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:50] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:50] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:50] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 123 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3573 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/163 variables, 79/89 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 34/123 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 83/206 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:42:54] [INFO ] Deduced a trap along path composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 207 constraints, problems are : Problem set: 0 solved, 83 unsolved in 10289 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13889ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 13890ms
Starting structural reductions in SI_LTL mode, iteration 1 : 79/86 places, 84/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13922 ms. Remains : 79/86 places, 84/102 transitions.
Built C files in :
/tmp/ltsmin4086661426131773451
[2025-06-05 22:43:02] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4086661426131773451
Running compilation step : cd /tmp/ltsmin4086661426131773451;'/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 314 ms.
Running link step : cd /tmp/ltsmin4086661426131773451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4086661426131773451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16690080059883712283.hoa' '--buchi-type=spotba'
LTSmin run took 137 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 finished in 62741 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((!X(F((X((X(p1)||p2))&&p0))) U p3)))'
Support contains 2 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 120 transition count 173
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 120 transition count 173
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 120 transition count 168
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 45 place count 108 transition count 156
Iterating global reduction 1 with 12 rules applied. Total rules applied 57 place count 108 transition count 156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 65 place count 108 transition count 148
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 103 transition count 141
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 103 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 103 transition count 139
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 101 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 99 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 99 transition count 135
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 98 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 97 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 96 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 95 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 95 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 94 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 94 transition count 129
Applied a total of 95 rules in 26 ms. Remains 94 /134 variables (removed 40) and now considering 129/278 (removed 149) transitions.
// Phase 1: matrix 129 rows 94 cols
[2025-06-05 22:43:03] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:43:03] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 22:43:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:43:03] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-05 22:43:03] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:43:03] [INFO ] Redundant transitions in 5 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-05 22:43:03] [INFO ] Invariant cache hit.
[2025-06-05 22:43:03] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:43:04] [INFO ] Deduced a trap composed of 28 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-05 22:43:04] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/223 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 67/168 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:43:06] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:43:06] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:43:06] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/223 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 171 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7210 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/223 variables, 94/104 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 67/171 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 128/299 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:43:18] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (OVERLAPS) 0/223 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 300 constraints, problems are : Problem set: 0 solved, 128 unsolved in 29365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36615ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 36615ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/134 places, 129/278 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37020 ms. Remains : 94/134 places, 129/278 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p3)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 finished in 37086 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' '!(G((F(p0)&&F((p1||(p1 U !p0))))))'
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 119 transition count 143
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 119 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 119 transition count 142
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 105 transition count 128
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 105 transition count 128
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 66 place count 105 transition count 121
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 98 transition count 113
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 98 transition count 113
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 85 place count 98 transition count 108
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 95 transition count 105
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 95 transition count 105
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 92 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 92 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 90 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 90 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 103 place count 90 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 88 transition count 96
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 88 transition count 96
Applied a total of 107 rules in 21 ms. Remains 88 /134 variables (removed 46) and now considering 96/278 (removed 182) transitions.
// Phase 1: matrix 96 rows 88 cols
[2025-06-05 22:43:40] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:43:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 22:43:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:43:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-05 22:43:40] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:43:40] [INFO ] Redundant transitions in 3 ms returned []
Running 95 sub problems to find dead transitions.
[2025-06-05 22:43:40] [INFO ] Invariant cache hit.
[2025-06-05 22:43:40] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:43:41] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:43:41] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/184 variables, 88/95 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:43:42] [INFO ] Deduced a trap composed of 37 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-05 22:43:42] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:43:42] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 137 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4469 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/184 variables, 88/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 39/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 95/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:43:51] [INFO ] Deduced a trap along path composed of 4 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:43:51] [INFO ] Deduced a trap along path composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/184 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 234 constraints, problems are : Problem set: 0 solved, 95 unsolved in 18328 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 22828ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 22828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/134 places, 96/278 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23100 ms. Remains : 88/134 places, 96/278 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 finished in 23260 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(G(p0))||G((G(p2)||p1)))))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 119 transition count 162
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 119 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 119 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 106 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 106 transition count 145
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 69 place count 106 transition count 136
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 99 transition count 127
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 99 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 86 place count 99 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 96 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 96 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 93 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 93 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 91 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 91 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 105 place count 91 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 89 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 88 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 87 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 86 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 86 transition count 107
Applied a total of 115 rules in 14 ms. Remains 86 /134 variables (removed 48) and now considering 107/278 (removed 171) transitions.
// Phase 1: matrix 107 rows 86 cols
[2025-06-05 22:44:03] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:44:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 22:44:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:44:03] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-05 22:44:03] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-05 22:44:03] [INFO ] Invariant cache hit.
[2025-06-05 22:44:03] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:04] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:04] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 107/193 variables, 86/93 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 52/145 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 145 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/193 variables, 86/93 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 52/145 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 106/251 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:11] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:12] [INFO ] Deduced a trap along path composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 253 constraints, problems are : Problem set: 0 solved, 106 unsolved in 14504 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 18587ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 18587ms
Starting structural reductions in LTL mode, iteration 1 : 86/134 places, 107/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18847 ms. Remains : 86/134 places, 107/278 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-08
Product exploration explored 100000 steps with 22505 reset in 226 ms.
Product exploration explored 100000 steps with 22511 reset in 227 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 281 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 91 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8942 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1949 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1960 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1914 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 955051 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :2 out of 4
Probabilistic random walk after 955051 steps, saw 450007 distinct states, run finished after 3001 ms. (steps per millisecond=318 ) properties seen :2
[2025-06-05 22:44:26] [INFO ] Invariant cache hit.
[2025-06-05 22:44:26] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/69 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 94/163 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 39/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 30/193 variables, 17/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 13/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 143 constraints, problems are : Problem set: 1 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/63 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/68 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 86/154 variables, 68/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 31/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/193 variables, 18/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 21/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 144 constraints, problems are : Problem set: 1 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 392ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 174 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 107/107 transitions.
Graph (complete) has 249 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 85 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 84 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 83 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 83 transition count 96
Applied a total of 7 rules in 5 ms. Remains 83 /86 variables (removed 3) and now considering 96/107 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/86 places, 96/107 transitions.
RANDOM walk for 40000 steps (9025 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1939 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4095 steps, run visited all 1 properties in 9 ms. (steps per millisecond=455 )
Probabilistic random walk after 4095 steps, saw 1878 distinct states, run finished after 9 ms. (steps per millisecond=455 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 290 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 107/107 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-06-05 22:44:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:44:27] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-05 22:44:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:44:27] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-05 22:44:27] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:44:27] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2025-06-05 22:44:27] [INFO ] Invariant cache hit.
[2025-06-05 22:44:27] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:28] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:29] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 107/193 variables, 86/93 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 52/145 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 145 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/193 variables, 86/93 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 52/145 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 106/251 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:35] [INFO ] Deduced a trap along path composed of 4 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:36] [INFO ] Deduced a trap along path composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 253 constraints, problems are : Problem set: 0 solved, 106 unsolved in 14670 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 18736ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 18738ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18988 ms. Remains : 86/86 places, 107/107 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 281 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 102 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8934 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1939 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1937 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1911 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1862 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 728589 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :2 out of 4
Probabilistic random walk after 728589 steps, saw 346054 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :2
[2025-06-05 22:44:50] [INFO ] Invariant cache hit.
[2025-06-05 22:44:50] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/64 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/69 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 94/163 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 39/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 30/193 variables, 17/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 13/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 143 constraints, problems are : Problem set: 1 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/63 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/68 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 86/154 variables, 68/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 31/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/193 variables, 18/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 21/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 144 constraints, problems are : Problem set: 1 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 382ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 175 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 107/107 transitions.
Graph (complete) has 249 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 85 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 84 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 83 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 83 transition count 96
Applied a total of 7 rules in 5 ms. Remains 83 /86 variables (removed 3) and now considering 96/107 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/86 places, 96/107 transitions.
RANDOM walk for 40000 steps (8946 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4095 steps, run visited all 1 properties in 8 ms. (steps per millisecond=511 )
Probabilistic random walk after 4095 steps, saw 1878 distinct states, run finished after 8 ms. (steps per millisecond=511 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 12 factoid took 280 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 22515 reset in 146 ms.
Product exploration explored 100000 steps with 22428 reset in 155 ms.
Built C files in :
/tmp/ltsmin11829975931322985447
[2025-06-05 22:44:51] [INFO ] Computing symmetric may disable matrix : 107 transitions.
[2025-06-05 22:44:51] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:44:51] [INFO ] Computing symmetric may enable matrix : 107 transitions.
[2025-06-05 22:44:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:44:51] [INFO ] Computing Do-Not-Accords matrix : 107 transitions.
[2025-06-05 22:44:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:44:51] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11829975931322985447
Running compilation step : cd /tmp/ltsmin11829975931322985447;'/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 240 ms.
Running link step : cd /tmp/ltsmin11829975931322985447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11829975931322985447;'/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/stateBased5990025068217065819.hoa' '--buchi-type=spotba'
LTSmin run took 1627 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 finished in 50045 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))||(p0 U G(p1))))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 119 transition count 152
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 119 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 119 transition count 149
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 106 transition count 136
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 106 transition count 136
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 67 place count 106 transition count 128
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 100 transition count 121
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 100 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 100 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 97 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 97 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 94 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 94 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 92 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 92 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 92 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 101 place count 90 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 90 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 89 transition count 105
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 89 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 88 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 87 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 87 transition count 103
Applied a total of 109 rules in 13 ms. Remains 87 /134 variables (removed 47) and now considering 103/278 (removed 175) transitions.
// Phase 1: matrix 103 rows 87 cols
[2025-06-05 22:44:53] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:44:53] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 22:44:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:44:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 22:44:53] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2025-06-05 22:44:53] [INFO ] Invariant cache hit.
[2025-06-05 22:44:53] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:54] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/190 variables, 87/93 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 46/139 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:56] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:56] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:56] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:58] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:44:58] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 8 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/190 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 144 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:01] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/190 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 46/145 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 102/247 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:04] [INFO ] Deduced a trap along path composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 248 constraints, problems are : Problem set: 0 solved, 102 unsolved in 14297 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 21341ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 21342ms
Starting structural reductions in LTL mode, iteration 1 : 87/134 places, 103/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21621 ms. Remains : 87/134 places, 103/278 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 finished in 21849 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' '!((G((G(!p0) U (p1||X(p2))))||X(!p2)))'
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 119 transition count 162
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 119 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 119 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 106 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 106 transition count 145
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 68 place count 106 transition count 137
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 74 place count 100 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 100 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 100 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 98 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 94 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 94 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 97 place count 94 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 92 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 92 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 91 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 90 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 89 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 89 transition count 112
Applied a total of 107 rules in 12 ms. Remains 89 /134 variables (removed 45) and now considering 112/278 (removed 166) transitions.
// Phase 1: matrix 112 rows 89 cols
[2025-06-05 22:45:15] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:45:15] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 22:45:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:45:15] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-05 22:45:15] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2025-06-05 22:45:15] [INFO ] Invariant cache hit.
[2025-06-05 22:45:15] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:16] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:17] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 112/201 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 150 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 112/201 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 111/261 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:23] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 262 constraints, problems are : Problem set: 0 solved, 111 unsolved in 15878 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20180ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 20180ms
Starting structural reductions in LTL mode, iteration 1 : 89/134 places, 112/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20496 ms. Remains : 89/134 places, 112/278 transitions.
Stuttering acceptance computed with spot in 263 ms :[false, false, (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 292 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 20 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 finished in 21186 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(p1)||p0))||F(p2)))'
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 119 transition count 162
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 119 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 119 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 106 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 106 transition count 145
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 68 place count 106 transition count 137
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 101 transition count 131
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 101 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 101 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 100 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 100 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 99 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 99 transition count 127
Applied a total of 84 rules in 9 ms. Remains 99 /134 variables (removed 35) and now considering 127/278 (removed 151) transitions.
// Phase 1: matrix 127 rows 99 cols
[2025-06-05 22:45:36] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:45:36] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-05 22:45:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:45:36] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-05 22:45:36] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-06-05 22:45:36] [INFO ] Invariant cache hit.
[2025-06-05 22:45:36] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:38] [INFO ] Deduced a trap composed of 30 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-05 22:45:38] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/226 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 62/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:40] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:40] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/226 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 170 constraints, problems are : Problem set: 0 solved, 126 unsolved in 7122 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:44] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 127/226 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 62/171 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:51] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:56] [INFO ] Deduced a trap along path composed of 4 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:45:56] [INFO ] Deduced a trap along path composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 300 constraints, problems are : Problem set: 0 solved, 126 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 37198ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 37199ms
Starting structural reductions in LTL mode, iteration 1 : 99/134 places, 127/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37586 ms. Remains : 99/134 places, 127/278 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Computed a total of 19 stabilizing places and 25 stable transitions
Graph (complete) has 326 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 finished in 38252 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' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 117 transition count 140
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 117 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 117 transition count 138
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 102 transition count 123
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 102 transition count 123
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 74 place count 102 transition count 115
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 94 transition count 105
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 94 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 94 place count 94 transition count 101
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 90 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 90 transition count 97
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 86 transition count 93
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 86 transition count 93
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 83 transition count 90
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 83 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 83 transition count 88
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 121 place count 80 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 124 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 77 transition count 81
Applied a total of 130 rules in 20 ms. Remains 77 /134 variables (removed 57) and now considering 81/278 (removed 197) transitions.
// Phase 1: matrix 81 rows 77 cols
[2025-06-05 22:46:14] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:46:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-05 22:46:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:46:14] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 22:46:15] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:46:15] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-05 22:46:15] [INFO ] Invariant cache hit.
[2025-06-05 22:46:15] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:15] [INFO ] Deduced a trap composed of 23 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-05 22:46:15] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:16] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:16] [INFO ] Deduced a trap composed of 24 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-05 22:46:16] [INFO ] Deduced a trap composed of 24 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-05 22:46:16] [INFO ] Deduced a trap composed of 22 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-05 22:46:17] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:17] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 122 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:21] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 203 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8773 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 12548ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 12549ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/134 places, 81/278 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12781 ms. Remains : 77/134 places, 81/278 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-13
Product exploration explored 100000 steps with 22940 reset in 118 ms.
Product exploration explored 100000 steps with 23039 reset in 205 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9005 resets) in 74 ms. (533 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (1963 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2025-06-05 22:46:28] [INFO ] Invariant cache hit.
[2025-06-05 22:46:28] [INFO ] State equation strengthened by 32 read => feed constraints.
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) 36/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 62/158 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/77 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-05 22:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:46:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 22:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:46:28] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 22:46:28] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:46:28] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-05 22:46:28] [INFO ] Invariant cache hit.
[2025-06-05 22:46:28] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:29] [INFO ] Deduced a trap composed of 23 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-05 22:46:29] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:30] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:30] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:30] [INFO ] Deduced a trap composed of 24 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-05 22:46:30] [INFO ] Deduced a trap composed of 22 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-05 22:46:30] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:31] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 122 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:35] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 203 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8857 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 12827ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 12827ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13046 ms. Remains : 77/77 places, 81/81 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 158 steps (37 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22903 reset in 128 ms.
Product exploration explored 100000 steps with 23025 reset in 136 ms.
Built C files in :
/tmp/ltsmin5988301328361985336
[2025-06-05 22:46:42] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2025-06-05 22:46:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:46:42] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2025-06-05 22:46:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:46:42] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2025-06-05 22:46:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:46:42] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5988301328361985336
Running compilation step : cd /tmp/ltsmin5988301328361985336;'/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 202 ms.
Running link step : cd /tmp/ltsmin5988301328361985336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5988301328361985336;'/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/stateBased7380663121445288305.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 6 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-05 22:46:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:46:57] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-05 22:46:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:46:57] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 22:46:57] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:46:57] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-05 22:46:57] [INFO ] Invariant cache hit.
[2025-06-05 22:46:57] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:58] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:58] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:59] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:59] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:59] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:59] [INFO ] Deduced a trap composed of 22 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-05 22:46:59] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:46:59] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 122 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3820 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:47:04] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 203 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 12535ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 12536ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12757 ms. Remains : 77/77 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin3926680985527674828
[2025-06-05 22:47:10] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2025-06-05 22:47:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:47:10] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2025-06-05 22:47:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:47:10] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2025-06-05 22:47:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:47:10] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3926680985527674828
Running compilation step : cd /tmp/ltsmin3926680985527674828;'/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 189 ms.
Running link step : cd /tmp/ltsmin3926680985527674828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3926680985527674828;'/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/stateBased14670876031386827206.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 22:47:25] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:47:25] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:47:25] [INFO ] Time to serialize gal into /tmp/LTL14612285090150266893.gal : 2 ms
[2025-06-05 22:47:25] [INFO ] Time to serialize properties into /tmp/LTL15865699008488707153.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14612285090150266893.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14777765636038711887.hoa' '-atoms' '/tmp/LTL15865699008488707153.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15865699008488707153.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14777765636038711887.hoa
Detected timeout of ITS tools.
[2025-06-05 22:47:40] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:47:40] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:47:40] [INFO ] Time to serialize gal into /tmp/LTL17377858295155282862.gal : 2 ms
[2025-06-05 22:47:40] [INFO ] Time to serialize properties into /tmp/LTL3301459972597967422.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17377858295155282862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3301459972597967422.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((s1<1)||(l5<1))")||(G("((s4>=1)&&(l0>=1))"))))))
Formula 0 simplified : G(F!"((s4>=1)&&(l0>=1))" & FG!"((s1<1)||(l5<1))")
Detected timeout of ITS tools.
[2025-06-05 22:47:55] [INFO ] Flatten gal took : 4 ms
[2025-06-05 22:47:55] [INFO ] Applying decomposition
[2025-06-05 22:47:55] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2263642469328861663.txt' '-o' '/tmp/graph2263642469328861663.bin' '-w' '/tmp/graph2263642469328861663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2263642469328861663.bin' '-l' '-1' '-v' '-w' '/tmp/graph2263642469328861663.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:47:55] [INFO ] Decomposing Gal with order
[2025-06-05 22:47:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:47:55] [INFO ] Removed a total of 79 redundant transitions.
[2025-06-05 22:47:55] [INFO ] Flatten gal took : 37 ms
[2025-06-05 22:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 7 ms.
[2025-06-05 22:47:55] [INFO ] Time to serialize gal into /tmp/LTL5148540852823721163.gal : 2 ms
[2025-06-05 22:47:55] [INFO ] Time to serialize properties into /tmp/LTL10077268951203450176.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5148540852823721163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10077268951203450176.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i0.u0.s1<1)||(i1.u2.l5<1))")||(G("((i1.u2.s4>=1)&&(i0.u0.l0>=1))"))))))
Formula 0 simplified : G(F!"((i1.u2.s4>=1)&&(i0.u0.l0>=1))" & FG!"((i0.u0.s1<1)||(i1.u2.l5<1))")
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 finished in 116225 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||G(F(p1))))))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 119 transition count 162
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 119 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 119 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 106 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 106 transition count 145
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 68 place count 106 transition count 137
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 74 place count 100 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 100 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 100 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 98 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 91 transition count 117
Applied a total of 100 rules in 12 ms. Remains 91 /134 variables (removed 43) and now considering 117/278 (removed 161) transitions.
// Phase 1: matrix 117 rows 91 cols
[2025-06-05 22:48:11] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:48:11] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-05 22:48:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:48:11] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-05 22:48:11] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2025-06-05 22:48:11] [INFO ] Invariant cache hit.
[2025-06-05 22:48:11] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:48:12] [INFO ] Deduced a trap composed of 27 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-05 22:48:12] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5659 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:48:20] [INFO ] Deduced a trap along path composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 273 constraints, problems are : Problem set: 0 solved, 116 unsolved in 22713 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28417ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 28417ms
Starting structural reductions in LTL mode, iteration 1 : 91/134 places, 117/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28776 ms. Remains : 91/134 places, 117/278 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
Product exploration explored 100000 steps with 22348 reset in 165 ms.
Product exploration explored 100000 steps with 22351 reset in 179 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (9021 resets) in 223 ms. (178 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1919 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1920 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1927 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1909 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1928220 steps, run timeout after 3001 ms. (steps per millisecond=642 ) properties seen :4 out of 5
Probabilistic random walk after 1928220 steps, saw 835518 distinct states, run finished after 3001 ms. (steps per millisecond=642 ) properties seen :4
[2025-06-05 22:48:43] [INFO ] Invariant cache hit.
[2025-06-05 22:48:43] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 229 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 8 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2025-06-05 22:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:48:44] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-05 22:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:48:44] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-05 22:48:45] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:48:45] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2025-06-05 22:48:45] [INFO ] Invariant cache hit.
[2025-06-05 22:48:45] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:48:46] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:48:46] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5671 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:48:54] [INFO ] Deduced a trap along path composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 273 constraints, problems are : Problem set: 0 solved, 116 unsolved in 22706 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28413ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 28413ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28830 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 137 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8946 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1893 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1893 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1928 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1866 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 2012138 steps, run timeout after 3001 ms. (steps per millisecond=670 ) properties seen :4 out of 5
Probabilistic random walk after 2012138 steps, saw 868707 distinct states, run finished after 3001 ms. (steps per millisecond=670 ) properties seen :4
[2025-06-05 22:49:16] [INFO ] Invariant cache hit.
[2025-06-05 22:49:16] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 281 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 22337 reset in 169 ms.
Product exploration explored 100000 steps with 22423 reset in 167 ms.
Built C files in :
/tmp/ltsmin7491870511144030086
[2025-06-05 22:49:18] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2025-06-05 22:49:18] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:49:18] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2025-06-05 22:49:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:49:18] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2025-06-05 22:49:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:49:18] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7491870511144030086
Running compilation step : cd /tmp/ltsmin7491870511144030086;'/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 264 ms.
Running link step : cd /tmp/ltsmin7491870511144030086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7491870511144030086;'/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/stateBased16236788945422644676.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 8 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2025-06-05 22:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:49:33] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-05 22:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:49:33] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-05 22:49:33] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:49:33] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2025-06-05 22:49:33] [INFO ] Invariant cache hit.
[2025-06-05 22:49:33] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:49:34] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:49:34] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5698 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:49:43] [INFO ] Deduced a trap along path composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 273 constraints, problems are : Problem set: 0 solved, 116 unsolved in 22675 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28409ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 28410ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28758 ms. Remains : 91/91 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin5147224016436609098
[2025-06-05 22:50:02] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2025-06-05 22:50:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:50:02] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2025-06-05 22:50:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:50:02] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2025-06-05 22:50:02] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:50:02] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5147224016436609098
Running compilation step : cd /tmp/ltsmin5147224016436609098;'/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 247 ms.
Running link step : cd /tmp/ltsmin5147224016436609098;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5147224016436609098;'/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/stateBased8043920690393231437.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 22:50:17] [INFO ] Flatten gal took : 6 ms
[2025-06-05 22:50:17] [INFO ] Flatten gal took : 6 ms
[2025-06-05 22:50:17] [INFO ] Time to serialize gal into /tmp/LTL15621925943771553694.gal : 1 ms
[2025-06-05 22:50:17] [INFO ] Time to serialize properties into /tmp/LTL15568880355059295877.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15621925943771553694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15184686118318630305.hoa' '-atoms' '/tmp/LTL15568880355059295877.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15568880355059295877.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15184686118318630305.hoa
Detected timeout of ITS tools.
[2025-06-05 22:50:32] [INFO ] Flatten gal took : 6 ms
[2025-06-05 22:50:32] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:50:32] [INFO ] Time to serialize gal into /tmp/LTL11448860380428062415.gal : 1 ms
[2025-06-05 22:50:32] [INFO ] Time to serialize properties into /tmp/LTL8045041679391838398.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11448860380428062415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8045041679391838398.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")))||("((s1>=1)&&(l1189>=1))")))))
Formula 0 simplified : XG(!"((s1>=1)&&(l1189>=1))" & FG!"(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")
Detected timeout of ITS tools.
[2025-06-05 22:50:47] [INFO ] Flatten gal took : 6 ms
[2025-06-05 22:50:47] [INFO ] Applying decomposition
[2025-06-05 22:50:47] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5042561311910140930.txt' '-o' '/tmp/graph5042561311910140930.bin' '-w' '/tmp/graph5042561311910140930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5042561311910140930.bin' '-l' '-1' '-v' '-w' '/tmp/graph5042561311910140930.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:50:47] [INFO ] Decomposing Gal with order
[2025-06-05 22:50:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:50:47] [INFO ] Removed a total of 88 redundant transitions.
[2025-06-05 22:50:47] [INFO ] Flatten gal took : 12 ms
[2025-06-05 22:50:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 3 ms.
[2025-06-05 22:50:47] [INFO ] Time to serialize gal into /tmp/LTL12719882961093498043.gal : 2 ms
[2025-06-05 22:50:47] [INFO ] Time to serialize properties into /tmp/LTL13625533512532797670.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12719882961093498043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13625533512532797670.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((i0.u0.s1<1)||(i0.u0.l1186<1))&&((i0.u0.s1<1)||(i0.u0.l1189<1)))")))||("((i0.u0.s1>=1)&&(i0.u0.l1189>=1))")))))
Formula 0 simplified : XG(!"((i0.u0.s1>=1)&&(i0.u0.l1189>=1))" & FG!"(((i0.u0.s1<1)||(i0.u0.l1186<1))&&((i0.u0.s1<1)||(i0.u0.l1189<1)))")
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 finished in 171455 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' '!((p0 U G((!p1&&X((!p1 U (!p2||G(!p1))))))))'
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 119 transition count 162
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 119 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 119 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 106 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 106 transition count 145
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 69 place count 106 transition count 136
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 100 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 100 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 100 transition count 127
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 97 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 97 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 94 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 94 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 92 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 92 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 92 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 90 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 90 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 89 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 88 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 87 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 87 transition count 110
Applied a total of 112 rules in 22 ms. Remains 87 /134 variables (removed 47) and now considering 110/278 (removed 168) transitions.
// Phase 1: matrix 110 rows 87 cols
[2025-06-05 22:51:02] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:51:02] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-05 22:51:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:51:02] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-05 22:51:02] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:51:02] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-05 22:51:02] [INFO ] Invariant cache hit.
[2025-06-05 22:51:02] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:03] [INFO ] Deduced a trap composed of 26 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-05 22:51:03] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/197 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 53/147 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:05] [INFO ] Deduced a trap composed of 27 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-05 22:51:05] [INFO ] Deduced a trap composed of 27 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-05 22:51:05] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 150 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/197 variables, 87/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 53/150 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 109/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:12] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:12] [INFO ] Deduced a trap along path composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 261 constraints, problems are : Problem set: 0 solved, 109 unsolved in 16044 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 22174ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 22175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/134 places, 110/278 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22495 ms. Remains : 87/134 places, 110/278 transitions.
Stuttering acceptance computed with spot in 195 ms :[p1, true, (AND p1 p2), p1, (AND p1 p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-15
Product exploration explored 100000 steps with 22381 reset in 142 ms.
Product exploration explored 100000 steps with 22347 reset in 148 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 286 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 120 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, p1]
RANDOM walk for 40000 steps (9052 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1884 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4088 steps, run visited all 1 properties in 11 ms. (steps per millisecond=371 )
Probabilistic random walk after 4088 steps, saw 1897 distinct states, run finished after 11 ms. (steps per millisecond=371 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 25 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 finished in 23440 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' '!(G(F((G(p1)||p0))))'
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||G(F(p1))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 134/134 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 119 transition count 162
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 119 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 119 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 106 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 106 transition count 145
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 68 place count 106 transition count 137
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 74 place count 100 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 100 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 100 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 98 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 91 transition count 117
Applied a total of 100 rules in 27 ms. Remains 91 /134 variables (removed 43) and now considering 117/278 (removed 161) transitions.
// Phase 1: matrix 117 rows 91 cols
[2025-06-05 22:51:26] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:51:26] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-05 22:51:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:51:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-05 22:51:26] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2025-06-05 22:51:26] [INFO ] Invariant cache hit.
[2025-06-05 22:51:26] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:27] [INFO ] Deduced a trap composed of 27 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-05 22:51:27] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5658 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:36] [INFO ] Deduced a trap along path composed of 17 places in 43 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 273 constraints, problems are : Problem set: 0 solved, 116 unsolved in 22905 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28618ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 28618ms
Starting structural reductions in LI_LTL mode, iteration 1 : 91/134 places, 117/278 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 28984 ms. Remains : 91/134 places, 117/278 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14
Product exploration explored 100000 steps with 22396 reset in 143 ms.
Product exploration explored 100000 steps with 22554 reset in 161 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (9012 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1925 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1945 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1866 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1971 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1893 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 2302361 steps, run timeout after 3001 ms. (steps per millisecond=767 ) properties seen :4 out of 5
Probabilistic random walk after 2302361 steps, saw 993155 distinct states, run finished after 3002 ms. (steps per millisecond=766 ) properties seen :4
[2025-06-05 22:51:59] [INFO ] Invariant cache hit.
[2025-06-05 22:51:59] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 191 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2025-06-05 22:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:51:59] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-05 22:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:51:59] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-05 22:51:59] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:51:59] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2025-06-05 22:51:59] [INFO ] Invariant cache hit.
[2025-06-05 22:51:59] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:01] [INFO ] Deduced a trap composed of 27 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-05 22:52:01] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5515 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:09] [INFO ] Deduced a trap along path composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 273 constraints, problems are : Problem set: 0 solved, 116 unsolved in 22174 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27747ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 27748ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28136 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 116 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (8941 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1825 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1893 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1901 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1895 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1879 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 2006242 steps, run timeout after 3001 ms. (steps per millisecond=668 ) properties seen :4 out of 5
Probabilistic random walk after 2006242 steps, saw 865785 distinct states, run finished after 3003 ms. (steps per millisecond=668 ) properties seen :4
[2025-06-05 22:52:31] [INFO ] Invariant cache hit.
[2025-06-05 22:52:31] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
After SMT solving in domain Real declared 3/208 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/91 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 314 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 22380 reset in 169 ms.
Product exploration explored 100000 steps with 22465 reset in 180 ms.
Built C files in :
/tmp/ltsmin885623081927087485
[2025-06-05 22:52:32] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2025-06-05 22:52:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:52:32] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2025-06-05 22:52:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:52:32] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2025-06-05 22:52:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:52:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin885623081927087485
Running compilation step : cd /tmp/ltsmin885623081927087485;'/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 251 ms.
Running link step : cd /tmp/ltsmin885623081927087485;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin885623081927087485;'/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/stateBased12111202761534226835.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2025-06-05 22:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:52:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-05 22:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:52:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-05 22:52:48] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:52:48] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2025-06-05 22:52:48] [INFO ] Invariant cache hit.
[2025-06-05 22:52:48] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:49] [INFO ] Deduced a trap composed of 27 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-05 22:52:49] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 156 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5641 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/208 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 116/272 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:57] [INFO ] Deduced a trap along path composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 273 constraints, problems are : Problem set: 0 solved, 116 unsolved in 22262 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27954ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 27954ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28308 ms. Remains : 91/91 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin683718478013680615
[2025-06-05 22:53:16] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2025-06-05 22:53:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:53:16] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2025-06-05 22:53:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:53:16] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2025-06-05 22:53:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:53:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin683718478013680615
Running compilation step : cd /tmp/ltsmin683718478013680615;'/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 240 ms.
Running link step : cd /tmp/ltsmin683718478013680615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin683718478013680615;'/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/stateBased10683548255618286506.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 22:53:31] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:53:31] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:53:31] [INFO ] Time to serialize gal into /tmp/LTL3298507614153705845.gal : 1 ms
[2025-06-05 22:53:31] [INFO ] Time to serialize properties into /tmp/LTL16836749792276556101.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3298507614153705845.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11526159422039729145.hoa' '-atoms' '/tmp/LTL16836749792276556101.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16836749792276556101.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11526159422039729145.hoa
Detected timeout of ITS tools.
[2025-06-05 22:53:46] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:53:46] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:53:46] [INFO ] Time to serialize gal into /tmp/LTL3307873629590411275.gal : 1 ms
[2025-06-05 22:53:46] [INFO ] Time to serialize properties into /tmp/LTL9562096246706659410.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3307873629590411275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9562096246706659410.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")))||("((s1>=1)&&(l1189>=1))")))))
Formula 0 simplified : XG(!"((s1>=1)&&(l1189>=1))" & FG!"(((s1<1)||(l1186<1))&&((s1<1)||(l1189<1)))")
Detected timeout of ITS tools.
[2025-06-05 22:54:01] [INFO ] Flatten gal took : 11 ms
[2025-06-05 22:54:01] [INFO ] Applying decomposition
[2025-06-05 22:54:01] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2566260326969596346.txt' '-o' '/tmp/graph2566260326969596346.bin' '-w' '/tmp/graph2566260326969596346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2566260326969596346.bin' '-l' '-1' '-v' '-w' '/tmp/graph2566260326969596346.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:54:01] [INFO ] Decomposing Gal with order
[2025-06-05 22:54:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:54:01] [INFO ] Removed a total of 111 redundant transitions.
[2025-06-05 22:54:01] [INFO ] Flatten gal took : 13 ms
[2025-06-05 22:54:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 3 ms.
[2025-06-05 22:54:01] [INFO ] Time to serialize gal into /tmp/LTL1250738175891652313.gal : 1 ms
[2025-06-05 22:54:01] [INFO ] Time to serialize properties into /tmp/LTL9212028581216210746.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1250738175891652313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9212028581216210746.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(((i5.u0.s1<1)||(i5.u15.l1186<1))&&((i5.u0.s1<1)||(i5.u17.l1189<1)))")))||("((i5.u0.s1>=1)&&(i5.u17.l1189>=1))")))))
Formula 0 simplified : XG(!"((i5.u0.s1>=1)&&(i5.u17.l1189>=1))" & FG!"(((i5.u0.s1<1)||(i5.u15.l1186<1))&&((i5.u0.s1<1)||(i5.u17.l1189<1)))")
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 finished in 170386 ms.
[2025-06-05 22:54:16] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15414371636819091360
[2025-06-05 22:54:16] [INFO ] Applying decomposition
[2025-06-05 22:54:16] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2025-06-05 22:54:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:54:16] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2025-06-05 22:54:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:54:16] [INFO ] Flatten gal took : 10 ms
[2025-06-05 22:54:16] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9420712011685903210.txt' '-o' '/tmp/graph9420712011685903210.bin' '-w' '/tmp/graph9420712011685903210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9420712011685903210.bin' '-l' '-1' '-v' '-w' '/tmp/graph9420712011685903210.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:54:16] [INFO ] Decomposing Gal with order
[2025-06-05 22:54:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:54:16] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:54:16] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15414371636819091360
Running compilation step : cd /tmp/ltsmin15414371636819091360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
[2025-06-05 22:54:16] [INFO ] Removed a total of 150 redundant transitions.
[2025-06-05 22:54:16] [INFO ] Flatten gal took : 19 ms
[2025-06-05 22:54:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 5 ms.
[2025-06-05 22:54:16] [INFO ] Time to serialize gal into /tmp/LTLFireability2720695909509329115.gal : 2 ms
[2025-06-05 22:54:16] [INFO ] Time to serialize properties into /tmp/LTLFireability5151499311015655862.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2720695909509329115.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5151499311015655862.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F(("((u0.s1<1)||(i3.i0.u3.l5<1))")||(G("((i3.i0.u3.s4>=1)&&(i4.u18.l0>=1))"))))))
Formula 0 simplified : G(F!"((i3.i0.u3.s4>=1)&&(i4.u18.l0>=1))" & FG!"((u0.s1<1)||(i3.i0.u3.l5<1))")
Compilation finished in 608 ms.
Running link step : cd /tmp/ltsmin15414371636819091360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15414371636819091360;'/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' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin15414371636819091360;'/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' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15414371636819091360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp2==true)||[](<>((LTLAPp3==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: LTL layer: formula: X(<>(((LTLAPp2==true)||[](<>((LTLAPp3==true))))))
pins2lts-mc-linux64( 5/ 8), 0.012: "X(<>(((LTLAPp2==true)||[](<>((LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.096: DFS-FIFO for weak LTL, using special progress label 283
pins2lts-mc-linux64( 0/ 8), 0.096: There are 284 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.096: State length is 135, there are 282 groups
pins2lts-mc-linux64( 0/ 8), 0.096: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.096: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.096: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.096: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.122: ~1 levels ~960 states ~1928 transitions
pins2lts-mc-linux64( 0/ 8), 0.135: ~1 levels ~1920 states ~3824 transitions
pins2lts-mc-linux64( 0/ 8), 0.171: ~1 levels ~3840 states ~9096 transitions
pins2lts-mc-linux64( 2/ 8), 0.208: ~1 levels ~7680 states ~16224 transitions
pins2lts-mc-linux64( 7/ 8), 0.283: ~6 levels ~15360 states ~35680 transitions
pins2lts-mc-linux64( 7/ 8), 0.418: ~6 levels ~30720 states ~71424 transitions
pins2lts-mc-linux64( 5/ 8), 0.633: ~3 levels ~61440 states ~153376 transitions
pins2lts-mc-linux64( 5/ 8), 1.110: ~3 levels ~122880 states ~285728 transitions
pins2lts-mc-linux64( 5/ 8), 2.025: ~8 levels ~245760 states ~618296 transitions
pins2lts-mc-linux64( 5/ 8), 3.635: ~8 levels ~491520 states ~1223752 transitions
pins2lts-mc-linux64( 6/ 8), 6.090: ~7 levels ~983040 states ~2354104 transitions
pins2lts-mc-linux64( 7/ 8), 10.231: ~7 levels ~1966080 states ~4828688 transitions
pins2lts-mc-linux64( 6/ 8), 18.476: ~9 levels ~3932160 states ~9460944 transitions
pins2lts-mc-linux64( 4/ 8), 35.128: ~9 levels ~7864320 states ~19444328 transitions
pins2lts-mc-linux64( 4/ 8), 69.351: ~9 levels ~15728640 states ~39873488 transitions
pins2lts-mc-linux64( 7/ 8), 135.978: ~11 levels ~31457280 states ~77940736 transitions
pins2lts-mc-linux64( 4/ 8), 273.289: ~11 levels ~62914560 states ~157287856 transitions
pins2lts-mc-linux64( 4/ 8), 548.524: ~11 levels ~125829120 states ~316777776 transitions
pins2lts-mc-linux64( 3/ 8), 576.328: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 576.377:
pins2lts-mc-linux64( 0/ 8), 576.377: mean standard work distribution: 1.2% (states) 1.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 576.377:
pins2lts-mc-linux64( 0/ 8), 576.377: Explored 127093790 states 334473730 transitions, fanout: 2.632
pins2lts-mc-linux64( 0/ 8), 576.377: Total exploration time 576.270 sec (576.220 sec minimum, 576.241 sec on average)
pins2lts-mc-linux64( 0/ 8), 576.377: States per second: 220546, Transitions per second: 580411
pins2lts-mc-linux64( 0/ 8), 576.377:
pins2lts-mc-linux64( 0/ 8), 576.377: Progress states detected: 130678027
pins2lts-mc-linux64( 0/ 8), 576.377: Redundant explorations: -5.3074
pins2lts-mc-linux64( 0/ 8), 576.377:
pins2lts-mc-linux64( 0/ 8), 576.377: Queue width: 8B, total height: 16042619, memory: 122.40MB
pins2lts-mc-linux64( 0/ 8), 576.377: Tree memory: 1041.5MB, 8.1 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 576.377: Tree fill ratio (roots/leafs): 99.0%/6.0%
pins2lts-mc-linux64( 0/ 8), 576.377: Stored 338 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 576.377: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 576.377: Est. total memory use: 1163.9MB (~1146.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15414371636819091360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp2==true)||[](<>((LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15414371636819091360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp2==true)||[](<>((LTLAPp3==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 23:19:25] [INFO ] Flatten gal took : 10 ms
[2025-06-05 23:19:25] [INFO ] Time to serialize gal into /tmp/LTLFireability15215150030403546937.gal : 1 ms
[2025-06-05 23:19:25] [INFO ] Time to serialize properties into /tmp/LTLFireability16657389763747608282.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15215150030403546937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16657389763747608282.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((G(F(("((s1<1)||(l5<1))")||(G("((s4>=1)&&(l0>=1))"))))))
Formula 0 simplified : G(F!"((s4>=1)&&(l0>=1))" & FG!"((s1<1)||(l5<1))")

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="SieveSingleMsgMbox-PT-d1m36"
export BK_EXAMINATION="LTLFireability"
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 SieveSingleMsgMbox-PT-d1m36, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r212-tall-174901994300428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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