Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400396.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 FireWire-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 247K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748910264730

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 00:24:27] [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-03 00:24:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 00:24:27] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2025-06-03 00:24:27] [INFO ] Transformed 626 places.
[2025-06-03 00:24:27] [INFO ] Transformed 1031 transitions.
[2025-06-03 00:24:27] [INFO ] Found NUPN structural information;
[2025-06-03 00:24:27] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-20-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 611 transition count 1031
Discarding 138 places :
Symmetric choice reduction at 1 with 138 rule applications. Total rules 153 place count 473 transition count 893
Iterating global reduction 1 with 138 rules applied. Total rules applied 291 place count 473 transition count 893
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 292 place count 473 transition count 892
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 325 place count 440 transition count 845
Iterating global reduction 2 with 33 rules applied. Total rules applied 358 place count 440 transition count 845
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 369 place count 429 transition count 829
Iterating global reduction 2 with 11 rules applied. Total rules applied 380 place count 429 transition count 829
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 383 place count 429 transition count 826
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 385 place count 427 transition count 820
Iterating global reduction 3 with 2 rules applied. Total rules applied 387 place count 427 transition count 820
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 389 place count 425 transition count 816
Iterating global reduction 3 with 2 rules applied. Total rules applied 391 place count 425 transition count 816
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 393 place count 423 transition count 810
Iterating global reduction 3 with 2 rules applied. Total rules applied 395 place count 423 transition count 810
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 397 place count 421 transition count 806
Iterating global reduction 3 with 2 rules applied. Total rules applied 399 place count 421 transition count 806
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 401 place count 419 transition count 800
Iterating global reduction 3 with 2 rules applied. Total rules applied 403 place count 419 transition count 800
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 405 place count 417 transition count 796
Iterating global reduction 3 with 2 rules applied. Total rules applied 407 place count 417 transition count 796
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 409 place count 415 transition count 790
Iterating global reduction 3 with 2 rules applied. Total rules applied 411 place count 415 transition count 790
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 412 place count 414 transition count 788
Iterating global reduction 3 with 1 rules applied. Total rules applied 413 place count 414 transition count 788
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 414 place count 413 transition count 785
Iterating global reduction 3 with 1 rules applied. Total rules applied 415 place count 413 transition count 785
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 416 place count 412 transition count 783
Iterating global reduction 3 with 1 rules applied. Total rules applied 417 place count 412 transition count 783
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 418 place count 411 transition count 781
Iterating global reduction 3 with 1 rules applied. Total rules applied 419 place count 411 transition count 781
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 420 place count 410 transition count 779
Iterating global reduction 3 with 1 rules applied. Total rules applied 421 place count 410 transition count 779
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 422 place count 409 transition count 778
Iterating global reduction 3 with 1 rules applied. Total rules applied 423 place count 409 transition count 778
Applied a total of 423 rules in 482 ms. Remains 409 /626 variables (removed 217) and now considering 778/1031 (removed 253) transitions.
// Phase 1: matrix 778 rows 409 cols
[2025-06-03 00:24:28] [INFO ] Computed 10 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:24:30] [INFO ] Implicit Places using invariants in 1248 ms returned []
[2025-06-03 00:24:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:24:31] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 2621 ms to find 0 implicit places.
Running 777 sub problems to find dead transitions.
[2025-06-03 00:24:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/1187 variables, and 10 constraints, problems are : Problem set: 0 solved, 777 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/409 constraints, PredecessorRefiner: 777/777 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 777 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:23] [INFO ] Deduced a trap composed of 223 places in 737 ms of which 224 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:23] [INFO ] Deduced a trap composed of 46 places in 580 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:24] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:24] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:25] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:25] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:26] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:27] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:27] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:29] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:29] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:29] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/1187 variables, and 22 constraints, problems are : Problem set: 0 solved, 777 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/409 constraints, PredecessorRefiner: 0/777 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61057ms problems are : Problem set: 0 solved, 777 unsolved
Search for dead transitions found 0 dead transitions in 61098ms
Starting structural reductions in LTL mode, iteration 1 : 409/626 places, 778/1031 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64252 ms. Remains : 409/626 places, 778/1031 transitions.
Support contains 48 out of 409 places after structural reductions.
[2025-06-03 00:25:33] [INFO ] Flatten gal took : 192 ms
[2025-06-03 00:25:33] [INFO ] Flatten gal took : 113 ms
[2025-06-03 00:25:33] [INFO ] Input system was already deterministic with 778 transitions.
RANDOM walk for 40000 steps (33 resets) in 2419 ms. (16 steps per ms) remains 28/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
[2025-06-03 00:25:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 306/345 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 28/373 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 742/1115 variables, 373/383 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1115 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 36/1151 variables, 18/401 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1151 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 24/1175 variables, 9/410 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1175 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 12/1187 variables, 9/419 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1187 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 0/1187 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1187/1187 variables, and 419 constraints, problems are : Problem set: 0 solved, 28 unsolved in 4421 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 306/345 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:39] [INFO ] Deduced a trap composed of 59 places in 383 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:39] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 28/373 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:41] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:41] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 742/1115 variables, 373/387 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1115 variables, 28/415 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:43] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1115/1187 variables, and 416 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 373/409 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9463ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 778/778 transitions.
Graph (trivial) has 248 edges and 409 vertex of which 11 / 409 are part of one of the 3 SCC in 4 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 401 transition count 719
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 50 rules applied. Total rules applied 95 place count 357 transition count 713
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 102 place count 354 transition count 709
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 106 place count 350 transition count 709
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 106 place count 350 transition count 676
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 172 place count 317 transition count 676
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 244 place count 281 transition count 640
Performed 36 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 316 place count 245 transition count 838
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 322 place count 245 transition count 832
Free-agglomeration rule applied 17 times.
Iterating global reduction 4 with 17 rules applied. Total rules applied 339 place count 245 transition count 815
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 356 place count 228 transition count 815
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 359 place count 225 transition count 812
Iterating global reduction 5 with 3 rules applied. Total rules applied 362 place count 225 transition count 812
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 363 place count 225 transition count 811
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 366 place count 225 transition count 811
Applied a total of 366 rules in 264 ms. Remains 225 /409 variables (removed 184) and now considering 811/778 (removed -33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 225/409 places, 811/778 transitions.
RANDOM walk for 40000 steps (1029 resets) in 2265 ms. (17 steps per ms) remains 14/28 properties
BEST_FIRST walk for 40003 steps (212 resets) in 136 ms. (291 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40003 steps (226 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (189 resets) in 173 ms. (229 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (233 resets) in 145 ms. (274 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (54 resets) in 129 ms. (307 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (224 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (216 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (147 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (214 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (209 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (205 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
[2025-06-03 00:25:45] [INFO ] Flow matrix only has 769 transitions (discarded 42 similar events)
// Phase 1: matrix 769 rows 225 cols
[2025-06-03 00:25:45] [INFO ] Computed 10 invariants in 6 ms
[2025-06-03 00:25:45] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 130/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 68/213 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:45] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:45] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:46] [INFO ] Deduced a trap composed of 34 places in 371 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 769/982 variables, 213/226 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/982 variables, 14/240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/982 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 12/994 variables, 12/252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/994 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/994 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 994/994 variables, and 252 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1878 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 225/225 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 130/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 68/213 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:47] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 769/982 variables, 213/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/982 variables, 14/241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/982 variables, 10/251 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:25:48] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/982 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/982 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 12/994 variables, 12/264 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/994 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/994 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 994/994 variables, and 264 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6446 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 225/225 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8348ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 8631 ms.
Support contains 15 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 811/811 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 4 rules applied. Total rules applied 4 place count 225 transition count 807
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 221 transition count 807
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 221 transition count 803
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 217 transition count 803
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 213 transition count 591
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 213 transition count 591
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 213 transition count 589
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 36 place count 208 transition count 584
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 50 place count 201 transition count 606
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 61 place count 201 transition count 595
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 201 transition count 594
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 72 place count 200 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 92 place count 200 transition count 565
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 200 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 200 transition count 564
Applied a total of 94 rules in 124 ms. Remains 200 /225 variables (removed 25) and now considering 564/811 (removed 247) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 200/225 places, 564/811 transitions.
RANDOM walk for 40000 steps (1295 resets) in 1546 ms. (25 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (263 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (252 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (250 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (91 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (255 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (245 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (214 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (252 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (253 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (249 resets) in 153 ms. (259 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 236109 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :1 out of 10
Probabilistic random walk after 236109 steps, saw 75733 distinct states, run finished after 3009 ms. (steps per millisecond=78 ) properties seen :1
[2025-06-03 00:26:06] [INFO ] Flow matrix only has 553 transitions (discarded 11 similar events)
// Phase 1: matrix 553 rows 200 cols
[2025-06-03 00:26:06] [INFO ] Computed 10 invariants in 3 ms
[2025-06-03 00:26:06] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 111/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 64/188 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:06] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:06] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 553/741 variables, 188/200 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 65/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 12/753 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/753 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/753 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/753 variables, and 277 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 111/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 64/188 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:08] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:08] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:08] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 40 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 553/741 variables, 188/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 65/268 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 9/277 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:09] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 30 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/741 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/741 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 12/753 variables, 12/290 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:10] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/753 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/753 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/753 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 753/753 variables, and 291 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4763 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6260ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 11262 ms.
Support contains 13 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 564/564 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 199 transition count 563
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 563
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 561
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 197 transition count 561
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 195 transition count 559
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 195 transition count 559
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 195 transition count 558
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 195 transition count 558
Applied a total of 12 rules in 54 ms. Remains 195 /200 variables (removed 5) and now considering 558/564 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 195/200 places, 558/564 transitions.
RANDOM walk for 40000 steps (1344 resets) in 282 ms. (141 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (285 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (265 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (276 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (101 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (270 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (262 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (268 resets) in 81 ms. (487 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (281 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (274 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
[2025-06-03 00:26:24] [INFO ] Flow matrix only has 547 transitions (discarded 11 similar events)
// Phase 1: matrix 547 rows 195 cols
[2025-06-03 00:26:24] [INFO ] Computed 10 invariants in 3 ms
[2025-06-03 00:26:24] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 109/121 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 62/183 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:24] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:24] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:24] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 547/730 variables, 183/196 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 64/260 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/730 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 12/742 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/742 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 742/742 variables, and 272 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 109/121 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 62/183 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:25] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 547/730 variables, 183/197 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/730 variables, 64/261 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/730 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/730 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 12/742 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:27] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/742 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/742 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/742 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 742/742 variables, and 282 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3208 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4578ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 9610 ms.
Support contains 12 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 558/558 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 195 transition count 557
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 194 transition count 557
Applied a total of 2 rules in 14 ms. Remains 194 /195 variables (removed 1) and now considering 557/558 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 194/195 places, 557/558 transitions.
RANDOM walk for 40000 steps (1394 resets) in 237 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (260 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (267 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (91 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (264 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (265 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (263 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (264 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (268 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 309789 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :1 out of 8
Probabilistic random walk after 309789 steps, saw 100499 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :1
[2025-06-03 00:26:41] [INFO ] Flow matrix only has 546 transitions (discarded 11 similar events)
// Phase 1: matrix 546 rows 194 cols
[2025-06-03 00:26:41] [INFO ] Computed 10 invariants in 2 ms
[2025-06-03 00:26:41] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 109/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 62/182 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 546/728 variables, 182/192 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 64/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 12/740 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/740 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/740 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/740 variables, and 268 constraints, problems are : Problem set: 0 solved, 7 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 194/194 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 109/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 62/182 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:43] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:43] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:43] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:43] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:43] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 34 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 546/728 variables, 182/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 64/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 7/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/728 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 12/740 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/740 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/740 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 740/740 variables, and 280 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3291 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 194/194 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4257ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 3135 ms.
Support contains 11 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 557/557 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 556
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 192 transition count 553
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 192 transition count 553
Applied a total of 4 rules in 16 ms. Remains 192 /194 variables (removed 2) and now considering 553/557 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 192/194 places, 553/557 transitions.
RANDOM walk for 40000 steps (1333 resets) in 225 ms. (176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (276 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (95 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (256 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (273 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (254 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (278 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (263 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 303244 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 7
Probabilistic random walk after 303244 steps, saw 98894 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2025-06-03 00:26:52] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
// Phase 1: matrix 542 rows 192 cols
[2025-06-03 00:26:52] [INFO ] Computed 10 invariants in 2 ms
[2025-06-03 00:26:52] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 107/118 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 62/180 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 542/722 variables, 180/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 64/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/722 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 12/734 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/734 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 266 constraints, problems are : Problem set: 0 solved, 7 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 107/118 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 62/180 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:54] [INFO ] Deduced a trap composed of 28 places in 305 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:54] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 542/722 variables, 180/192 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/722 variables, 64/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/722 variables, 7/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:26:54] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/722 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/722 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 12/734 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/734 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/734 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 734/734 variables, and 276 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3360 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4211ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 4479 ms.
Support contains 11 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 553/553 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 192/192 places, 553/553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 553/553 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 553/553 (removed 0) transitions.
[2025-06-03 00:27:01] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2025-06-03 00:27:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:27:01] [INFO ] Implicit Places using invariants in 285 ms returned []
[2025-06-03 00:27:01] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2025-06-03 00:27:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:27:02] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 00:27:02] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:27:02] [INFO ] Redundant transitions in 50 ms returned []
Running 545 sub problems to find dead transitions.
[2025-06-03 00:27:02] [INFO ] Flow matrix only has 542 transitions (discarded 11 similar events)
[2025-06-03 00:27:02] [INFO ] Invariant cache hit.
[2025-06-03 00:27:02] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:14] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:14] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:15] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:15] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:15] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:16] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:17] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:17] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:17] [INFO ] Deduced a trap composed of 57 places in 312 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:18] [INFO ] Deduced a trap composed of 138 places in 298 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:19] [INFO ] Deduced a trap composed of 20 places in 297 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 542/734 variables, 192/213 constraints. Problems are: Problem set: 0 solved, 545 unsolved
SMT process timed out in 30427ms, After SMT, problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 30429ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31912 ms. Remains : 192/192 places, 553/553 transitions.
FORMULA FireWire-PT-20-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 104 stabilizing places and 152 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||X(F(p1))) U (p2&&F(p3))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Graph (trivial) has 282 edges and 409 vertex of which 11 / 409 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 400 transition count 716
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 58 rules applied. Total rules applied 111 place count 348 transition count 710
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 116 place count 345 transition count 708
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 343 transition count 708
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 118 place count 343 transition count 671
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 192 place count 306 transition count 671
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 201 place count 297 transition count 572
Iterating global reduction 4 with 9 rules applied. Total rules applied 210 place count 297 transition count 572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 212 place count 297 transition count 570
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 212 place count 297 transition count 568
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 216 place count 295 transition count 568
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 221 place count 290 transition count 556
Iterating global reduction 5 with 5 rules applied. Total rules applied 226 place count 290 transition count 556
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 228 place count 288 transition count 551
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 288 transition count 551
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 232 place count 286 transition count 547
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 286 transition count 547
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 236 place count 284 transition count 542
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 284 transition count 542
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 239 place count 283 transition count 540
Iterating global reduction 5 with 1 rules applied. Total rules applied 240 place count 283 transition count 540
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 241 place count 282 transition count 537
Iterating global reduction 5 with 1 rules applied. Total rules applied 242 place count 282 transition count 537
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 243 place count 281 transition count 535
Iterating global reduction 5 with 1 rules applied. Total rules applied 244 place count 281 transition count 535
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 280 transition count 532
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 280 transition count 532
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 247 place count 279 transition count 530
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 279 transition count 530
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 249 place count 278 transition count 528
Iterating global reduction 5 with 1 rules applied. Total rules applied 250 place count 278 transition count 528
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 251 place count 277 transition count 526
Iterating global reduction 5 with 1 rules applied. Total rules applied 252 place count 277 transition count 526
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 318 place count 244 transition count 493
Performed 43 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 404 place count 201 transition count 580
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 406 place count 201 transition count 578
Applied a total of 406 rules in 182 ms. Remains 201 /409 variables (removed 208) and now considering 578/778 (removed 200) transitions.
[2025-06-03 00:27:34] [INFO ] Flow matrix only has 552 transitions (discarded 26 similar events)
// Phase 1: matrix 552 rows 201 cols
[2025-06-03 00:27:34] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:27:34] [INFO ] Implicit Places using invariants in 339 ms returned []
[2025-06-03 00:27:34] [INFO ] Flow matrix only has 552 transitions (discarded 26 similar events)
[2025-06-03 00:27:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:27:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-03 00:27:35] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:27:35] [INFO ] Redundant transitions in 26 ms returned []
Running 569 sub problems to find dead transitions.
[2025-06-03 00:27:35] [INFO ] Flow matrix only has 552 transitions (discarded 26 similar events)
[2025-06-03 00:27:35] [INFO ] Invariant cache hit.
[2025-06-03 00:27:35] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (OVERLAPS) 1/201 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:49] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:49] [INFO ] Deduced a trap composed of 30 places in 331 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:51] [INFO ] Deduced a trap composed of 26 places in 314 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:51] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:52] [INFO ] Deduced a trap composed of 131 places in 305 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/753 variables, and 15 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/201 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/201 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 6 (OVERLAPS) 551/752 variables, 201/216 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 569/797 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 797 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60593ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60596ms
Starting structural reductions in SI_LTL mode, iteration 1 : 201/409 places, 578/778 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62074 ms. Remains : 201/409 places, 578/778 transitions.
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p3)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-00 finished in 62623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))&&G(p0))))'
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Graph (trivial) has 293 edges and 409 vertex of which 11 / 409 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 400 transition count 713
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 61 rules applied. Total rules applied 117 place count 345 transition count 707
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 342 transition count 707
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 120 place count 342 transition count 670
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 194 place count 305 transition count 670
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 201 place count 298 transition count 602
Iterating global reduction 3 with 7 rules applied. Total rules applied 208 place count 298 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 209 place count 298 transition count 601
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 209 place count 298 transition count 599
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 213 place count 296 transition count 599
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 217 place count 292 transition count 589
Iterating global reduction 4 with 4 rules applied. Total rules applied 221 place count 292 transition count 589
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 223 place count 290 transition count 584
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 290 transition count 584
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 227 place count 288 transition count 580
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 288 transition count 580
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 231 place count 286 transition count 575
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 286 transition count 575
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 234 place count 285 transition count 573
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 285 transition count 573
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 311 place count 247 transition count 535
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 312 place count 247 transition count 534
Performed 45 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 402 place count 202 transition count 689
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 408 place count 202 transition count 683
Applied a total of 408 rules in 157 ms. Remains 202 /409 variables (removed 207) and now considering 683/778 (removed 95) transitions.
[2025-06-03 00:28:36] [INFO ] Flow matrix only has 646 transitions (discarded 37 similar events)
// Phase 1: matrix 646 rows 202 cols
[2025-06-03 00:28:36] [INFO ] Computed 10 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:28:36] [INFO ] Implicit Places using invariants in 327 ms returned []
[2025-06-03 00:28:36] [INFO ] Flow matrix only has 646 transitions (discarded 37 similar events)
[2025-06-03 00:28:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:28:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 00:28:37] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:28:37] [INFO ] Redundant transitions in 18 ms returned []
Running 674 sub problems to find dead transitions.
[2025-06-03 00:28:37] [INFO ] Flow matrix only has 646 transitions (discarded 37 similar events)
[2025-06-03 00:28:37] [INFO ] Invariant cache hit.
[2025-06-03 00:28:37] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (OVERLAPS) 1/202 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:53] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:53] [INFO ] Deduced a trap composed of 27 places in 331 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:53] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:55] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:56] [INFO ] Deduced a trap composed of 55 places in 333 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:08] [INFO ] Deduced a trap composed of 125 places in 351 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:08] [INFO ] Deduced a trap composed of 134 places in 328 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/848 variables, and 17 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/202 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 3 (OVERLAPS) 1/202 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:16] [INFO ] Deduced a trap composed of 22 places in 292 ms of which 34 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:21] [INFO ] Deduced a trap composed of 137 places in 330 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:22] [INFO ] Deduced a trap composed of 131 places in 305 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:22] [INFO ] Deduced a trap composed of 140 places in 337 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:22] [INFO ] Deduced a trap composed of 143 places in 337 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:29] [INFO ] Deduced a trap composed of 35 places in 363 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:31] [INFO ] Deduced a trap composed of 35 places in 347 ms of which 32 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:36] [INFO ] Deduced a trap composed of 69 places in 372 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/848 variables, and 25 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/202 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 0/674 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60633ms problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 60637ms
Starting structural reductions in SI_LTL mode, iteration 1 : 202/409 places, 683/778 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62094 ms. Remains : 202/409 places, 683/778 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-01 finished in 62236 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((F(G((p0 U p1))) U (p2 U (p3 U p1))))))'
Support contains 7 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 400 transition count 737
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 400 transition count 737
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 394 transition count 723
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 394 transition count 723
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 392 transition count 718
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 392 transition count 718
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 390 transition count 714
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 390 transition count 714
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 388 transition count 709
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 388 transition count 709
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 386 transition count 706
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 386 transition count 706
Applied a total of 46 rules in 56 ms. Remains 386 /409 variables (removed 23) and now considering 706/778 (removed 72) transitions.
// Phase 1: matrix 706 rows 386 cols
[2025-06-03 00:29:38] [INFO ] Computed 10 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:39] [INFO ] Implicit Places using invariants in 470 ms returned []
[2025-06-03 00:29:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:40] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1540 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2025-06-03 00:29:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (OVERLAPS) 1/386 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 705 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:06] [INFO ] Deduced a trap composed of 216 places in 599 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:07] [INFO ] Deduced a trap composed of 45 places in 467 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:08] [INFO ] Deduced a trap composed of 88 places in 198 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1092 variables, and 13 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/386 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (OVERLAPS) 1/386 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 705 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:24] [INFO ] Deduced a trap composed of 58 places in 414 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:25] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:28] [INFO ] Deduced a trap composed of 63 places in 397 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:28] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:30] [INFO ] Deduced a trap composed of 63 places in 453 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:30] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 705 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:33] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:34] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:35] [INFO ] Deduced a trap composed of 218 places in 480 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:37] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/1092 variables, and 23 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/386 constraints, PredecessorRefiner: 0/705 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 386/409 places, 706/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61889 ms. Remains : 386/409 places, 706/778 transitions.
Stuttering acceptance computed with spot in 486 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 583 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 2 ms.
FORMULA FireWire-PT-20-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-20-LTLFireability-03 finished in 63015 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(p0))'
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Graph (trivial) has 295 edges and 409 vertex of which 11 / 409 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 400 transition count 712
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 62 rules applied. Total rules applied 119 place count 344 transition count 706
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 122 place count 341 transition count 706
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 122 place count 341 transition count 670
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 194 place count 305 transition count 670
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 202 place count 297 transition count 572
Iterating global reduction 3 with 8 rules applied. Total rules applied 210 place count 297 transition count 572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 212 place count 297 transition count 570
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 212 place count 297 transition count 568
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 216 place count 295 transition count 568
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 220 place count 291 transition count 558
Iterating global reduction 4 with 4 rules applied. Total rules applied 224 place count 291 transition count 558
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 226 place count 289 transition count 553
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 289 transition count 553
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 287 transition count 549
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 287 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 234 place count 285 transition count 544
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 285 transition count 544
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 237 place count 284 transition count 542
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 284 transition count 542
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 239 place count 283 transition count 539
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 283 transition count 539
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 241 place count 282 transition count 537
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 282 transition count 537
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 243 place count 281 transition count 534
Iterating global reduction 4 with 1 rules applied. Total rules applied 244 place count 281 transition count 534
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 245 place count 280 transition count 532
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 280 transition count 532
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 279 transition count 530
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 279 transition count 530
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 249 place count 278 transition count 528
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 278 transition count 528
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 326 place count 240 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 327 place count 240 transition count 489
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 417 place count 195 transition count 587
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 420 place count 195 transition count 584
Applied a total of 420 rules in 205 ms. Remains 195 /409 variables (removed 214) and now considering 584/778 (removed 194) transitions.
[2025-06-03 00:30:41] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
// Phase 1: matrix 555 rows 195 cols
[2025-06-03 00:30:41] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:30:42] [INFO ] Implicit Places using invariants in 292 ms returned []
[2025-06-03 00:30:42] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2025-06-03 00:30:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:30:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-03 00:30:43] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:30:43] [INFO ] Redundant transitions in 12 ms returned []
Running 575 sub problems to find dead transitions.
[2025-06-03 00:30:43] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2025-06-03 00:30:43] [INFO ] Invariant cache hit.
[2025-06-03 00:30:43] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:56] [INFO ] Deduced a trap composed of 26 places in 321 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:57] [INFO ] Deduced a trap composed of 31 places in 322 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:57] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:59] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:59] [INFO ] Deduced a trap composed of 131 places in 237 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:59] [INFO ] Deduced a trap composed of 137 places in 298 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:31:00] [INFO ] Deduced a trap composed of 51 places in 330 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:31:08] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/750 variables, and 18 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/195 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (OVERLAPS) 554/749 variables, 195/213 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 575/800 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/750 variables, and 800 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 575 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Starting structural reductions in SI_LTL mode, iteration 1 : 195/409 places, 584/778 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61884 ms. Remains : 195/409 places, 584/778 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-04 finished in 61947 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((p1||X(X(X(p2)))))))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 400 transition count 680
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 400 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 400 transition count 679
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 396 transition count 671
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 396 transition count 671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 395 transition count 668
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 395 transition count 668
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 394 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 394 transition count 666
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 393 transition count 663
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 393 transition count 663
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 392 transition count 661
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 392 transition count 661
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 391 transition count 658
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 391 transition count 658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 390 transition count 656
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 390 transition count 656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 389 transition count 653
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 389 transition count 653
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 388 transition count 651
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 388 transition count 651
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 387 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 387 transition count 649
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 386 transition count 647
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 386 transition count 647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 385 transition count 646
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 385 transition count 646
Applied a total of 49 rules in 61 ms. Remains 385 /409 variables (removed 24) and now considering 646/778 (removed 132) transitions.
// Phase 1: matrix 646 rows 385 cols
[2025-06-03 00:31:43] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:31:44] [INFO ] Implicit Places using invariants in 302 ms returned []
[2025-06-03 00:31:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:31:45] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
Running 645 sub problems to find dead transitions.
[2025-06-03 00:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:08] [INFO ] Deduced a trap composed of 216 places in 582 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:08] [INFO ] Deduced a trap composed of 43 places in 308 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:08] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:09] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:10] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:10] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:11] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:11] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:12] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:13] [INFO ] Deduced a trap composed of 56 places in 288 ms of which 43 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/1031 variables, and 20 constraints, problems are : Problem set: 0 solved, 645 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/385 constraints, PredecessorRefiner: 645/645 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 645 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:23] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/1031 variables, and 21 constraints, problems are : Problem set: 0 solved, 645 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/385 constraints, PredecessorRefiner: 0/645 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 645 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Starting structural reductions in LTL mode, iteration 1 : 385/409 places, 646/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61666 ms. Remains : 385/409 places, 646/778 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-05
Product exploration explored 100000 steps with 16660 reset in 327 ms.
Product exploration explored 100000 steps with 16653 reset in 382 ms.
Computed a total of 90 stabilizing places and 120 stable transitions
Computed a total of 90 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (27 resets) in 455 ms. (87 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (31 resets) in 376 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (24 resets) in 253 ms. (157 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (40 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (25 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (27 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 484204 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 5
Probabilistic random walk after 484204 steps, saw 83372 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2025-06-03 00:32:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 221/349 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 610/959 variables, 349/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 36/995 variables, 18/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/995 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 24/1019 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/1031 variables, 9/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1031 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1031 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1031/1031 variables, and 395 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 221/349 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:51] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 610/959 variables, 349/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/959 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/959 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 36/995 variables, 18/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/995 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 24/1019 variables, 9/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1019 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 12/1031 variables, 9/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1031 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1031 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1031/1031 variables, and 401 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3360 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4402ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 2 properties in 3287 ms.
Support contains 3 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 646/646 transitions.
Graph (trivial) has 282 edges and 385 vertex of which 11 / 385 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 377 transition count 578
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 324 transition count 571
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 321 transition count 571
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 117 place count 321 transition count 531
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 197 place count 281 transition count 531
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 267 place count 246 transition count 496
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 357 place count 201 transition count 595
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 360 place count 201 transition count 592
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 380 place count 201 transition count 572
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 409 place count 181 transition count 563
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 175 transition count 557
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 175 transition count 557
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 430 place count 175 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 457 place count 175 transition count 521
Applied a total of 457 rules in 63 ms. Remains 175 /385 variables (removed 210) and now considering 521/646 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 175/385 places, 521/646 transitions.
RANDOM walk for 40000 steps (1338 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (94 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (94 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (280 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 389164 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 3
Probabilistic random walk after 389164 steps, saw 115307 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2025-06-03 00:33:01] [INFO ] Flow matrix only has 510 transitions (discarded 11 similar events)
// Phase 1: matrix 510 rows 175 cols
[2025-06-03 00:33:01] [INFO ] Computed 10 invariants in 3 ms
[2025-06-03 00:33:01] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 101/163 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 510/673 variables, 163/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 96/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/685 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/685 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 685/685 variables, and 281 constraints, problems are : Problem set: 0 solved, 3 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 96/96 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 101/163 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:33:02] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 510/673 variables, 163/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 96/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/673 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/685 variables, 12/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/685 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/685 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 685/685 variables, and 285 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1777ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 822 ms.
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 521/521 transitions.
Applied a total of 0 rules in 14 ms. Remains 175 /175 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 175/175 places, 521/521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 521/521 transitions.
Applied a total of 0 rules in 7 ms. Remains 175 /175 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2025-06-03 00:33:04] [INFO ] Flow matrix only has 510 transitions (discarded 11 similar events)
[2025-06-03 00:33:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:33:04] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-03 00:33:04] [INFO ] Flow matrix only has 510 transitions (discarded 11 similar events)
[2025-06-03 00:33:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:33:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 00:33:05] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:33:05] [INFO ] Redundant transitions in 6 ms returned []
Running 513 sub problems to find dead transitions.
[2025-06-03 00:33:05] [INFO ] Flow matrix only has 510 transitions (discarded 11 similar events)
[2025-06-03 00:33:05] [INFO ] Invariant cache hit.
[2025-06-03 00:33:05] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:33:15] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:33:15] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:33:16] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:33:16] [INFO ] Deduced a trap composed of 50 places in 298 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:33:17] [INFO ] Deduced a trap composed of 59 places in 290 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:33:17] [INFO ] Deduced a trap composed of 95 places in 296 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:33:18] [INFO ] Deduced a trap composed of 95 places in 285 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:33:20] [INFO ] Deduced a trap composed of 124 places in 255 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 4 (OVERLAPS) 510/685 variables, 175/193 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/685 variables, 96/289 constraints. Problems are: Problem set: 0 solved, 513 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 685/685 variables, and 289 constraints, problems are : Problem set: 0 solved, 513 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 513/513 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 513 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 4 (OVERLAPS) 510/685 variables, 175/193 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/685 variables, 96/289 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/685 variables, 513/802 constraints. Problems are: Problem set: 0 solved, 513 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 685/685 variables, and 802 constraints, problems are : Problem set: 0 solved, 513 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 513/513 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61449 ms. Remains : 175/175 places, 521/521 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 116 edges and 175 vertex of which 29 / 175 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 147 transition count 343
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 147 transition count 343
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 147 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 146 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 146 transition count 300
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 146 transition count 294
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 140 transition count 291
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 140 transition count 288
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 137 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 136 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 136 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 135 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 134 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 134 transition count 249
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 134 transition count 246
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 131 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 131 transition count 240
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 131 transition count 237
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 128 transition count 237
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 128 transition count 237
Applied a total of 103 rules in 39 ms. Remains 128 /175 variables (removed 47) and now considering 237/521 (removed 284) transitions.
Running SMT prover for 3 properties.
[2025-06-03 00:34:05] [INFO ] Flow matrix only has 233 transitions (discarded 4 similar events)
// Phase 1: matrix 233 rows 128 cols
[2025-06-03 00:34:05] [INFO ] Computed 10 invariants in 13 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 00:34:05] [INFO ] After 74ms 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-03 00:34:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-03 00:34:05] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2025-06-03 00:34:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 00:34:06] [INFO ] After 61ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2025-06-03 00:34:06] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-03 00:34:06] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 664 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 646/646 transitions.
Applied a total of 0 rules in 6 ms. Remains 385 /385 variables (removed 0) and now considering 646/646 (removed 0) transitions.
// Phase 1: matrix 646 rows 385 cols
[2025-06-03 00:34:07] [INFO ] Computed 10 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:34:07] [INFO ] Implicit Places using invariants in 443 ms returned []
[2025-06-03 00:34:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:34:08] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
Running 645 sub problems to find dead transitions.
[2025-06-03 00:34:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:32] [INFO ] Deduced a trap composed of 216 places in 599 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:32] [INFO ] Deduced a trap composed of 43 places in 304 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:32] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:33] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:34] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:35] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:36] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:36] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:36] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:38] [INFO ] Deduced a trap composed of 56 places in 408 ms of which 67 ms to minimize.
SMT process timed out in 30378ms, After SMT, problems are : Problem set: 0 solved, 645 unsolved
Search for dead transitions found 0 dead transitions in 30380ms
Finished structural reductions in LTL mode , in 1 iterations and 31904 ms. Remains : 385/385 places, 646/646 transitions.
Computed a total of 90 stabilizing places and 120 stable transitions
Computed a total of 90 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (26 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (48 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (25 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (50 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (27 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (24 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 466181 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 5
Probabilistic random walk after 466181 steps, saw 81095 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2025-06-03 00:34:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 221/349 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 610/959 variables, 349/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 36/995 variables, 18/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/995 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 24/1019 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/1031 variables, 9/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1031 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1031 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1031/1031 variables, and 395 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 221/349 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:44] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 610/959 variables, 349/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/959 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/959 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 36/995 variables, 18/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/995 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 24/1019 variables, 9/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1019 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 12/1031 variables, 9/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1031 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1031 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1031/1031 variables, and 401 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3401 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4871ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 2 properties in 3511 ms.
Support contains 3 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 646/646 transitions.
Graph (trivial) has 282 edges and 385 vertex of which 11 / 385 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 377 transition count 578
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 324 transition count 571
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 321 transition count 571
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 117 place count 321 transition count 531
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 197 place count 281 transition count 531
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 267 place count 246 transition count 496
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 357 place count 201 transition count 595
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 360 place count 201 transition count 592
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 380 place count 201 transition count 572
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 409 place count 181 transition count 563
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 175 transition count 557
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 175 transition count 557
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 430 place count 175 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 457 place count 175 transition count 521
Applied a total of 457 rules in 59 ms. Remains 175 /385 variables (removed 210) and now considering 521/646 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 175/385 places, 521/646 transitions.
RANDOM walk for 40000 steps (1358 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (86 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (97 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (263 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 359932 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 3
Probabilistic random walk after 359932 steps, saw 105877 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2025-06-03 00:34:54] [INFO ] Flow matrix only has 510 transitions (discarded 11 similar events)
// Phase 1: matrix 510 rows 175 cols
[2025-06-03 00:34:54] [INFO ] Computed 10 invariants in 3 ms
[2025-06-03 00:34:54] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 101/163 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 510/673 variables, 163/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 96/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/685 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/685 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 685/685 variables, and 281 constraints, problems are : Problem set: 0 solved, 3 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 96/96 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 101/163 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:55] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 510/673 variables, 163/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 96/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/673 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/685 variables, 12/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/685 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/685 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 685/685 variables, and 285 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1098 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1597ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 658 ms.
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 521/521 transitions.
Applied a total of 0 rules in 11 ms. Remains 175 /175 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 175/175 places, 521/521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 521/521 transitions.
Applied a total of 0 rules in 7 ms. Remains 175 /175 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2025-06-03 00:34:56] [INFO ] Flow matrix only has 510 transitions (discarded 11 similar events)
[2025-06-03 00:34:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:34:57] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-03 00:34:57] [INFO ] Flow matrix only has 510 transitions (discarded 11 similar events)
[2025-06-03 00:34:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:34:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 00:34:58] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:34:58] [INFO ] Redundant transitions in 8 ms returned []
Running 513 sub problems to find dead transitions.
[2025-06-03 00:34:58] [INFO ] Flow matrix only has 510 transitions (discarded 11 similar events)
[2025-06-03 00:34:58] [INFO ] Invariant cache hit.
[2025-06-03 00:34:58] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:08] [INFO ] Deduced a trap composed of 18 places in 270 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:09] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:09] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:10] [INFO ] Deduced a trap composed of 50 places in 274 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:10] [INFO ] Deduced a trap composed of 59 places in 292 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:11] [INFO ] Deduced a trap composed of 95 places in 266 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:11] [INFO ] Deduced a trap composed of 95 places in 255 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:13] [INFO ] Deduced a trap composed of 124 places in 250 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 4 (OVERLAPS) 510/685 variables, 175/193 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/685 variables, 96/289 constraints. Problems are: Problem set: 0 solved, 513 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 685/685 variables, and 289 constraints, problems are : Problem set: 0 solved, 513 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 513/513 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 513 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 4 (OVERLAPS) 510/685 variables, 175/193 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/685 variables, 96/289 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/685 variables, 513/802 constraints. Problems are: Problem set: 0 solved, 513 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 685/685 variables, and 802 constraints, problems are : Problem set: 0 solved, 513 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 513/513 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60617ms problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 60618ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62103 ms. Remains : 175/175 places, 521/521 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 116 edges and 175 vertex of which 29 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 147 transition count 343
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 147 transition count 343
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 147 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 146 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 146 transition count 300
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 146 transition count 294
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 140 transition count 291
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 140 transition count 288
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 137 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 136 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 136 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 135 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 134 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 134 transition count 249
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 134 transition count 246
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 131 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 131 transition count 240
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 131 transition count 237
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 128 transition count 237
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 128 transition count 237
Applied a total of 103 rules in 31 ms. Remains 128 /175 variables (removed 47) and now considering 237/521 (removed 284) transitions.
Running SMT prover for 3 properties.
[2025-06-03 00:35:58] [INFO ] Flow matrix only has 233 transitions (discarded 4 similar events)
// Phase 1: matrix 233 rows 128 cols
[2025-06-03 00:35:58] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 00:35:58] [INFO ] After 67ms 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-03 00:35:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-03 00:35:59] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2025-06-03 00:35:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 00:35:59] [INFO ] After 47ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2025-06-03 00:35:59] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-03 00:35:59] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 487 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 180 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 16679 reset in 199 ms.
Product exploration explored 100000 steps with 16646 reset in 378 ms.
Built C files in :
/tmp/ltsmin5038085227332198553
[2025-06-03 00:36:01] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5038085227332198553
Running compilation step : cd /tmp/ltsmin5038085227332198553;'/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 1799 ms.
Running link step : cd /tmp/ltsmin5038085227332198553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin5038085227332198553;'/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/stateBased1566072073151921001.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 646/646 transitions.
Applied a total of 0 rules in 4 ms. Remains 385 /385 variables (removed 0) and now considering 646/646 (removed 0) transitions.
// Phase 1: matrix 646 rows 385 cols
[2025-06-03 00:36:16] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:36:16] [INFO ] Implicit Places using invariants in 297 ms returned []
[2025-06-03 00:36:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:36:17] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
Running 645 sub problems to find dead transitions.
[2025-06-03 00:36:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:36:38] [INFO ] Deduced a trap composed of 216 places in 547 ms of which 164 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:36:38] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:36:38] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:36:40] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:36:41] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:36:41] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:36:42] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:36:43] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:36:43] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:36:45] [INFO ] Deduced a trap composed of 56 places in 406 ms of which 65 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/1031 variables, and 20 constraints, problems are : Problem set: 0 solved, 645 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/385 constraints, PredecessorRefiner: 645/645 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 645 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:36:56] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/1031 variables, and 21 constraints, problems are : Problem set: 0 solved, 645 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/385 constraints, PredecessorRefiner: 0/645 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 645 unsolved
Search for dead transitions found 0 dead transitions in 60301ms
Finished structural reductions in LTL mode , in 1 iterations and 61445 ms. Remains : 385/385 places, 646/646 transitions.
Built C files in :
/tmp/ltsmin6071958216268985225
[2025-06-03 00:37:17] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6071958216268985225
Running compilation step : cd /tmp/ltsmin6071958216268985225;'/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 1781 ms.
Running link step : cd /tmp/ltsmin6071958216268985225;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6071958216268985225;'/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/stateBased14894622713232786440.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 00:37:32] [INFO ] Flatten gal took : 43 ms
[2025-06-03 00:37:32] [INFO ] Flatten gal took : 42 ms
[2025-06-03 00:37:32] [INFO ] Time to serialize gal into /tmp/LTL3767496152267111362.gal : 10 ms
[2025-06-03 00:37:33] [INFO ] Time to serialize properties into /tmp/LTL3808551715256949328.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/LTL3767496152267111362.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11834594544452730706.hoa' '-atoms' '/tmp/LTL3808551715256949328.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...318
Loading property file /tmp/LTL3808551715256949328.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11834594544452730706.hoa
Detected timeout of ITS tools.
[2025-06-03 00:37:48] [INFO ] Flatten gal took : 35 ms
[2025-06-03 00:37:48] [INFO ] Flatten gal took : 32 ms
[2025-06-03 00:37:48] [INFO ] Time to serialize gal into /tmp/LTL17135346936547016875.gal : 6 ms
[2025-06-03 00:37:48] [INFO ] Time to serialize properties into /tmp/LTL573947078658476568.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/LTL17135346936547016875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL573947078658476568.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(("(p155==1)")||(G(("((p25==1)&&(p189==1))")||(X(X(X("((p52==0)||(p144==0))"))))))))))
Formula 0 simplified : XG(!"(p155==1)" & F(!"((p25==1)&&(p189==1))" & XXX!"((p52==0)||(p144==0))"))
Detected timeout of ITS tools.
[2025-06-03 00:38:03] [INFO ] Flatten gal took : 30 ms
[2025-06-03 00:38:03] [INFO ] Applying decomposition
[2025-06-03 00:38:03] [INFO ] Flatten gal took : 29 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/graph3388946751512204106.txt' '-o' '/tmp/graph3388946751512204106.bin' '-w' '/tmp/graph3388946751512204106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3388946751512204106.bin' '-l' '-1' '-v' '-w' '/tmp/graph3388946751512204106.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:38:03] [INFO ] Decomposing Gal with order
[2025-06-03 00:38:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:38:03] [INFO ] Removed a total of 706 redundant transitions.
[2025-06-03 00:38:03] [INFO ] Flatten gal took : 175 ms
[2025-06-03 00:38:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 52 ms.
[2025-06-03 00:38:03] [INFO ] Time to serialize gal into /tmp/LTL8116238187189216831.gal : 21 ms
[2025-06-03 00:38:03] [INFO ] Time to serialize properties into /tmp/LTL521553319421548365.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/LTL8116238187189216831.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL521553319421548365.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...253
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i4.i0.u53.p155==1)")||(G(("((i14.u6.p25==1)&&(i4.i0.u42.p189==1))")||(X(X(X("((i0.i0.u8.p52==0)||(i0.i0.u29.p144==0))"))))))...159
Formula 0 simplified : XG(!"(i4.i0.u53.p155==1)" & F(!"((i14.u6.p25==1)&&(i4.i0.u42.p189==1))" & XXX!"((i0.i0.u8.p52==0)||(i0.i0.u29.p144==0))"))
Detected timeout of ITS tools.
Treatment of property FireWire-PT-20-LTLFireability-05 finished in 395183 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&&X(F(p1)))||(p1&&X(G(p2)))))))'
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 399 transition count 680
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 399 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 399 transition count 679
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 394 transition count 667
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 394 transition count 667
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 393 transition count 665
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 393 transition count 665
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 392 transition count 663
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 392 transition count 663
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 391 transition count 661
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 391 transition count 661
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 390 transition count 660
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 390 transition count 660
Applied a total of 39 rules in 33 ms. Remains 390 /409 variables (removed 19) and now considering 660/778 (removed 118) transitions.
// Phase 1: matrix 660 rows 390 cols
[2025-06-03 00:38:18] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:38:19] [INFO ] Implicit Places using invariants in 328 ms returned []
[2025-06-03 00:38:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:38:19] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2025-06-03 00:38:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:42] [INFO ] Deduced a trap composed of 216 places in 406 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:42] [INFO ] Deduced a trap composed of 43 places in 312 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:43] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:45] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:46] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:47] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:47] [INFO ] Deduced a trap composed of 56 places in 427 ms of which 67 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/1050 variables, and 17 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/390 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:59] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:08] [INFO ] Deduced a trap composed of 61 places in 295 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:08] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:10] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:12] [INFO ] Deduced a trap composed of 221 places in 421 ms of which 77 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/1050 variables, and 22 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/390 constraints, PredecessorRefiner: 0/659 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in LTL mode, iteration 1 : 390/409 places, 660/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61268 ms. Remains : 390/409 places, 660/778 transitions.
Stuttering acceptance computed with spot in 332 ms :[true, (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-06
Product exploration explored 100000 steps with 25000 reset in 209 ms.
Product exploration explored 100000 steps with 25000 reset in 222 ms.
Computed a total of 97 stabilizing places and 138 stable transitions
Computed a total of 97 stabilizing places and 138 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 147 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (26 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (30 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (25 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (25 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (23 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 459359 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 4
Probabilistic random walk after 459359 steps, saw 80074 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2025-06-03 00:39:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 209/354 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 624/978 variables, 354/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 36/1014 variables, 18/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1014 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 24/1038 variables, 9/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1038 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/1050 variables, 9/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1050 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1050 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1050/1050 variables, and 400 constraints, problems are : Problem set: 0 solved, 4 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 209/354 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:25] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 624/978 variables, 354/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:26] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:26] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/978 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/978 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 36/1014 variables, 18/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1014 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 24/1038 variables, 9/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1038 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 12/1050 variables, 9/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1050 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1050 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1050/1050 variables, and 407 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3128 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3901ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1507 ms.
Support contains 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 660/660 transitions.
Graph (trivial) has 279 edges and 390 vertex of which 11 / 390 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 382 transition count 592
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 329 transition count 585
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 326 transition count 585
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 117 place count 326 transition count 544
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 199 place count 285 transition count 544
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 265 place count 252 transition count 511
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 353 place count 208 transition count 612
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 356 place count 208 transition count 609
Free-agglomeration rule applied 21 times.
Iterating global reduction 3 with 21 rules applied. Total rules applied 377 place count 208 transition count 588
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 407 place count 187 transition count 579
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 413 place count 181 transition count 573
Iterating global reduction 4 with 6 rules applied. Total rules applied 419 place count 181 transition count 573
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 428 place count 181 transition count 564
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 455 place count 181 transition count 537
Applied a total of 455 rules in 61 ms. Remains 181 /390 variables (removed 209) and now considering 537/660 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 181/390 places, 537/660 transitions.
RANDOM walk for 40000 steps (1311 resets) in 152 ms. (261 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (263 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (263 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (274 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
[2025-06-03 00:39:30] [INFO ] Flow matrix only has 526 transitions (discarded 11 similar events)
// Phase 1: matrix 526 rows 181 cols
[2025-06-03 00:39:30] [INFO ] Computed 10 invariants in 1 ms
[2025-06-03 00:39:30] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 98/169 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 526/695 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 98/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/707 variables, 12/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/707 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/707 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 289 constraints, problems are : Problem set: 0 solved, 3 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 98/169 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:30] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 526/695 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 98/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/695 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/695 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/707 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/707 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/707 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 293 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1608ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 319 ms.
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 537/537 transitions.
Applied a total of 0 rules in 11 ms. Remains 181 /181 variables (removed 0) and now considering 537/537 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 181/181 places, 537/537 transitions.
RANDOM walk for 40000 steps (1326 resets) in 245 ms. (162 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (265 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (243 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (240 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 453492 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 3
Probabilistic random walk after 453492 steps, saw 117261 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2025-06-03 00:39:35] [INFO ] Flow matrix only has 526 transitions (discarded 11 similar events)
[2025-06-03 00:39:35] [INFO ] Invariant cache hit.
[2025-06-03 00:39:35] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 98/169 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 526/695 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 98/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/707 variables, 12/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/707 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/707 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 289 constraints, problems are : Problem set: 0 solved, 3 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 98/169 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:35] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 526/695 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 98/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/695 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/695 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/707 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/707 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/707 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 293 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1330 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1815ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 229 ms.
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 537/537 transitions.
Applied a total of 0 rules in 11 ms. Remains 181 /181 variables (removed 0) and now considering 537/537 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 181/181 places, 537/537 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 537/537 transitions.
Applied a total of 0 rules in 10 ms. Remains 181 /181 variables (removed 0) and now considering 537/537 (removed 0) transitions.
[2025-06-03 00:39:37] [INFO ] Flow matrix only has 526 transitions (discarded 11 similar events)
[2025-06-03 00:39:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:39:37] [INFO ] Implicit Places using invariants in 339 ms returned []
[2025-06-03 00:39:37] [INFO ] Flow matrix only has 526 transitions (discarded 11 similar events)
[2025-06-03 00:39:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:39:38] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-03 00:39:39] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:39:39] [INFO ] Redundant transitions in 10 ms returned []
Running 529 sub problems to find dead transitions.
[2025-06-03 00:39:39] [INFO ] Flow matrix only has 526 transitions (discarded 11 similar events)
[2025-06-03 00:39:39] [INFO ] Invariant cache hit.
[2025-06-03 00:39:39] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:50] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:52] [INFO ] Deduced a trap composed of 127 places in 256 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (OVERLAPS) 526/707 variables, 181/196 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/707 variables, 98/294 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:08] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 23 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 707/707 variables, and 295 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 529/529 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:16] [INFO ] Deduced a trap composed of 133 places in 251 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 5 (OVERLAPS) 526/707 variables, 181/198 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 98/296 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 529/825 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 707/707 variables, and 825 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 529/529 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60481ms problems are : Problem set: 0 solved, 529 unsolved
Search for dead transitions found 0 dead transitions in 60483ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62210 ms. Remains : 181/181 places, 537/537 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 118 edges and 181 vertex of which 28 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 172 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 154 transition count 362
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 154 transition count 362
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 154 transition count 347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 153 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 1 with 31 rules applied. Total rules applied 55 place count 153 transition count 315
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 153 transition count 309
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 70 place count 147 transition count 306
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 70 place count 147 transition count 303
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 144 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 143 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 143 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 142 transition count 300
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 86 place count 142 transition count 295
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 91 place count 137 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 95 place count 137 transition count 291
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 137 transition count 289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 135 transition count 289
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 105 place count 135 transition count 289
Applied a total of 105 rules in 35 ms. Remains 135 /181 variables (removed 46) and now considering 289/537 (removed 248) transitions.
Running SMT prover for 3 properties.
[2025-06-03 00:40:39] [INFO ] Flow matrix only has 285 transitions (discarded 4 similar events)
// Phase 1: matrix 285 rows 135 cols
[2025-06-03 00:40:39] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 00:40:39] [INFO ] After 62ms 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-03 00:40:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-03 00:40:39] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2025-06-03 00:40:39] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-03 00:40:39] [INFO ] After 47ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2025-06-03 00:40:40] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-03 00:40:40] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 493 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 7 factoid took 201 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 390 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 390 /390 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 390 cols
[2025-06-03 00:40:40] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:40:41] [INFO ] Implicit Places using invariants in 456 ms returned []
[2025-06-03 00:40:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:40:42] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2025-06-03 00:40:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:03] [INFO ] Deduced a trap composed of 216 places in 527 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:03] [INFO ] Deduced a trap composed of 43 places in 293 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:04] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:06] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:07] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:08] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:09] [INFO ] Deduced a trap composed of 56 places in 392 ms of which 67 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/1050 variables, and 17 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/390 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:20] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:27] [INFO ] Deduced a trap composed of 61 places in 412 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:27] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:29] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:31] [INFO ] Deduced a trap composed of 221 places in 439 ms of which 78 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:40] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/1050 variables, and 23 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/390 constraints, PredecessorRefiner: 0/659 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in LTL mode , in 1 iterations and 61576 ms. Remains : 390/390 places, 660/660 transitions.
Computed a total of 97 stabilizing places and 138 stable transitions
Computed a total of 97 stabilizing places and 138 stable transitions
Knowledge obtained : [(AND p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (28 resets) in 117 ms. (338 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (27 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (33 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (17 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (24 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 439969 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 4
Probabilistic random walk after 439969 steps, saw 77293 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2025-06-03 00:41:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 209/354 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 624/978 variables, 354/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 36/1014 variables, 18/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1014 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 24/1038 variables, 9/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1038 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/1050 variables, 9/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1050 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1050 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1050/1050 variables, and 400 constraints, problems are : Problem set: 0 solved, 4 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 209/354 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:47] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 624/978 variables, 354/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:48] [INFO ] Deduced a trap composed of 79 places in 194 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:48] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/978 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/978 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 36/1014 variables, 18/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1014 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 24/1038 variables, 9/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1038 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 12/1050 variables, 9/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1050 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1050 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1050/1050 variables, and 407 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3167 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4150ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1515 ms.
Support contains 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 660/660 transitions.
Graph (trivial) has 279 edges and 390 vertex of which 11 / 390 are part of one of the 3 SCC in 3 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 382 transition count 592
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 329 transition count 585
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 326 transition count 585
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 117 place count 326 transition count 544
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 199 place count 285 transition count 544
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 265 place count 252 transition count 511
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 353 place count 208 transition count 612
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 356 place count 208 transition count 609
Free-agglomeration rule applied 21 times.
Iterating global reduction 3 with 21 rules applied. Total rules applied 377 place count 208 transition count 588
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 407 place count 187 transition count 579
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 413 place count 181 transition count 573
Iterating global reduction 4 with 6 rules applied. Total rules applied 419 place count 181 transition count 573
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 428 place count 181 transition count 564
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 455 place count 181 transition count 537
Applied a total of 455 rules in 47 ms. Remains 181 /390 variables (removed 209) and now considering 537/660 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 181/390 places, 537/660 transitions.
RANDOM walk for 40000 steps (1304 resets) in 194 ms. (205 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (246 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (248 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (259 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
[2025-06-03 00:41:51] [INFO ] Flow matrix only has 526 transitions (discarded 11 similar events)
// Phase 1: matrix 526 rows 181 cols
[2025-06-03 00:41:51] [INFO ] Computed 10 invariants in 2 ms
[2025-06-03 00:41:51] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 98/169 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 526/695 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 98/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/707 variables, 12/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/707 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/707 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 289 constraints, problems are : Problem set: 0 solved, 3 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 98/169 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:52] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 526/695 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 98/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/695 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/695 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/707 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/707 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/707 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 293 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1268 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1732ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 254 ms.
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 537/537 transitions.
Applied a total of 0 rules in 10 ms. Remains 181 /181 variables (removed 0) and now considering 537/537 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 181/181 places, 537/537 transitions.
RANDOM walk for 40000 steps (1282 resets) in 237 ms. (168 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (249 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (262 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (245 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 452451 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 3
Probabilistic random walk after 452451 steps, saw 116837 distinct states, run finished after 3004 ms. (steps per millisecond=150 ) properties seen :0
[2025-06-03 00:41:57] [INFO ] Flow matrix only has 526 transitions (discarded 11 similar events)
[2025-06-03 00:41:57] [INFO ] Invariant cache hit.
[2025-06-03 00:41:57] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 98/169 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 526/695 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 98/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/707 variables, 12/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/707 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/707 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 289 constraints, problems are : Problem set: 0 solved, 3 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 98/169 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:41:57] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 526/695 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 98/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/695 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/695 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/707 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/707 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/707 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 293 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1314 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1704ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 193 ms.
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 537/537 transitions.
Applied a total of 0 rules in 9 ms. Remains 181 /181 variables (removed 0) and now considering 537/537 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 181/181 places, 537/537 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 537/537 transitions.
Applied a total of 0 rules in 9 ms. Remains 181 /181 variables (removed 0) and now considering 537/537 (removed 0) transitions.
[2025-06-03 00:41:58] [INFO ] Flow matrix only has 526 transitions (discarded 11 similar events)
[2025-06-03 00:41:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:41:59] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-03 00:41:59] [INFO ] Flow matrix only has 526 transitions (discarded 11 similar events)
[2025-06-03 00:41:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:41:59] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-03 00:42:00] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:42:00] [INFO ] Redundant transitions in 10 ms returned []
Running 529 sub problems to find dead transitions.
[2025-06-03 00:42:00] [INFO ] Flow matrix only has 526 transitions (discarded 11 similar events)
[2025-06-03 00:42:00] [INFO ] Invariant cache hit.
[2025-06-03 00:42:00] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:08] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:09] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:09] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:09] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:11] [INFO ] Deduced a trap composed of 127 places in 163 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (OVERLAPS) 526/707 variables, 181/196 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/707 variables, 98/294 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:24] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 23 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 707/707 variables, and 295 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 529/529 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:35] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 5 (OVERLAPS) 526/707 variables, 181/198 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 98/296 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 529/825 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 707/707 variables, and 825 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 529/529 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60430ms problems are : Problem set: 0 solved, 529 unsolved
Search for dead transitions found 0 dead transitions in 60432ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61794 ms. Remains : 181/181 places, 537/537 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 118 edges and 181 vertex of which 28 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 172 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 154 transition count 362
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 154 transition count 362
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 154 transition count 347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 153 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 1 with 31 rules applied. Total rules applied 55 place count 153 transition count 315
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 153 transition count 309
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 70 place count 147 transition count 306
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 70 place count 147 transition count 303
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 144 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 143 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 143 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 142 transition count 300
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 86 place count 142 transition count 295
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 91 place count 137 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 95 place count 137 transition count 291
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 137 transition count 289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 135 transition count 289
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 105 place count 135 transition count 289
Applied a total of 105 rules in 40 ms. Remains 135 /181 variables (removed 46) and now considering 289/537 (removed 248) transitions.
Running SMT prover for 3 properties.
[2025-06-03 00:43:00] [INFO ] Flow matrix only has 285 transitions (discarded 4 similar events)
// Phase 1: matrix 285 rows 135 cols
[2025-06-03 00:43:00] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 00:43:00] [INFO ] After 46ms 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-03 00:43:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-03 00:43:01] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2025-06-03 00:43:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-03 00:43:01] [INFO ] After 50ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2025-06-03 00:43:01] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-03 00:43:01] [INFO ] After 379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 473 ms.
Knowledge obtained : [(AND p1 p2)]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Product exploration explored 100000 steps with 25000 reset in 153 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 390/390 places, 660/660 transitions.
Graph (trivial) has 279 edges and 390 vertex of which 11 / 390 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 382 transition count 651
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 382 transition count 647
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 58 place count 382 transition count 681
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 83 place count 382 transition count 681
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 376 transition count 675
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 376 transition count 675
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 143 place count 376 transition count 693
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 159 place count 360 transition count 677
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 175 place count 360 transition count 677
Performed 48 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 223 place count 360 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 226 place count 360 transition count 965
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 233 place count 353 transition count 951
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 240 place count 353 transition count 951
Deduced a syphon composed of 145 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 243 place count 353 transition count 948
Deduced a syphon composed of 145 places in 1 ms
Applied a total of 243 rules in 120 ms. Remains 353 /390 variables (removed 37) and now considering 948/660 (removed -288) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:43:02] [INFO ] Redundant transitions in 208 ms returned []
Running 940 sub problems to find dead transitions.
[2025-06-03 00:43:02] [INFO ] Flow matrix only has 919 transitions (discarded 29 similar events)
// Phase 1: matrix 919 rows 353 cols
[2025-06-03 00:43:02] [INFO ] Computed 10 invariants in 3 ms
[2025-06-03 00:43:02] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 940 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:22] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:23] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:23] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:23] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 7 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:23] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 3 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:23] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:23] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 4 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:23] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 8 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:24] [INFO ] Deduced a trap composed of 20 places in 298 ms of which 25 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:24] [INFO ] Deduced a trap composed of 72 places in 289 ms of which 26 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:24] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 31 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:25] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 7 ms to minimize.
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:26] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:27] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:27] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 20 ms to minimize.
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:27] [INFO ] Deduced a trap composed of 58 places in 278 ms of which 27 ms to minimize.
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD441 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:28] [INFO ] Deduced a trap composed of 22 places in 305 ms of which 29 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 18/28 constraints. Problems are: Problem set: 312 solved, 628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/1272 variables, and 28 constraints, problems are : Problem set: 312 solved, 628 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/353 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 940/940 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 312 solved, 628 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 312 solved, 628 unsolved
At refinement iteration 1 (OVERLAPS) 134/353 variables, 10/10 constraints. Problems are: Problem set: 312 solved, 628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 18/28 constraints. Problems are: Problem set: 312 solved, 628 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/28 constraints. Problems are: Problem set: 312 solved, 628 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD464 is UNSAT
At refinement iteration 4 (OVERLAPS) 918/1271 variables, 353/381 constraints. Problems are: Problem set: 333 solved, 607 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 10/391 constraints. Problems are: Problem set: 333 solved, 607 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1271 variables, 607/998 constraints. Problems are: Problem set: 333 solved, 607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1271/1272 variables, and 998 constraints, problems are : Problem set: 333 solved, 607 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 353/353 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 607/940 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60681ms problems are : Problem set: 333 solved, 607 unsolved
Search for dead transitions found 333 dead transitions in 60684ms
Found 333 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 333 transitions
Dead transitions reduction (with SMT) removed 333 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 353/390 places, 615/660 transitions.
Graph (complete) has 1114 edges and 353 vertex of which 208 are kept as prefixes of interest. Removing 145 places using SCC suffix rule.3 ms
Discarding 145 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 208 /353 variables (removed 145) and now considering 615/615 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 208/390 places, 615/660 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61036 ms. Remains : 208/390 places, 615/660 transitions.
Built C files in :
/tmp/ltsmin10555848895250472880
[2025-06-03 00:44:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10555848895250472880
Running compilation step : cd /tmp/ltsmin10555848895250472880;'/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 1658 ms.
Running link step : cd /tmp/ltsmin10555848895250472880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10555848895250472880;'/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/stateBased15086677349567122915.hoa' '--buchi-type=spotba'
LTSmin run took 256 ms.
FORMULA FireWire-PT-20-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-20-LTLFireability-06 finished in 346606 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((G(p0)&&F((p1&&X((p1 U (p2||G(p1))))))))))'
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 398 transition count 677
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 398 transition count 677
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 398 transition count 676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 392 transition count 662
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 392 transition count 662
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 390 transition count 657
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 390 transition count 657
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 388 transition count 653
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 388 transition count 653
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 386 transition count 648
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 386 transition count 648
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 384 transition count 645
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 384 transition count 645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 383 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 383 transition count 642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 382 transition count 640
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 382 transition count 640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 381 transition count 637
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 381 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 380 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 380 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 379 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 379 transition count 633
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 378 transition count 631
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 378 transition count 631
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 377 transition count 630
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 377 transition count 630
Applied a total of 65 rules in 63 ms. Remains 377 /409 variables (removed 32) and now considering 630/778 (removed 148) transitions.
// Phase 1: matrix 630 rows 377 cols
[2025-06-03 00:44:05] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:44:05] [INFO ] Implicit Places using invariants in 311 ms returned []
[2025-06-03 00:44:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:44:06] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Running 629 sub problems to find dead transitions.
[2025-06-03 00:44:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:22] [INFO ] Deduced a trap composed of 213 places in 341 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:22] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:22] [INFO ] Deduced a trap composed of 216 places in 293 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:22] [INFO ] Deduced a trap composed of 79 places in 266 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:23] [INFO ] Deduced a trap composed of 213 places in 300 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:23] [INFO ] Deduced a trap composed of 224 places in 257 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:24] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:24] [INFO ] Deduced a trap composed of 213 places in 247 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:24] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:25] [INFO ] Deduced a trap composed of 77 places in 284 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:25] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:26] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:27] [INFO ] Deduced a trap composed of 213 places in 332 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:28] [INFO ] Deduced a trap composed of 217 places in 284 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:29] [INFO ] Deduced a trap composed of 216 places in 443 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:29] [INFO ] Deduced a trap composed of 214 places in 245 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:29] [INFO ] Deduced a trap composed of 214 places in 474 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:30] [INFO ] Deduced a trap composed of 104 places in 423 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:31] [INFO ] Deduced a trap composed of 78 places in 387 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:31] [INFO ] Deduced a trap composed of 215 places in 424 ms of which 109 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:32] [INFO ] Deduced a trap composed of 220 places in 253 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:34] [INFO ] Deduced a trap composed of 220 places in 261 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:35] [INFO ] Deduced a trap composed of 220 places in 411 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:36] [INFO ] Deduced a trap composed of 79 places in 337 ms of which 50 ms to minimize.
SMT process timed out in 30144ms, After SMT, problems are : Problem set: 0 solved, 629 unsolved
Search for dead transitions found 0 dead transitions in 30145ms
Starting structural reductions in LTL mode, iteration 1 : 377/409 places, 630/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31297 ms. Remains : 377/409 places, 630/778 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-07 finished in 31600 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(G(p0))))'
Support contains 1 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 398 transition count 677
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 398 transition count 677
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 398 transition count 676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 392 transition count 662
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 392 transition count 662
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 390 transition count 657
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 390 transition count 657
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 388 transition count 653
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 388 transition count 653
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 386 transition count 648
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 386 transition count 648
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 384 transition count 645
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 384 transition count 645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 383 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 383 transition count 642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 382 transition count 640
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 382 transition count 640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 381 transition count 637
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 381 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 380 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 380 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 379 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 379 transition count 633
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 378 transition count 631
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 378 transition count 631
Applied a total of 63 rules in 55 ms. Remains 378 /409 variables (removed 31) and now considering 631/778 (removed 147) transitions.
// Phase 1: matrix 631 rows 378 cols
[2025-06-03 00:44:37] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:44:37] [INFO ] Implicit Places using invariants in 364 ms returned []
[2025-06-03 00:44:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:44:38] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
Running 630 sub problems to find dead transitions.
[2025-06-03 00:44:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:57] [INFO ] Deduced a trap composed of 214 places in 336 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:57] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:57] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:58] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:58] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:44:59] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:00] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:01] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:01] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:03] [INFO ] Deduced a trap composed of 56 places in 400 ms of which 63 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1009 variables, and 20 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:17] [INFO ] Deduced a trap composed of 216 places in 314 ms of which 64 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:29] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:30] [INFO ] Deduced a trap composed of 214 places in 429 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:31] [INFO ] Deduced a trap composed of 214 places in 444 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:32] [INFO ] Deduced a trap composed of 215 places in 489 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:32] [INFO ] Deduced a trap composed of 78 places in 416 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:33] [INFO ] Deduced a trap composed of 216 places in 444 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:33] [INFO ] Deduced a trap composed of 79 places in 436 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:34] [INFO ] Deduced a trap composed of 216 places in 439 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:34] [INFO ] Deduced a trap composed of 104 places in 425 ms of which 55 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1009 variables, and 30 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 0/630 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 630 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Starting structural reductions in LTL mode, iteration 1 : 378/409 places, 631/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61482 ms. Remains : 378/409 places, 631/778 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-09
Product exploration explored 100000 steps with 3 reset in 269 ms.
Product exploration explored 100000 steps with 0 reset in 313 ms.
Computed a total of 85 stabilizing places and 109 stable transitions
Computed a total of 85 stabilizing places and 109 stable transitions
Detected a total of 85/378 stabilizing places and 109/631 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (30 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (18 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 895903 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :0 out of 1
Probabilistic random walk after 895903 steps, saw 149088 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
[2025-06-03 00:45:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 257/342 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 595/937 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/973 variables, 18/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/997 variables, 9/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/997 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/1009 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1009 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1009 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 388 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 257/342 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 595/937 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/937 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 36/973 variables, 18/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/973 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/997 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/1009 variables, 9/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1009 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1009 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 631/631 transitions.
Graph (trivial) has 282 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 563
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 317 transition count 556
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 314 transition count 556
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 117 place count 314 transition count 517
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 195 place count 275 transition count 517
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 265 place count 240 transition count 482
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 355 place count 195 transition count 581
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 358 place count 195 transition count 578
Free-agglomeration rule applied 21 times.
Iterating global reduction 3 with 21 rules applied. Total rules applied 379 place count 195 transition count 557
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 409 place count 174 transition count 548
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 168 transition count 542
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 168 transition count 542
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 430 place count 168 transition count 533
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 457 place count 168 transition count 506
Applied a total of 457 rules in 124 ms. Remains 168 /378 variables (removed 210) and now considering 506/631 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 168/378 places, 506/631 transitions.
RANDOM walk for 40000 steps (1337 resets) in 298 ms. (133 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (259 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 582089 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 1
Probabilistic random walk after 582089 steps, saw 186377 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
[2025-06-03 00:45:47] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
// Phase 1: matrix 495 rows 168 cols
[2025-06-03 00:45:47] [INFO ] Computed 10 invariants in 2 ms
[2025-06-03 00:45:47] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 495/651 variables, 156/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 94/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/663 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/663 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:47] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 495/651 variables, 156/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 94/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:48] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 21 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/663 variables, 12/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/663 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 663/663 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 791 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1033ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 506/506 transitions.
Applied a total of 0 rules in 10 ms. Remains 168 /168 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 168/168 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 506/506 transitions.
Applied a total of 0 rules in 8 ms. Remains 168 /168 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-03 00:45:48] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-06-03 00:45:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:45:48] [INFO ] Implicit Places using invariants in 260 ms returned []
[2025-06-03 00:45:48] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-06-03 00:45:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:45:48] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-03 00:45:49] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1338 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:45:49] [INFO ] Redundant transitions in 158 ms returned []
Running 498 sub problems to find dead transitions.
[2025-06-03 00:45:49] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-06-03 00:45:49] [INFO ] Invariant cache hit.
[2025-06-03 00:45:49] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:59] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:59] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:59] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:00] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:00] [INFO ] Deduced a trap composed of 56 places in 267 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:01] [INFO ] Deduced a trap composed of 92 places in 246 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:01] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:01] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:03] [INFO ] Deduced a trap composed of 122 places in 229 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 495/663 variables, 168/187 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 94/281 constraints. Problems are: Problem set: 0 solved, 498 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 Real declared 663/663 variables, and 281 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 495/663 variables, 168/187 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 94/281 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 498/779 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/663 variables, and 779 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61877 ms. Remains : 168/168 places, 506/506 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 116 edges and 168 vertex of which 29 / 168 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 140 transition count 328
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 140 transition count 328
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 140 transition count 313
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 139 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 139 transition count 285
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 139 transition count 279
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 133 transition count 276
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 133 transition count 273
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 130 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 129 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 129 transition count 271
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 128 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 127 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 127 transition count 237
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 127 transition count 234
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 124 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 124 transition count 228
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 124 transition count 225
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 121 transition count 225
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 121 transition count 225
Applied a total of 103 rules in 83 ms. Remains 121 /168 variables (removed 47) and now considering 225/506 (removed 281) transitions.
Running SMT prover for 1 properties.
[2025-06-03 00:46:50] [INFO ] Flow matrix only has 221 transitions (discarded 4 similar events)
// Phase 1: matrix 221 rows 121 cols
[2025-06-03 00:46:50] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 00:46:50] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 00:46:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-03 00:46:50] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-03 00:46:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 00:46:50] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:50] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 17 ms to minimize.
[2025-06-03 00:46:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
TRAPS : Iteration 1
[2025-06-03 00:46:50] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 00:46:50] [INFO ] After 345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 498 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 631/631 transitions.
Applied a total of 0 rules in 4 ms. Remains 378 /378 variables (removed 0) and now considering 631/631 (removed 0) transitions.
// Phase 1: matrix 631 rows 378 cols
[2025-06-03 00:46:51] [INFO ] Computed 10 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:46:51] [INFO ] Implicit Places using invariants in 449 ms returned []
[2025-06-03 00:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:46:52] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
Running 630 sub problems to find dead transitions.
[2025-06-03 00:46:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:14] [INFO ] Deduced a trap composed of 214 places in 588 ms of which 223 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:14] [INFO ] Deduced a trap composed of 43 places in 450 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:15] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:15] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:15] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:17] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:17] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:19] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:19] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:21] [INFO ] Deduced a trap composed of 56 places in 420 ms of which 64 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1009 variables, and 20 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:30] [INFO ] Deduced a trap composed of 216 places in 300 ms of which 105 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:42] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:43] [INFO ] Deduced a trap composed of 214 places in 441 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:44] [INFO ] Deduced a trap composed of 214 places in 302 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:45] [INFO ] Deduced a trap composed of 215 places in 483 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:45] [INFO ] Deduced a trap composed of 78 places in 272 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:46] [INFO ] Deduced a trap composed of 216 places in 291 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:46] [INFO ] Deduced a trap composed of 79 places in 451 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:47] [INFO ] Deduced a trap composed of 216 places in 461 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:47] [INFO ] Deduced a trap composed of 104 places in 388 ms of which 56 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1009 variables, and 30 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 0/630 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 630 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Finished structural reductions in LTL mode , in 1 iterations and 61438 ms. Remains : 378/378 places, 631/631 transitions.
Computed a total of 85 stabilizing places and 109 stable transitions
Computed a total of 85 stabilizing places and 109 stable transitions
Detected a total of 85/378 stabilizing places and 109/631 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (33 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (19 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 862375 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :0 out of 1
Probabilistic random walk after 862375 steps, saw 143586 distinct states, run finished after 3003 ms. (steps per millisecond=287 ) properties seen :0
[2025-06-03 00:47:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 257/342 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 595/937 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/973 variables, 18/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/997 variables, 9/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/997 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/1009 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1009 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1009 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 388 constraints, problems are : Problem set: 0 solved, 1 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 257/342 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 595/937 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/937 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 36/973 variables, 18/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/973 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/997 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/1009 variables, 9/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1009 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1009 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 631/631 transitions.
Graph (trivial) has 282 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 563
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 317 transition count 556
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 314 transition count 556
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 117 place count 314 transition count 517
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 195 place count 275 transition count 517
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 265 place count 240 transition count 482
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 355 place count 195 transition count 581
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 358 place count 195 transition count 578
Free-agglomeration rule applied 21 times.
Iterating global reduction 3 with 21 rules applied. Total rules applied 379 place count 195 transition count 557
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 409 place count 174 transition count 548
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 168 transition count 542
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 168 transition count 542
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 430 place count 168 transition count 533
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 457 place count 168 transition count 506
Applied a total of 457 rules in 78 ms. Remains 168 /378 variables (removed 210) and now considering 506/631 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 168/378 places, 506/631 transitions.
RANDOM walk for 40000 steps (1345 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (263 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 527473 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 527473 steps, saw 167605 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2025-06-03 00:48:00] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
// Phase 1: matrix 495 rows 168 cols
[2025-06-03 00:48:00] [INFO ] Computed 10 invariants in 1 ms
[2025-06-03 00:48:00] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 495/651 variables, 156/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 94/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/663 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/663 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:00] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 495/651 variables, 156/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 94/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:01] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/663 variables, 12/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/663 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 663/663 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1173ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 506/506 transitions.
Applied a total of 0 rules in 12 ms. Remains 168 /168 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 168/168 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 506/506 transitions.
Applied a total of 0 rules in 11 ms. Remains 168 /168 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-06-03 00:48:01] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-06-03 00:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:48:01] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-06-03 00:48:01] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-06-03 00:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:48:02] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-03 00:48:02] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:48:03] [INFO ] Redundant transitions in 9 ms returned []
Running 498 sub problems to find dead transitions.
[2025-06-03 00:48:03] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-06-03 00:48:03] [INFO ] Invariant cache hit.
[2025-06-03 00:48:03] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:12] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:12] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:12] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:13] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:13] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:13] [INFO ] Deduced a trap composed of 92 places in 186 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:14] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:14] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:15] [INFO ] Deduced a trap composed of 122 places in 202 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 495/663 variables, 168/187 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 94/281 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/663 variables, and 281 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 495/663 variables, 168/187 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 94/281 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 498/779 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/663 variables, and 779 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60458ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61937 ms. Remains : 168/168 places, 506/506 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 116 edges and 168 vertex of which 29 / 168 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 140 transition count 328
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 140 transition count 328
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 140 transition count 313
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 139 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 139 transition count 285
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 139 transition count 279
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 133 transition count 276
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 133 transition count 273
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 130 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 129 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 129 transition count 271
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 128 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 127 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 127 transition count 237
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 127 transition count 234
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 124 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 124 transition count 228
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 124 transition count 225
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 121 transition count 225
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 121 transition count 225
Applied a total of 103 rules in 36 ms. Remains 121 /168 variables (removed 47) and now considering 225/506 (removed 281) transitions.
Running SMT prover for 1 properties.
[2025-06-03 00:49:03] [INFO ] Flow matrix only has 221 transitions (discarded 4 similar events)
// Phase 1: matrix 221 rows 121 cols
[2025-06-03 00:49:03] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 00:49:03] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 00:49:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-03 00:49:03] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-03 00:49:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 00:49:03] [INFO ] After 17ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:03] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 10 ms to minimize.
[2025-06-03 00:49:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
TRAPS : Iteration 1
[2025-06-03 00:49:03] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 00:49:03] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 383 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 132 ms.
Product exploration explored 100000 steps with 1 reset in 433 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 378/378 places, 631/631 transitions.
Graph (trivial) has 282 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 622
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 370 transition count 618
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 58 place count 370 transition count 650
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 81 place count 370 transition count 650
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 364 transition count 644
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 364 transition count 644
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 2 with 50 rules applied. Total rules applied 143 place count 364 transition count 663
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 159 place count 348 transition count 647
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 175 place count 348 transition count 647
Performed 49 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 153 places in 0 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 224 place count 348 transition count 943
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 227 place count 348 transition count 940
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 234 place count 341 transition count 926
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 241 place count 341 transition count 926
Deduced a syphon composed of 146 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 244 place count 341 transition count 923
Deduced a syphon composed of 146 places in 1 ms
Applied a total of 244 rules in 56 ms. Remains 341 /378 variables (removed 37) and now considering 923/631 (removed -292) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:49:05] [INFO ] Redundant transitions in 22 ms returned []
Running 915 sub problems to find dead transitions.
[2025-06-03 00:49:05] [INFO ] Flow matrix only has 894 transitions (discarded 29 similar events)
// Phase 1: matrix 894 rows 341 cols
[2025-06-03 00:49:05] [INFO ] Computed 10 invariants in 3 ms
[2025-06-03 00:49:05] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 915 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:33] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:33] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 11 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:33] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 9 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:34] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 7 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:34] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 11 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:34] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 4 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:34] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:34] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 5 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:34] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:35] [INFO ] Deduced a trap composed of 20 places in 426 ms of which 38 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:35] [INFO ] Deduced a trap composed of 31 places in 438 ms of which 47 ms to minimize.
SMT process timed out in 30647ms, After SMT, problems are : Problem set: 95 solved, 820 unsolved
Search for dead transitions found 95 dead transitions in 30650ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 341/378 places, 828/631 transitions.
Graph (complete) has 1311 edges and 341 vertex of which 283 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 280 transition count 825
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 280 transition count 825
Deduced a syphon composed of 85 places in 1 ms
Applied a total of 7 rules in 23 ms. Remains 280 /341 variables (removed 61) and now considering 825/828 (removed 3) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 280/378 places, 825/631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30760 ms. Remains : 280/378 places, 825/631 transitions.
Built C files in :
/tmp/ltsmin4566245084075227929
[2025-06-03 00:49:35] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4566245084075227929
Running compilation step : cd /tmp/ltsmin4566245084075227929;'/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 1701 ms.
Running link step : cd /tmp/ltsmin4566245084075227929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin4566245084075227929;'/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/stateBased5562778986008801557.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 631/631 transitions.
Applied a total of 0 rules in 5 ms. Remains 378 /378 variables (removed 0) and now considering 631/631 (removed 0) transitions.
// Phase 1: matrix 631 rows 378 cols
[2025-06-03 00:49:51] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:49:51] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-03 00:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:49:52] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
Running 630 sub problems to find dead transitions.
[2025-06-03 00:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:13] [INFO ] Deduced a trap composed of 214 places in 607 ms of which 224 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:14] [INFO ] Deduced a trap composed of 43 places in 413 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:14] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:15] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:15] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:16] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:16] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:18] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:18] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:20] [INFO ] Deduced a trap composed of 56 places in 409 ms of which 65 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1009 variables, and 20 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:31] [INFO ] Deduced a trap composed of 216 places in 250 ms of which 63 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:43] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:44] [INFO ] Deduced a trap composed of 214 places in 450 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:44] [INFO ] Deduced a trap composed of 214 places in 430 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:46] [INFO ] Deduced a trap composed of 215 places in 478 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:46] [INFO ] Deduced a trap composed of 78 places in 416 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:46] [INFO ] Deduced a trap composed of 216 places in 454 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:47] [INFO ] Deduced a trap composed of 79 places in 413 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:47] [INFO ] Deduced a trap composed of 216 places in 396 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:48] [INFO ] Deduced a trap composed of 104 places in 418 ms of which 56 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1009 variables, and 30 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 0/630 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 630 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Finished structural reductions in LTL mode , in 1 iterations and 61407 ms. Remains : 378/378 places, 631/631 transitions.
Built C files in :
/tmp/ltsmin7748913466532892764
[2025-06-03 00:50:52] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7748913466532892764
Running compilation step : cd /tmp/ltsmin7748913466532892764;'/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 1776 ms.
Running link step : cd /tmp/ltsmin7748913466532892764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7748913466532892764;'/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/stateBased11353931097617920463.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 00:51:07] [INFO ] Flatten gal took : 29 ms
[2025-06-03 00:51:07] [INFO ] Flatten gal took : 20 ms
[2025-06-03 00:51:07] [INFO ] Time to serialize gal into /tmp/LTL5094736412471839820.gal : 7 ms
[2025-06-03 00:51:07] [INFO ] Time to serialize properties into /tmp/LTL6527241374457085928.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/LTL5094736412471839820.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17020085572966505852.hoa' '-atoms' '/tmp/LTL6527241374457085928.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...318
Loading property file /tmp/LTL6527241374457085928.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17020085572966505852.hoa
Detected timeout of ITS tools.
[2025-06-03 00:51:22] [INFO ] Flatten gal took : 21 ms
[2025-06-03 00:51:22] [INFO ] Flatten gal took : 20 ms
[2025-06-03 00:51:22] [INFO ] Time to serialize gal into /tmp/LTL1954630047727343517.gal : 5 ms
[2025-06-03 00:51:22] [INFO ] Time to serialize properties into /tmp/LTL4485062327344826013.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/LTL1954630047727343517.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4485062327344826013.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(X(G("(p525==0)")))))
Formula 0 simplified : XXF!"(p525==0)"
Detected timeout of ITS tools.
[2025-06-03 00:51:37] [INFO ] Flatten gal took : 19 ms
[2025-06-03 00:51:37] [INFO ] Applying decomposition
[2025-06-03 00:51:37] [INFO ] Flatten gal took : 21 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/graph800781453991848295.txt' '-o' '/tmp/graph800781453991848295.bin' '-w' '/tmp/graph800781453991848295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph800781453991848295.bin' '-l' '-1' '-v' '-w' '/tmp/graph800781453991848295.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:51:37] [INFO ] Decomposing Gal with order
[2025-06-03 00:51:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:51:38] [INFO ] Removed a total of 679 redundant transitions.
[2025-06-03 00:51:38] [INFO ] Flatten gal took : 78 ms
[2025-06-03 00:51:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 47 ms.
[2025-06-03 00:51:38] [INFO ] Time to serialize gal into /tmp/LTL2215392071347546266.gal : 11 ms
[2025-06-03 00:51:38] [INFO ] Time to serialize properties into /tmp/LTL11197164898172730600.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/LTL2215392071347546266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11197164898172730600.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 : !((X(X(G("(i1.u112.p525==0)")))))
Formula 0 simplified : XXF!"(i1.u112.p525==0)"
Detected timeout of ITS tools.
Treatment of property FireWire-PT-20-LTLFireability-09 finished in 436179 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))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Graph (trivial) has 292 edges and 409 vertex of which 11 / 409 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 400 transition count 714
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 115 place count 346 transition count 708
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 343 transition count 707
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 342 transition count 707
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 120 place count 342 transition count 669
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 196 place count 304 transition count 669
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 203 place count 297 transition count 572
Iterating global reduction 4 with 7 rules applied. Total rules applied 210 place count 297 transition count 572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 212 place count 297 transition count 570
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 212 place count 297 transition count 568
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 216 place count 295 transition count 568
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 219 place count 292 transition count 560
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 292 transition count 560
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 224 place count 290 transition count 555
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 290 transition count 555
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 228 place count 288 transition count 551
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 288 transition count 551
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 232 place count 286 transition count 546
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 286 transition count 546
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 235 place count 285 transition count 544
Iterating global reduction 5 with 1 rules applied. Total rules applied 236 place count 285 transition count 544
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 237 place count 284 transition count 541
Iterating global reduction 5 with 1 rules applied. Total rules applied 238 place count 284 transition count 541
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 239 place count 283 transition count 539
Iterating global reduction 5 with 1 rules applied. Total rules applied 240 place count 283 transition count 539
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 241 place count 282 transition count 536
Iterating global reduction 5 with 1 rules applied. Total rules applied 242 place count 282 transition count 536
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 243 place count 281 transition count 534
Iterating global reduction 5 with 1 rules applied. Total rules applied 244 place count 281 transition count 534
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 280 transition count 532
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 280 transition count 532
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 247 place count 279 transition count 530
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 279 transition count 530
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 324 place count 241 transition count 492
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 325 place count 241 transition count 491
Performed 43 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 411 place count 198 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 414 place count 198 transition count 582
Applied a total of 414 rules in 87 ms. Remains 198 /409 variables (removed 211) and now considering 582/778 (removed 196) transitions.
[2025-06-03 00:51:53] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
// Phase 1: matrix 553 rows 198 cols
[2025-06-03 00:51:53] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:51:53] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-06-03 00:51:53] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
[2025-06-03 00:51:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:51:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-03 00:51:54] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:51:54] [INFO ] Redundant transitions in 11 ms returned []
Running 577 sub problems to find dead transitions.
[2025-06-03 00:51:54] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
[2025-06-03 00:51:54] [INFO ] Invariant cache hit.
[2025-06-03 00:51:54] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:08] [INFO ] Deduced a trap composed of 26 places in 343 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:09] [INFO ] Deduced a trap composed of 30 places in 326 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:11] [INFO ] Deduced a trap composed of 126 places in 309 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:12] [INFO ] Deduced a trap composed of 51 places in 302 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 577 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 Real declared 198/751 variables, and 14 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/198 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (OVERLAPS) 1/198 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (OVERLAPS) 552/750 variables, 198/212 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 577/801 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/751 variables, and 801 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60399ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Starting structural reductions in SI_LTL mode, iteration 1 : 198/409 places, 582/778 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62002 ms. Remains : 198/409 places, 582/778 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-10 finished in 62132 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||F(p1))) U X(p0))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 400 transition count 708
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 400 transition count 708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 400 transition count 707
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 394 transition count 693
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 394 transition count 693
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 392 transition count 688
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 392 transition count 688
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 390 transition count 684
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 390 transition count 684
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 388 transition count 679
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 388 transition count 679
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 386 transition count 676
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 386 transition count 676
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 385 transition count 673
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 385 transition count 673
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 384 transition count 671
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 384 transition count 671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 383 transition count 668
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 383 transition count 668
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 382 transition count 666
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 382 transition count 666
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 381 transition count 664
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 381 transition count 664
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 380 transition count 662
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 380 transition count 662
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 379 transition count 661
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 379 transition count 661
Applied a total of 61 rules in 65 ms. Remains 379 /409 variables (removed 30) and now considering 661/778 (removed 117) transitions.
// Phase 1: matrix 661 rows 379 cols
[2025-06-03 00:52:55] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:52:55] [INFO ] Implicit Places using invariants in 435 ms returned []
[2025-06-03 00:52:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:52:56] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-03 00:52:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:21] [INFO ] Deduced a trap composed of 213 places in 585 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:21] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:21] [INFO ] Deduced a trap composed of 216 places in 317 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:22] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:22] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:23] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:24] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:25] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:25] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:27] [INFO ] Deduced a trap composed of 57 places in 414 ms of which 55 ms to minimize.
SMT process timed out in 30414ms, After SMT, problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 30416ms
Starting structural reductions in LTL mode, iteration 1 : 379/409 places, 661/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31943 ms. Remains : 379/409 places, 661/778 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-11
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-11 finished in 32223 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)&&(p1||G(p2)))))'
Support contains 5 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 398 transition count 677
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 398 transition count 677
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 398 transition count 676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 392 transition count 662
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 392 transition count 662
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 390 transition count 657
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 390 transition count 657
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 388 transition count 653
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 388 transition count 653
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 386 transition count 648
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 386 transition count 648
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 384 transition count 645
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 384 transition count 645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 383 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 383 transition count 642
Applied a total of 53 rules in 63 ms. Remains 383 /409 variables (removed 26) and now considering 642/778 (removed 136) transitions.
// Phase 1: matrix 642 rows 383 cols
[2025-06-03 00:53:27] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:28] [INFO ] Implicit Places using invariants in 474 ms returned []
[2025-06-03 00:53:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:29] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
Running 641 sub problems to find dead transitions.
[2025-06-03 00:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:52] [INFO ] Deduced a trap composed of 216 places in 596 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:53] [INFO ] Deduced a trap composed of 43 places in 415 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:54] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:54] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:54] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:55] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:56] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:57] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:57] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:59] [INFO ] Deduced a trap composed of 56 places in 362 ms of which 52 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1025 variables, and 20 constraints, problems are : Problem set: 0 solved, 641 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/383 constraints, PredecessorRefiner: 641/641 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 641 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:10] [INFO ] Deduced a trap composed of 218 places in 466 ms of which 87 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/1025 variables, and 21 constraints, problems are : Problem set: 0 solved, 641 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/383 constraints, PredecessorRefiner: 0/641 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 641 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in LTL mode, iteration 1 : 383/409 places, 642/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61753 ms. Remains : 383/409 places, 642/778 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-12 finished in 62025 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||X(X(p1))))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 398 transition count 677
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 398 transition count 677
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 398 transition count 676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 392 transition count 662
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 392 transition count 662
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 390 transition count 657
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 390 transition count 657
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 388 transition count 653
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 388 transition count 653
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 386 transition count 648
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 386 transition count 648
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 384 transition count 645
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 384 transition count 645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 383 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 383 transition count 642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 382 transition count 640
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 382 transition count 640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 381 transition count 637
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 381 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 380 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 380 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 379 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 379 transition count 633
Applied a total of 61 rules in 89 ms. Remains 379 /409 variables (removed 30) and now considering 633/778 (removed 145) transitions.
// Phase 1: matrix 633 rows 379 cols
[2025-06-03 00:54:29] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:54:30] [INFO ] Implicit Places using invariants in 450 ms returned []
[2025-06-03 00:54:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:54:31] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
Running 632 sub problems to find dead transitions.
[2025-06-03 00:54:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:54] [INFO ] Deduced a trap composed of 215 places in 576 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:54] [INFO ] Deduced a trap composed of 43 places in 415 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:55] [INFO ] Deduced a trap composed of 216 places in 493 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:55] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:56] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:56] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:57] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:57] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:59] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:59] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:01] [INFO ] Deduced a trap composed of 56 places in 409 ms of which 64 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/1012 variables, and 21 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/379 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (OVERLAPS) 633/1012 variables, 379/400 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 632/1032 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1032 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 379/409 places, 633/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61809 ms. Remains : 379/409 places, 633/778 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-13
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-13 finished in 61942 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 1 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Graph (trivial) has 294 edges and 409 vertex of which 11 / 409 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 400 transition count 713
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 61 rules applied. Total rules applied 117 place count 345 transition count 707
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 342 transition count 707
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 120 place count 342 transition count 670
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 194 place count 305 transition count 670
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 202 place count 297 transition count 572
Iterating global reduction 3 with 8 rules applied. Total rules applied 210 place count 297 transition count 572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 212 place count 297 transition count 570
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 212 place count 297 transition count 568
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 216 place count 295 transition count 568
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 220 place count 291 transition count 558
Iterating global reduction 4 with 4 rules applied. Total rules applied 224 place count 291 transition count 558
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 226 place count 289 transition count 553
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 289 transition count 553
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 287 transition count 549
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 287 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 234 place count 285 transition count 544
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 285 transition count 544
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 237 place count 284 transition count 542
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 284 transition count 542
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 239 place count 283 transition count 539
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 283 transition count 539
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 241 place count 282 transition count 537
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 282 transition count 537
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 243 place count 281 transition count 534
Iterating global reduction 4 with 1 rules applied. Total rules applied 244 place count 281 transition count 534
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 245 place count 280 transition count 532
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 280 transition count 532
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 279 transition count 530
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 279 transition count 530
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 249 place count 278 transition count 528
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 278 transition count 528
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 326 place count 240 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 327 place count 240 transition count 489
Performed 44 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 415 place count 196 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 418 place count 196 transition count 583
Applied a total of 418 rules in 82 ms. Remains 196 /409 variables (removed 213) and now considering 583/778 (removed 195) transitions.
[2025-06-03 00:55:31] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
// Phase 1: matrix 557 rows 196 cols
[2025-06-03 00:55:31] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:55:31] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-03 00:55:31] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2025-06-03 00:55:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:55:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-03 00:55:33] [INFO ] Implicit Places using invariants and state equation in 1159 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:55:33] [INFO ] Redundant transitions in 11 ms returned []
Running 574 sub problems to find dead transitions.
[2025-06-03 00:55:33] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2025-06-03 00:55:33] [INFO ] Invariant cache hit.
[2025-06-03 00:55:33] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:46] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:46] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:46] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:47] [INFO ] Deduced a trap composed of 30 places in 324 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:49] [INFO ] Deduced a trap composed of 126 places in 256 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:49] [INFO ] Deduced a trap composed of 132 places in 302 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:50] [INFO ] Deduced a trap composed of 51 places in 296 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:50] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:59] [INFO ] Deduced a trap composed of 132 places in 294 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:00] [INFO ] Deduced a trap composed of 138 places in 306 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:01] [INFO ] Deduced a trap composed of 34 places in 329 ms of which 39 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/753 variables, and 21 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/196 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (OVERLAPS) 556/752 variables, 196/217 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/229 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 574/803 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 803 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Starting structural reductions in SI_LTL mode, iteration 1 : 196/409 places, 583/778 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61896 ms. Remains : 196/409 places, 583/778 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-14
Product exploration explored 100000 steps with 29 reset in 69 ms.
Product exploration explored 100000 steps with 2 reset in 76 ms.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1519 resets) in 605 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (263 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1013 steps, run visited all 1 properties in 11 ms. (steps per millisecond=92 )
Probabilistic random walk after 1013 steps, saw 423 distinct states, run finished after 21 ms. (steps per millisecond=48 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 583/583 transitions.
Applied a total of 0 rules in 10 ms. Remains 196 /196 variables (removed 0) and now considering 583/583 (removed 0) transitions.
[2025-06-03 00:56:34] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2025-06-03 00:56:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:56:34] [INFO ] Implicit Places using invariants in 283 ms returned []
[2025-06-03 00:56:34] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2025-06-03 00:56:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:56:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-03 00:56:35] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:56:35] [INFO ] Redundant transitions in 12 ms returned []
Running 574 sub problems to find dead transitions.
[2025-06-03 00:56:35] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2025-06-03 00:56:35] [INFO ] Invariant cache hit.
[2025-06-03 00:56:35] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:47] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:48] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:48] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:48] [INFO ] Deduced a trap composed of 30 places in 299 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:50] [INFO ] Deduced a trap composed of 126 places in 311 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:50] [INFO ] Deduced a trap composed of 132 places in 225 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:51] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:51] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:01] [INFO ] Deduced a trap composed of 132 places in 220 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:01] [INFO ] Deduced a trap composed of 138 places in 301 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:02] [INFO ] Deduced a trap composed of 34 places in 330 ms of which 40 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/753 variables, and 21 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/196 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (OVERLAPS) 556/752 variables, 196/217 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/229 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 574/803 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 803 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60529ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61742 ms. Remains : 196/196 places, 583/583 transitions.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 33934 steps (1282 resets) in 274 ms. (123 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 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6 reset in 103 ms.
Product exploration explored 100000 steps with 3 reset in 126 ms.
Built C files in :
/tmp/ltsmin5774961592697035894
[2025-06-03 00:57:36] [INFO ] Computing symmetric may disable matrix : 583 transitions.
[2025-06-03 00:57:36] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:57:36] [INFO ] Computing symmetric may enable matrix : 583 transitions.
[2025-06-03 00:57:36] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:57:36] [INFO ] Computing Do-Not-Accords matrix : 583 transitions.
[2025-06-03 00:57:36] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:57:37] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5774961592697035894
Running compilation step : cd /tmp/ltsmin5774961592697035894;'/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 2645 ms.
Running link step : cd /tmp/ltsmin5774961592697035894;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin5774961592697035894;'/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/stateBased12240432650638347843.hoa' '--buchi-type=spotba'
LTSmin run took 3379 ms.
FORMULA FireWire-PT-20-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-20-LTLFireability-14 finished in 131532 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(G(p1)))))'
Support contains 3 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Graph (trivial) has 294 edges and 409 vertex of which 11 / 409 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 400 transition count 712
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 62 rules applied. Total rules applied 119 place count 344 transition count 706
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 122 place count 341 transition count 706
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 122 place count 341 transition count 669
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 196 place count 304 transition count 669
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 202 place count 298 transition count 574
Iterating global reduction 3 with 6 rules applied. Total rules applied 208 place count 298 transition count 574
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 210 place count 298 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 210 place count 298 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 297 transition count 571
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 215 place count 294 transition count 564
Iterating global reduction 4 with 3 rules applied. Total rules applied 218 place count 294 transition count 564
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 219 place count 293 transition count 561
Iterating global reduction 4 with 1 rules applied. Total rules applied 220 place count 293 transition count 561
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 221 place count 292 transition count 559
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 292 transition count 559
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 223 place count 291 transition count 556
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 291 transition count 556
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 225 place count 290 transition count 554
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 290 transition count 554
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 227 place count 289 transition count 551
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 289 transition count 551
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 229 place count 288 transition count 549
Iterating global reduction 4 with 1 rules applied. Total rules applied 230 place count 288 transition count 549
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 231 place count 287 transition count 546
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 287 transition count 546
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 233 place count 286 transition count 544
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 286 transition count 544
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 235 place count 285 transition count 542
Iterating global reduction 4 with 1 rules applied. Total rules applied 236 place count 285 transition count 542
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 237 place count 284 transition count 540
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 284 transition count 540
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 316 place count 245 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 245 transition count 500
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 407 place count 200 transition count 598
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 410 place count 200 transition count 595
Applied a total of 410 rules in 133 ms. Remains 200 /409 variables (removed 209) and now considering 595/778 (removed 183) transitions.
[2025-06-03 00:57:43] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
// Phase 1: matrix 566 rows 200 cols
[2025-06-03 00:57:43] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:43] [INFO ] Implicit Places using invariants in 343 ms returned []
[2025-06-03 00:57:43] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2025-06-03 00:57:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-03 00:57:44] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:57:44] [INFO ] Redundant transitions in 14 ms returned []
Running 586 sub problems to find dead transitions.
[2025-06-03 00:57:44] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2025-06-03 00:57:44] [INFO ] Invariant cache hit.
[2025-06-03 00:57:44] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:57] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:57] [INFO ] Deduced a trap composed of 26 places in 318 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:58] [INFO ] Deduced a trap composed of 30 places in 329 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:59] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:00] [INFO ] Deduced a trap composed of 128 places in 315 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:00] [INFO ] Deduced a trap composed of 53 places in 305 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:08] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:08] [INFO ] Deduced a trap composed of 26 places in 298 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 200/766 variables, and 18 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/200 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:22] [INFO ] Deduced a trap composed of 134 places in 299 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:28] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:34] [INFO ] Deduced a trap composed of 134 places in 336 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:34] [INFO ] Deduced a trap composed of 140 places in 304 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/766 variables, and 22 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/200 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 0/586 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60559ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 60561ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/409 places, 595/778 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61945 ms. Remains : 200/409 places, 595/778 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-15 finished in 62133 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((p1||X(X(X(p2)))))))))'
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(G(p0))))'
Found a Lengthening insensitive property : FireWire-PT-20-LTLFireability-09
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 409 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 409/409 places, 778/778 transitions.
Graph (trivial) has 295 edges and 409 vertex of which 11 / 409 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 400 transition count 712
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 62 rules applied. Total rules applied 119 place count 344 transition count 706
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 122 place count 341 transition count 706
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 122 place count 341 transition count 670
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 194 place count 305 transition count 670
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 202 place count 297 transition count 572
Iterating global reduction 3 with 8 rules applied. Total rules applied 210 place count 297 transition count 572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 212 place count 297 transition count 570
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 212 place count 297 transition count 568
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 216 place count 295 transition count 568
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 220 place count 291 transition count 558
Iterating global reduction 4 with 4 rules applied. Total rules applied 224 place count 291 transition count 558
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 226 place count 289 transition count 553
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 289 transition count 553
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 287 transition count 549
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 287 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 234 place count 285 transition count 544
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 285 transition count 544
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 237 place count 284 transition count 542
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 284 transition count 542
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 239 place count 283 transition count 539
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 283 transition count 539
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 241 place count 282 transition count 537
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 282 transition count 537
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 243 place count 281 transition count 534
Iterating global reduction 4 with 1 rules applied. Total rules applied 244 place count 281 transition count 534
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 245 place count 280 transition count 532
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 280 transition count 532
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 279 transition count 530
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 279 transition count 530
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 249 place count 278 transition count 528
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 278 transition count 528
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 326 place count 240 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 327 place count 240 transition count 489
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 417 place count 195 transition count 587
Applied a total of 417 rules in 157 ms. Remains 195 /409 variables (removed 214) and now considering 587/778 (removed 191) transitions.
[2025-06-03 00:58:46] [INFO ] Flow matrix only has 558 transitions (discarded 29 similar events)
// Phase 1: matrix 558 rows 195 cols
[2025-06-03 00:58:46] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:58:46] [INFO ] Implicit Places using invariants in 354 ms returned []
[2025-06-03 00:58:46] [INFO ] Flow matrix only has 558 transitions (discarded 29 similar events)
[2025-06-03 00:58:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:58:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-03 00:58:47] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2025-06-03 00:58:47] [INFO ] Flow matrix only has 558 transitions (discarded 29 similar events)
[2025-06-03 00:58:47] [INFO ] Invariant cache hit.
[2025-06-03 00:58:47] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:01] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:01] [INFO ] Deduced a trap composed of 26 places in 304 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:01] [INFO ] Deduced a trap composed of 30 places in 317 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:03] [INFO ] Deduced a trap composed of 124 places in 303 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:04] [INFO ] Deduced a trap composed of 51 places in 301 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:12] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:12] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/753 variables, and 17 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/195 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (OVERLAPS) 557/752 variables, 195/212 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 578/802 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 802 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60474ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Starting structural reductions in LI_LTL mode, iteration 1 : 195/409 places, 587/778 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62012 ms. Remains : 195/409 places, 587/778 transitions.
Running random walk in product with property : FireWire-PT-20-LTLFireability-09
Product exploration explored 100000 steps with 3 reset in 61 ms.
Product exploration explored 100000 steps with 1 reset in 67 ms.
Computed a total of 32 stabilizing places and 57 stable transitions
Computed a total of 32 stabilizing places and 57 stable transitions
Detected a total of 32/195 stabilizing places and 57/587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1519 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (268 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 36122 steps, run visited all 1 properties in 319 ms. (steps per millisecond=113 )
Probabilistic random walk after 36122 steps, saw 13168 distinct states, run finished after 319 ms. (steps per millisecond=113 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 587/587 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 587/587 (removed 0) transitions.
[2025-06-03 00:59:49] [INFO ] Flow matrix only has 558 transitions (discarded 29 similar events)
[2025-06-03 00:59:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:59:49] [INFO ] Implicit Places using invariants in 353 ms returned []
[2025-06-03 00:59:49] [INFO ] Flow matrix only has 558 transitions (discarded 29 similar events)
[2025-06-03 00:59:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:59:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-03 00:59:50] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2025-06-03 00:59:50] [INFO ] Flow matrix only has 558 transitions (discarded 29 similar events)
[2025-06-03 00:59:50] [INFO ] Invariant cache hit.
[2025-06-03 00:59:50] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:00:04] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:00:05] [INFO ] Deduced a trap composed of 26 places in 324 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:00:05] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:00:07] [INFO ] Deduced a trap composed of 124 places in 294 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:00:07] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:00:15] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:00:15] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/753 variables, and 17 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/195 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (OVERLAPS) 557/752 variables, 195/212 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 578/802 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 802 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60490ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Finished structural reductions in LTL mode , in 1 iterations and 62025 ms. Remains : 195/195 places, 587/587 transitions.
Computed a total of 32 stabilizing places and 57 stable transitions
Computed a total of 32 stabilizing places and 57 stable transitions
Detected a total of 32/195 stabilizing places and 57/587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1515 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (260 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 36122 steps, run visited all 1 properties in 287 ms. (steps per millisecond=125 )
Probabilistic random walk after 36122 steps, saw 13168 distinct states, run finished after 287 ms. (steps per millisecond=125 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 9 reset in 75 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 587/587 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 195 transition count 584
Applied a total of 3 rules in 15 ms. Remains 195 /195 variables (removed 0) and now considering 584/587 (removed 3) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:00:52] [INFO ] Redundant transitions in 8 ms returned []
Running 575 sub problems to find dead transitions.
[2025-06-03 01:00:52] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
// Phase 1: matrix 555 rows 195 cols
[2025-06-03 01:00:52] [INFO ] Computed 10 invariants in 12 ms
[2025-06-03 01:00:52] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:05] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:05] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:06] [INFO ] Deduced a trap composed of 30 places in 337 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:08] [INFO ] Deduced a trap composed of 124 places in 309 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:08] [INFO ] Deduced a trap composed of 51 places in 310 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:15] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:21] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:22] [INFO ] Deduced a trap composed of 131 places in 226 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:22] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/750 variables, and 19 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/195 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 575 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (OVERLAPS) 554/749 variables, 195/214 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 12/226 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 575/801 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/750 variables, and 801 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 575 unsolved
Search for dead transitions found 0 dead transitions in 60353ms
Starting structural reductions in SI_LTL mode, iteration 1 : 195/195 places, 584/587 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60396 ms. Remains : 195/195 places, 584/587 transitions.
Built C files in :
/tmp/ltsmin17583775653416236478
[2025-06-03 01:01:53] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17583775653416236478
Running compilation step : cd /tmp/ltsmin17583775653416236478;'/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 1632 ms.
Running link step : cd /tmp/ltsmin17583775653416236478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17583775653416236478;'/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/stateBased2097557392821927597.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 587/587 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 587/587 (removed 0) transitions.
[2025-06-03 01:02:08] [INFO ] Flow matrix only has 558 transitions (discarded 29 similar events)
// Phase 1: matrix 558 rows 195 cols
[2025-06-03 01:02:08] [INFO ] Computed 10 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:02:08] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-06-03 01:02:08] [INFO ] Flow matrix only has 558 transitions (discarded 29 similar events)
[2025-06-03 01:02:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:02:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-03 01:02:09] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2025-06-03 01:02:09] [INFO ] Flow matrix only has 558 transitions (discarded 29 similar events)
[2025-06-03 01:02:09] [INFO ] Invariant cache hit.
[2025-06-03 01:02:09] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:22] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:22] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:22] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:24] [INFO ] Deduced a trap composed of 124 places in 299 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:25] [INFO ] Deduced a trap composed of 51 places in 304 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:33] [INFO ] Deduced a trap composed of 26 places in 329 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:33] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/753 variables, and 17 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/195 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (OVERLAPS) 557/752 variables, 195/212 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 578/802 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 802 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60368ms
Finished structural reductions in LTL mode , in 1 iterations and 61630 ms. Remains : 195/195 places, 587/587 transitions.
Built C files in :
/tmp/ltsmin3085310715252584115
[2025-06-03 01:03:09] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3085310715252584115
Running compilation step : cd /tmp/ltsmin3085310715252584115;'/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 1567 ms.
Running link step : cd /tmp/ltsmin3085310715252584115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3085310715252584115;'/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/stateBased10832840639150099086.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 01:03:25] [INFO ] Flatten gal took : 22 ms
[2025-06-03 01:03:25] [INFO ] Flatten gal took : 24 ms
[2025-06-03 01:03:25] [INFO ] Time to serialize gal into /tmp/LTL1079069250251420089.gal : 4 ms
[2025-06-03 01:03:25] [INFO ] Time to serialize properties into /tmp/LTL6243974873194983825.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/LTL1079069250251420089.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8130762833415974872.hoa' '-atoms' '/tmp/LTL6243974873194983825.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...317
Loading property file /tmp/LTL6243974873194983825.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8130762833415974872.hoa
Detected timeout of ITS tools.
[2025-06-03 01:03:40] [INFO ] Flatten gal took : 20 ms
[2025-06-03 01:03:40] [INFO ] Flatten gal took : 22 ms
[2025-06-03 01:03:40] [INFO ] Time to serialize gal into /tmp/LTL17284942752621777750.gal : 4 ms
[2025-06-03 01:03:40] [INFO ] Time to serialize properties into /tmp/LTL7631920696299939622.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/LTL17284942752621777750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7631920696299939622.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(X(G("(p525==0)")))))
Formula 0 simplified : XXF!"(p525==0)"
Detected timeout of ITS tools.
[2025-06-03 01:03:55] [INFO ] Flatten gal took : 23 ms
[2025-06-03 01:03:55] [INFO ] Applying decomposition
[2025-06-03 01:03:55] [INFO ] Flatten gal took : 23 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/graph6370638922906064170.txt' '-o' '/tmp/graph6370638922906064170.bin' '-w' '/tmp/graph6370638922906064170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6370638922906064170.bin' '-l' '-1' '-v' '-w' '/tmp/graph6370638922906064170.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:03:55] [INFO ] Decomposing Gal with order
[2025-06-03 01:03:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:03:55] [INFO ] Removed a total of 975 redundant transitions.
[2025-06-03 01:03:55] [INFO ] Flatten gal took : 49 ms
[2025-06-03 01:03:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 15 ms.
[2025-06-03 01:03:55] [INFO ] Time to serialize gal into /tmp/LTL1870372805192950628.gal : 4 ms
[2025-06-03 01:03:55] [INFO ] Time to serialize properties into /tmp/LTL12495666877971470833.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/LTL1870372805192950628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12495666877971470833.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 : !((X(X(G("(i2.u50.p525==0)")))))
Formula 0 simplified : XXF!"(i2.u50.p525==0)"
Detected timeout of ITS tools.
Treatment of property FireWire-PT-20-LTLFireability-09 finished in 325068 ms.
[2025-06-03 01:04:10] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin894969715608016467
[2025-06-03 01:04:10] [INFO ] Computing symmetric may disable matrix : 778 transitions.
[2025-06-03 01:04:10] [INFO ] Applying decomposition
[2025-06-03 01:04:10] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:04:10] [INFO ] Computing symmetric may enable matrix : 778 transitions.
[2025-06-03 01:04:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:04:10] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3990709277864445413.txt' '-o' '/tmp/graph3990709277864445413.bin' '-w' '/tmp/graph3990709277864445413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3990709277864445413.bin' '-l' '-1' '-v' '-w' '/tmp/graph3990709277864445413.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:04:10] [INFO ] Decomposing Gal with order
[2025-06-03 01:04:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:04:10] [INFO ] Computing Do-Not-Accords matrix : 778 transitions.
[2025-06-03 01:04:10] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:04:10] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin894969715608016467
Running compilation step : cd /tmp/ltsmin894969715608016467;'/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-03 01:04:10] [INFO ] Removed a total of 896 redundant transitions.
[2025-06-03 01:04:10] [INFO ] Flatten gal took : 65 ms
[2025-06-03 01:04:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 18 ms.
[2025-06-03 01:04:10] [INFO ] Time to serialize gal into /tmp/LTLFireability16036298481798655486.gal : 7 ms
[2025-06-03 01:04:10] [INFO ] Time to serialize properties into /tmp/LTLFireability12748805635532278381.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/LTLFireability16036298481798655486.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12748805635532278381.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...278
Read 2 LTL properties
Checking formula 0 : !((X(F(("(i1.i0.u56.p155==1)")||(G(("((i3.u3.p25==1)&&(i3.u46.p189==1))")||(X(X(X("((i7.i0.u10.p52==0)||(i12.i0.u31.p144==0))"))))))))...157
Formula 0 simplified : XG(!"(i1.i0.u56.p155==1)" & F(!"((i3.u3.p25==1)&&(i3.u46.p189==1))" & XXX!"((i7.i0.u10.p52==0)||(i12.i0.u31.p144==0))"))
Compilation finished in 3218 ms.
Running link step : cd /tmp/ltsmin894969715608016467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin894969715608016467;'/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(<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X(X((LTLAPp2==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin894969715608016467;'/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(<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X(X((LTLAPp2==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin894969715608016467;'/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(X([]((LTLAPp3==true))))' '--buchi-type=spotba'

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="FireWire-PT-20"
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 FireWire-PT-20, 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 r086-smll-174860102400396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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