Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 DLCround-PT-09b-LTLFireability-00
FORMULA_NAME DLCround-PT-09b-LTLFireability-01
FORMULA_NAME DLCround-PT-09b-LTLFireability-02
FORMULA_NAME DLCround-PT-09b-LTLFireability-03
FORMULA_NAME DLCround-PT-09b-LTLFireability-04
FORMULA_NAME DLCround-PT-09b-LTLFireability-05
FORMULA_NAME DLCround-PT-09b-LTLFireability-06
FORMULA_NAME DLCround-PT-09b-LTLFireability-07
FORMULA_NAME DLCround-PT-09b-LTLFireability-08
FORMULA_NAME DLCround-PT-09b-LTLFireability-09
FORMULA_NAME DLCround-PT-09b-LTLFireability-10
FORMULA_NAME DLCround-PT-09b-LTLFireability-11
FORMULA_NAME DLCround-PT-09b-LTLFireability-12
FORMULA_NAME DLCround-PT-09b-LTLFireability-13
FORMULA_NAME DLCround-PT-09b-LTLFireability-14
FORMULA_NAME DLCround-PT-09b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748675974009

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 07:19:35] [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-05-31 07:19:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:19:35] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2025-05-31 07:19:35] [INFO ] Transformed 3495 places.
[2025-05-31 07:19:35] [INFO ] Transformed 5439 transitions.
[2025-05-31 07:19:35] [INFO ] Found NUPN structural information;
[2025-05-31 07:19:35] [INFO ] Parsed PT model containing 3495 places and 5439 transitions and 15081 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DLCround-PT-09b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 3495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Discarding 614 places :
Symmetric choice reduction at 0 with 614 rule applications. Total rules 614 place count 2881 transition count 4825
Iterating global reduction 0 with 614 rules applied. Total rules applied 1228 place count 2881 transition count 4825
Discarding 499 places :
Symmetric choice reduction at 0 with 499 rule applications. Total rules 1727 place count 2382 transition count 4326
Iterating global reduction 0 with 499 rules applied. Total rules applied 2226 place count 2382 transition count 4326
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 2236 place count 2382 transition count 4316
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 2303 place count 2315 transition count 4125
Iterating global reduction 1 with 67 rules applied. Total rules applied 2370 place count 2315 transition count 4125
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 2408 place count 2277 transition count 4087
Iterating global reduction 1 with 38 rules applied. Total rules applied 2446 place count 2277 transition count 4087
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 2450 place count 2277 transition count 4083
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2472 place count 2255 transition count 4061
Iterating global reduction 2 with 22 rules applied. Total rules applied 2494 place count 2255 transition count 4061
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2516 place count 2233 transition count 4039
Iterating global reduction 2 with 22 rules applied. Total rules applied 2538 place count 2233 transition count 4039
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2560 place count 2211 transition count 4017
Iterating global reduction 2 with 22 rules applied. Total rules applied 2582 place count 2211 transition count 4017
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2594 place count 2199 transition count 4005
Iterating global reduction 2 with 12 rules applied. Total rules applied 2606 place count 2199 transition count 4005
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2614 place count 2191 transition count 3997
Iterating global reduction 2 with 8 rules applied. Total rules applied 2622 place count 2191 transition count 3997
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2630 place count 2183 transition count 3989
Iterating global reduction 2 with 8 rules applied. Total rules applied 2638 place count 2183 transition count 3989
Applied a total of 2638 rules in 1722 ms. Remains 2183 /3495 variables (removed 1312) and now considering 3989/5439 (removed 1450) transitions.
// Phase 1: matrix 3989 rows 2183 cols
[2025-05-31 07:19:37] [INFO ] Computed 184 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:39] [INFO ] Implicit Places using invariants in 1530 ms returned []
[2025-05-31 07:19:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:41] [INFO ] Implicit Places using invariants and state equation in 2672 ms returned []
Implicit Place search using SMT with State Equation took 4261 ms to find 0 implicit places.
Running 3988 sub problems to find dead transitions.
[2025-05-31 07:19:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2182/6172 variables, and 0 constraints, problems are : Problem set: 0 solved, 3988 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2183 constraints, PredecessorRefiner: 3988/3988 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3988 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2182/6172 variables, and 0 constraints, problems are : Problem set: 0 solved, 3988 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2183 constraints, PredecessorRefiner: 0/3988 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62120ms problems are : Problem set: 0 solved, 3988 unsolved
Search for dead transitions found 0 dead transitions in 62149ms
Starting structural reductions in LTL mode, iteration 1 : 2183/3495 places, 3989/5439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68172 ms. Remains : 2183/3495 places, 3989/5439 transitions.
Support contains 39 out of 2183 places after structural reductions.
[2025-05-31 07:20:44] [INFO ] Flatten gal took : 207 ms
[2025-05-31 07:20:44] [INFO ] Flatten gal took : 141 ms
[2025-05-31 07:20:44] [INFO ] Input system was already deterministic with 3989 transitions.
RANDOM walk for 40000 steps (8 resets) in 1553 ms. (25 steps per ms) remains 6/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
[2025-05-31 07:20:45] [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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 527/538 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1645/2183 variables, 173/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2183 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3989/6172 variables, 2183/2367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6172 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/6172 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6172/6172 variables, and 2367 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2019 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2183/2183 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 527/538 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1645/2183 variables, 173/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2183 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3989/6172 variables, 2183/2367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6172 variables, 6/2373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:50] [INFO ] Deduced a trap composed of 90 places in 655 ms of which 28 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/6172 variables, 1/2374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6172 variables, 0/2374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6172/6172 variables, and 2374 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2183/2183 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7067ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 2183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Graph (trivial) has 1915 edges and 2183 vertex of which 530 / 2183 are part of one of the 44 SCC in 8 ms
Free SCC test removed 486 places
Drop transitions (Empty/Sink Transition effects.) removed 554 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 568 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 339 place count 1697 transition count 3083
Reduce places removed 338 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 380 rules applied. Total rules applied 719 place count 1359 transition count 3041
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 747 place count 1331 transition count 3041
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 180 Pre rules applied. Total rules applied 747 place count 1331 transition count 2861
Deduced a syphon composed of 180 places in 11 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 1107 place count 1151 transition count 2861
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 1172 place count 1086 transition count 2352
Iterating global reduction 3 with 65 rules applied. Total rules applied 1237 place count 1086 transition count 2352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1241 place count 1086 transition count 2348
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1241 place count 1086 transition count 2346
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1245 place count 1084 transition count 2346
Performed 416 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 416 places in 0 ms
Reduce places removed 416 places and 0 transitions.
Iterating global reduction 4 with 832 rules applied. Total rules applied 2077 place count 668 transition count 1920
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2085 place count 668 transition count 1912
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 2110 place count 643 transition count 1593
Iterating global reduction 5 with 25 rules applied. Total rules applied 2135 place count 643 transition count 1593
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2158 place count 643 transition count 1570
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -418
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 2238 place count 603 transition count 1988
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 2254 place count 603 transition count 1972
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2276 place count 581 transition count 1420
Iterating global reduction 7 with 22 rules applied. Total rules applied 2298 place count 581 transition count 1420
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 2320 place count 581 transition count 1398
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2328 place count 577 transition count 1431
Drop transitions (Redundant composition of simpler transitions.) removed 150 transitions
Redundant transition composition rules discarded 150 transitions
Iterating global reduction 8 with 150 rules applied. Total rules applied 2478 place count 577 transition count 1281
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 2488 place count 567 transition count 1150
Iterating global reduction 8 with 10 rules applied. Total rules applied 2498 place count 567 transition count 1150
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 2508 place count 567 transition count 1140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2516 place count 563 transition count 1175
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2521 place count 563 transition count 1170
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 10 with 24 rules applied. Total rules applied 2545 place count 563 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2553 place count 559 transition count 1174
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2559 place count 559 transition count 1168
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 2581 place count 559 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2589 place count 555 transition count 1173
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 2596 place count 555 transition count 1166
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 12 with 20 rules applied. Total rules applied 2616 place count 555 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2624 place count 551 transition count 1174
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 2630 place count 551 transition count 1168
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 13 with 22 rules applied. Total rules applied 2652 place count 551 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2660 place count 547 transition count 1173
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2666 place count 547 transition count 1167
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 2687 place count 547 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2695 place count 543 transition count 1175
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2701 place count 543 transition count 1169
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 15 with 23 rules applied. Total rules applied 2724 place count 543 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2732 place count 539 transition count 1173
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2738 place count 539 transition count 1167
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 2759 place count 539 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2767 place count 535 transition count 1175
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2773 place count 535 transition count 1169
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 17 with 23 rules applied. Total rules applied 2796 place count 535 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2804 place count 531 transition count 1173
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2810 place count 531 transition count 1167
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 2831 place count 531 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2839 place count 527 transition count 1175
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2845 place count 527 transition count 1169
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 19 with 23 rules applied. Total rules applied 2868 place count 527 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2876 place count 523 transition count 1173
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2882 place count 523 transition count 1167
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2903 place count 523 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2911 place count 519 transition count 1175
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2917 place count 519 transition count 1169
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 21 with 23 rules applied. Total rules applied 2940 place count 519 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2948 place count 515 transition count 1173
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 21 with 7 rules applied. Total rules applied 2955 place count 515 transition count 1166
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 22 with 20 rules applied. Total rules applied 2975 place count 515 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2983 place count 511 transition count 1177
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2989 place count 511 transition count 1171
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 23 with 23 rules applied. Total rules applied 3012 place count 511 transition count 1148
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 3020 place count 507 transition count 1176
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 3026 place count 507 transition count 1170
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 3047 place count 507 transition count 1149
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 3055 place count 503 transition count 1178
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 3061 place count 503 transition count 1172
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 25 with 23 rules applied. Total rules applied 3084 place count 503 transition count 1149
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 3092 place count 499 transition count 1178
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 3098 place count 499 transition count 1172
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 26 with 21 rules applied. Total rules applied 3119 place count 499 transition count 1151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 3127 place count 495 transition count 1183
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 3133 place count 495 transition count 1177
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 27 with 22 rules applied. Total rules applied 3155 place count 495 transition count 1155
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 3163 place count 491 transition count 1182
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 3167 place count 491 transition count 1178
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 28 with 19 rules applied. Total rules applied 3186 place count 491 transition count 1159
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 3194 place count 487 transition count 1186
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 3198 place count 487 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 3217 place count 487 transition count 1163
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 3225 place count 483 transition count 1182
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 3229 place count 483 transition count 1178
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 3248 place count 483 transition count 1159
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 3256 place count 479 transition count 1178
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 3260 place count 479 transition count 1174
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 3279 place count 479 transition count 1155
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 3287 place count 475 transition count 1174
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 3291 place count 475 transition count 1170
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 3310 place count 475 transition count 1151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 3318 place count 471 transition count 1170
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 3322 place count 471 transition count 1166
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 3341 place count 471 transition count 1147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 3349 place count 467 transition count 1166
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 3353 place count 467 transition count 1162
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 3372 place count 467 transition count 1143
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 3380 place count 463 transition count 1162
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 3384 place count 463 transition count 1158
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 3403 place count 463 transition count 1139
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 3411 place count 459 transition count 1158
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 3415 place count 459 transition count 1154
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 36 with 19 rules applied. Total rules applied 3434 place count 459 transition count 1135
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 3442 place count 455 transition count 1154
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 3446 place count 455 transition count 1150
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 3465 place count 455 transition count 1131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 37 with 8 rules applied. Total rules applied 3473 place count 451 transition count 1150
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 3477 place count 451 transition count 1146
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 38 with 19 rules applied. Total rules applied 3496 place count 451 transition count 1127
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 38 with 8 rules applied. Total rules applied 3504 place count 447 transition count 1146
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 3508 place count 447 transition count 1142
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 39 with 19 rules applied. Total rules applied 3527 place count 447 transition count 1123
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 39 with 8 rules applied. Total rules applied 3535 place count 443 transition count 1142
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3539 place count 443 transition count 1138
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 40 with 19 rules applied. Total rules applied 3558 place count 443 transition count 1119
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 40 with 8 rules applied. Total rules applied 3566 place count 439 transition count 1138
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 3570 place count 439 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 41 with 19 rules applied. Total rules applied 3589 place count 439 transition count 1115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 41 with 8 rules applied. Total rules applied 3597 place count 435 transition count 1134
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 41 with 4 rules applied. Total rules applied 3601 place count 435 transition count 1130
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 42 with 19 rules applied. Total rules applied 3620 place count 435 transition count 1111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 42 with 8 rules applied. Total rules applied 3628 place count 431 transition count 1132
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 42 with 4 rules applied. Total rules applied 3632 place count 431 transition count 1128
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 43 with 19 rules applied. Total rules applied 3651 place count 431 transition count 1109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 43 with 8 rules applied. Total rules applied 3659 place count 427 transition count 1132
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 43 with 4 rules applied. Total rules applied 3663 place count 427 transition count 1128
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 44 with 19 rules applied. Total rules applied 3682 place count 427 transition count 1109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 44 with 8 rules applied. Total rules applied 3690 place count 423 transition count 1131
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 44 with 4 rules applied. Total rules applied 3694 place count 423 transition count 1127
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 45 with 19 rules applied. Total rules applied 3713 place count 423 transition count 1108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 45 with 8 rules applied. Total rules applied 3721 place count 419 transition count 1127
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 45 with 4 rules applied. Total rules applied 3725 place count 419 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 46 with 19 rules applied. Total rules applied 3744 place count 419 transition count 1104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 46 with 8 rules applied. Total rules applied 3752 place count 415 transition count 1123
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 3756 place count 415 transition count 1119
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 47 with 19 rules applied. Total rules applied 3775 place count 415 transition count 1100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 8 rules applied. Total rules applied 3783 place count 411 transition count 1127
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 47 with 4 rules applied. Total rules applied 3787 place count 411 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 48 with 19 rules applied. Total rules applied 3806 place count 411 transition count 1104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 48 with 8 rules applied. Total rules applied 3814 place count 407 transition count 1131
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 3818 place count 407 transition count 1127
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 49 with 19 rules applied. Total rules applied 3837 place count 407 transition count 1108
Free-agglomeration rule applied 41 times with reduction of 6 identical transitions.
Iterating global reduction 49 with 41 rules applied. Total rules applied 3878 place count 407 transition count 1061
Reduce places removed 41 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 381 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 385 transitions.
Graph (complete) has 1112 edges and 366 vertex of which 240 are kept as prefixes of interest. Removing 126 places using SCC suffix rule.1 ms
Discarding 126 places :
Also discarding 0 output transitions
Iterating post reduction 49 with 427 rules applied. Total rules applied 4305 place count 240 transition count 676
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 50 with 126 rules applied. Total rules applied 4431 place count 240 transition count 550
Drop transitions (Redundant composition of simpler transitions.) removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 51 with 76 rules applied. Total rules applied 4507 place count 240 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 51 with 1 rules applied. Total rules applied 4508 place count 239 transition count 473
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 51 with 7 rules applied. Total rules applied 4515 place count 232 transition count 473
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 52 with 78 rules applied. Total rules applied 4593 place count 180 transition count 447
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 52 with 84 rules applied. Total rules applied 4677 place count 180 transition count 363
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 53 with 144 rules applied. Total rules applied 4821 place count 84 transition count 315
Drop transitions (Empty/Sink Transition effects.) removed 77 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 135 transitions.
Graph (trivial) has 11 edges and 84 vertex of which 10 / 84 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 53 with 136 rules applied. Total rules applied 4957 place count 79 transition count 180
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 64 transitions.
Graph (complete) has 171 edges and 77 vertex of which 53 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Iterating post reduction 54 with 67 rules applied. Total rules applied 5024 place count 53 transition count 110
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 55 with 18 rules applied. Total rules applied 5042 place count 53 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 56 with 15 rules applied. Total rules applied 5057 place count 43 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 56 with 14 rules applied. Total rules applied 5071 place count 43 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 57 with 16 rules applied. Total rules applied 5087 place count 43 transition count 57
Graph (complete) has 93 edges and 43 vertex of which 31 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Iterating post reduction 57 with 1 rules applied. Total rules applied 5088 place count 31 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 58 with 14 rules applied. Total rules applied 5102 place count 31 transition count 43
Applied a total of 5102 rules in 2447 ms. Remains 31 /2183 variables (removed 2152) and now considering 43/3989 (removed 3946) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2447 ms. Remains : 31/2183 places, 43/3989 transitions.
RANDOM walk for 323 steps (0 resets) in 10 ms. (29 steps per ms) remains 0/6 properties
FORMULA DLCround-PT-09b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DLCround-PT-09b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 367 stabilizing places and 367 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' '!((X(X(X(G(p0)))) U ((!p1 U p2)&&F(p1))))'
Support contains 4 out of 2183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2176 transition count 3982
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2176 transition count 3982
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 2172 transition count 3978
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2172 transition count 3978
Applied a total of 22 rules in 250 ms. Remains 2172 /2183 variables (removed 11) and now considering 3978/3989 (removed 11) transitions.
// Phase 1: matrix 3978 rows 2172 cols
[2025-05-31 07:20:56] [INFO ] Computed 184 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:20:57] [INFO ] Implicit Places using invariants in 1186 ms returned []
[2025-05-31 07:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:20:59] [INFO ] Implicit Places using invariants and state equation in 2532 ms returned []
Implicit Place search using SMT with State Equation took 3721 ms to find 0 implicit places.
Running 3977 sub problems to find dead transitions.
[2025-05-31 07:20:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2171/6150 variables, and 0 constraints, problems are : Problem set: 0 solved, 3977 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2172 constraints, PredecessorRefiner: 3977/3977 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3977 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2171/6150 variables, and 0 constraints, problems are : Problem set: 0 solved, 3977 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2172 constraints, PredecessorRefiner: 0/3977 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61726ms problems are : Problem set: 0 solved, 3977 unsolved
Search for dead transitions found 0 dead transitions in 61737ms
Starting structural reductions in LTL mode, iteration 1 : 2172/2183 places, 3978/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65720 ms. Remains : 2172/2183 places, 3978/3989 transitions.
Stuttering acceptance computed with spot in 553 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-00
Product exploration explored 100000 steps with 19 reset in 669 ms.
Product exploration explored 100000 steps with 16 reset in 736 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 184 ms. Reduced automaton from 10 states, 20 edges and 3 AP (stutter sensitive) to 10 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 918 ms. (43 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
[2025-05-31 07:22:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 358/362 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1810/2172 variables, 180/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2172 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3978/6150 variables, 2172/2356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6150 variables, 0/2356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6150 variables, 0/2356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6150/6150 variables, and 2356 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1769 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2172/2172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 358/362 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1810/2172 variables, 180/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2172 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3978/6150 variables, 2172/2356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6150 variables, 1/2357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6150 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/6150 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6150/6150 variables, and 2357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1774 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2172/2172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3585ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 739 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=123 )
Parikh walk visited 1 properties in 19 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 p0))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 372 ms. Reduced automaton from 10 states, 20 edges and 3 AP (stutter sensitive) to 10 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
[2025-05-31 07:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:22:11] [INFO ] [Real]Absence check using 184 positive place invariants in 850 ms returned unsat
Proved EG (NOT p1)
[2025-05-31 07:22:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:22:13] [INFO ] [Real]Absence check using 184 positive place invariants in 522 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 p0))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (G (NOT p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 9 factoid took 441 ms. Reduced automaton from 10 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-09b-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-09b-LTLFireability-00 finished in 78674 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||X(X(X(p1)))))))'
Support contains 3 out of 2183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2176 transition count 3982
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2176 transition count 3982
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 2173 transition count 3979
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 2173 transition count 3979
Applied a total of 20 rules in 243 ms. Remains 2173 /2183 variables (removed 10) and now considering 3979/3989 (removed 10) transitions.
// Phase 1: matrix 3979 rows 2173 cols
[2025-05-31 07:22:14] [INFO ] Computed 184 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:22:15] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2025-05-31 07:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:22:18] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 3901 ms to find 0 implicit places.
Running 3978 sub problems to find dead transitions.
[2025-05-31 07:22:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2172/6152 variables, and 0 constraints, problems are : Problem set: 0 solved, 3978 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2173 constraints, PredecessorRefiner: 3978/3978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3978 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(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 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(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 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 timeout
1)
(s474 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2172/6152 variables, and 0 constraints, problems are : Problem set: 0 solved, 3978 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2173 constraints, PredecessorRefiner: 0/3978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61981ms problems are : Problem set: 0 solved, 3978 unsolved
Search for dead transitions found 0 dead transitions in 61993ms
Starting structural reductions in LTL mode, iteration 1 : 2173/2183 places, 3979/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66161 ms. Remains : 2173/2183 places, 3979/3989 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 748 steps with 0 reset in 3 ms.
FORMULA DLCround-PT-09b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-02 finished in 66430 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&&G(p1)&&X((F(!p2)||G(p0)))))))'
Support contains 4 out of 2183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2175 transition count 3981
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2175 transition count 3981
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 2171 transition count 3977
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 2171 transition count 3977
Applied a total of 24 rules in 231 ms. Remains 2171 /2183 variables (removed 12) and now considering 3977/3989 (removed 12) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2025-05-31 07:23:21] [INFO ] Computed 184 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:23:22] [INFO ] Implicit Places using invariants in 1200 ms returned []
[2025-05-31 07:23:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:23:24] [INFO ] Implicit Places using invariants and state equation in 2595 ms returned []
Implicit Place search using SMT with State Equation took 3798 ms to find 0 implicit places.
Running 3976 sub problems to find dead transitions.
[2025-05-31 07:23:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 3976/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3976 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 0/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61736ms problems are : Problem set: 0 solved, 3976 unsolved
Search for dead transitions found 0 dead transitions in 61743ms
Starting structural reductions in LTL mode, iteration 1 : 2171/2183 places, 3977/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65784 ms. Remains : 2171/2183 places, 3977/3989 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (OR (NOT p1) p2), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-03 finished in 66038 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||G(p1)))))'
Support contains 2 out of 2183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Graph (trivial) has 1922 edges and 2183 vertex of which 524 / 2183 are part of one of the 43 SCC in 2 ms
Free SCC test removed 481 places
Ensure Unique test removed 519 transitions
Reduce isomorphic transitions removed 519 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 341 place count 1701 transition count 3129
Reduce places removed 340 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 382 rules applied. Total rules applied 723 place count 1361 transition count 3087
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 751 place count 1333 transition count 3087
Performed 181 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 181 Pre rules applied. Total rules applied 751 place count 1333 transition count 2906
Deduced a syphon composed of 181 places in 12 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 1113 place count 1152 transition count 2906
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 1179 place count 1086 transition count 2372
Iterating global reduction 3 with 66 rules applied. Total rules applied 1245 place count 1086 transition count 2372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1249 place count 1086 transition count 2368
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1249 place count 1086 transition count 2366
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1253 place count 1084 transition count 2366
Performed 415 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 415 places in 0 ms
Reduce places removed 415 places and 0 transitions.
Iterating global reduction 4 with 830 rules applied. Total rules applied 2083 place count 669 transition count 1941
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 2092 place count 669 transition count 1932
Renaming transitions due to excessive name length > 1024 char.
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 2119 place count 642 transition count 1593
Iterating global reduction 5 with 27 rules applied. Total rules applied 2146 place count 642 transition count 1593
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2170 place count 642 transition count 1569
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 2196 place count 629 transition count 1688
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2200 place count 629 transition count 1684
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2204 place count 625 transition count 1600
Iterating global reduction 7 with 4 rules applied. Total rules applied 2208 place count 625 transition count 1600
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2212 place count 625 transition count 1596
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2220 place count 621 transition count 1630
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 8 with 40 rules applied. Total rules applied 2260 place count 621 transition count 1590
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2279 place count 602 transition count 1552
Iterating global reduction 8 with 19 rules applied. Total rules applied 2298 place count 602 transition count 1552
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2317 place count 583 transition count 1301
Iterating global reduction 8 with 19 rules applied. Total rules applied 2336 place count 583 transition count 1301
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2355 place count 583 transition count 1282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2356 place count 582 transition count 1281
Applied a total of 2356 rules in 445 ms. Remains 582 /2183 variables (removed 1601) and now considering 1281/3989 (removed 2708) transitions.
[2025-05-31 07:24:27] [INFO ] Flow matrix only has 1253 transitions (discarded 28 similar events)
// Phase 1: matrix 1253 rows 582 cols
[2025-05-31 07:24:27] [INFO ] Computed 184 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:24:27] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-31 07:24:27] [INFO ] Flow matrix only has 1253 transitions (discarded 28 similar events)
[2025-05-31 07:24:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:24:27] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-31 07:24:28] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:24:28] [INFO ] Redundant transitions in 155 ms returned []
Running 1207 sub problems to find dead transitions.
[2025-05-31 07:24:28] [INFO ] Flow matrix only has 1253 transitions (discarded 28 similar events)
[2025-05-31 07:24:28] [INFO ] Invariant cache hit.
[2025-05-31 07:24:28] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
At refinement iteration 2 (OVERLAPS) 1/582 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/1835 variables, and 184 constraints, problems are : Problem set: 0 solved, 1207 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/582 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 1207/1207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
At refinement iteration 2 (OVERLAPS) 1/582 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/1835 variables, and 184 constraints, problems are : Problem set: 0 solved, 1207 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/582 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 0/1207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60988ms problems are : Problem set: 0 solved, 1207 unsolved
Search for dead transitions found 0 dead transitions in 60990ms
Starting structural reductions in SI_LTL mode, iteration 1 : 582/2183 places, 1281/3989 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62466 ms. Remains : 582/2183 places, 1281/3989 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-05
Stuttering criterion allowed to conclude after 898 steps with 0 reset in 18 ms.
FORMULA DLCround-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-05 finished in 62573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 1 out of 2183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2175 transition count 3981
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2175 transition count 3981
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 2171 transition count 3977
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 2171 transition count 3977
Applied a total of 24 rules in 227 ms. Remains 2171 /2183 variables (removed 12) and now considering 3977/3989 (removed 12) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2025-05-31 07:25:29] [INFO ] Computed 184 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:25:30] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2025-05-31 07:25:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:25:33] [INFO ] Implicit Places using invariants and state equation in 2595 ms returned []
Implicit Place search using SMT with State Equation took 3752 ms to find 0 implicit places.
Running 3976 sub problems to find dead transitions.
[2025-05-31 07:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 3976/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3976 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 0/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61597ms problems are : Problem set: 0 solved, 3976 unsolved
Search for dead transitions found 0 dead transitions in 61603ms
Starting structural reductions in LTL mode, iteration 1 : 2171/2183 places, 3977/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65594 ms. Remains : 2171/2183 places, 3977/3989 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 743 ms.
Product exploration explored 100000 steps with 0 reset in 920 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 18816 steps (3 resets) in 210 ms. (89 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 1 out of 2171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1911 edges and 2171 vertex of which 530 / 2171 are part of one of the 44 SCC in 2 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 331 place count 1684 transition count 3122
Reduce places removed 330 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 372 rules applied. Total rules applied 703 place count 1354 transition count 3080
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 29 rules applied. Total rules applied 732 place count 1326 transition count 3079
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 733 place count 1325 transition count 3079
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 182 Pre rules applied. Total rules applied 733 place count 1325 transition count 2897
Deduced a syphon composed of 182 places in 11 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 4 with 364 rules applied. Total rules applied 1097 place count 1143 transition count 2897
Discarding 68 places :
Symmetric choice reduction at 4 with 68 rule applications. Total rules 1165 place count 1075 transition count 2313
Iterating global reduction 4 with 68 rules applied. Total rules applied 1233 place count 1075 transition count 2313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1237 place count 1075 transition count 2309
Performed 411 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 411 places in 1 ms
Reduce places removed 411 places and 0 transitions.
Iterating global reduction 5 with 822 rules applied. Total rules applied 2059 place count 664 transition count 1889
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 2069 place count 664 transition count 1879
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 2093 place count 640 transition count 1579
Iterating global reduction 6 with 24 rules applied. Total rules applied 2117 place count 640 transition count 1579
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 2141 place count 640 transition count 1555
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 2165 place count 628 transition count 1662
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2169 place count 628 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2173 place count 624 transition count 1574
Iterating global reduction 8 with 4 rules applied. Total rules applied 2177 place count 624 transition count 1574
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2181 place count 624 transition count 1570
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2189 place count 620 transition count 1604
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 9 with 39 rules applied. Total rules applied 2228 place count 620 transition count 1565
Discarding 19 places :
Symmetric choice reduction at 9 with 19 rule applications. Total rules 2247 place count 601 transition count 1527
Iterating global reduction 9 with 19 rules applied. Total rules applied 2266 place count 601 transition count 1527
Discarding 19 places :
Symmetric choice reduction at 9 with 19 rule applications. Total rules 2285 place count 582 transition count 1276
Iterating global reduction 9 with 19 rules applied. Total rules applied 2304 place count 582 transition count 1276
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 2323 place count 582 transition count 1257
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2324 place count 581 transition count 1256
Applied a total of 2324 rules in 352 ms. Remains 581 /2171 variables (removed 1590) and now considering 1256/3977 (removed 2721) transitions.
[2025-05-31 07:26:37] [INFO ] Flow matrix only has 1227 transitions (discarded 29 similar events)
// Phase 1: matrix 1227 rows 581 cols
[2025-05-31 07:26:37] [INFO ] Computed 184 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:26:38] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-05-31 07:26:38] [INFO ] Flow matrix only has 1227 transitions (discarded 29 similar events)
[2025-05-31 07:26:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:26:38] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-31 07:26:38] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:26:38] [INFO ] Redundant transitions in 19 ms returned []
Running 1183 sub problems to find dead transitions.
[2025-05-31 07:26:38] [INFO ] Flow matrix only has 1227 transitions (discarded 29 similar events)
[2025-05-31 07:26:38] [INFO ] Invariant cache hit.
[2025-05-31 07:26:38] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1808 variables, and 184 constraints, problems are : Problem set: 0 solved, 1183 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/581 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 1183/1183 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/1808 variables, and 184 constraints, problems are : Problem set: 0 solved, 1183 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/581 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 0/1183 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60945ms problems are : Problem set: 0 solved, 1183 unsolved
Search for dead transitions found 0 dead transitions in 60947ms
Starting structural reductions in SI_LTL mode, iteration 1 : 581/2171 places, 1256/3977 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62147 ms. Remains : 581/2171 places, 1256/3977 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 2213 steps (0 resets) in 205 ms. (10 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering criterion allowed to conclude after 680 steps with 0 reset in 15 ms.
FORMULA DLCround-PT-09b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-07 finished in 131035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(p0) U !p1)&&p2))))'
Support contains 5 out of 2183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2176 transition count 3982
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2176 transition count 3982
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 2173 transition count 3979
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 2173 transition count 3979
Applied a total of 20 rules in 227 ms. Remains 2173 /2183 variables (removed 10) and now considering 3979/3989 (removed 10) transitions.
// Phase 1: matrix 3979 rows 2173 cols
[2025-05-31 07:27:40] [INFO ] Computed 184 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:27:41] [INFO ] Implicit Places using invariants in 1163 ms returned []
[2025-05-31 07:27:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:27:44] [INFO ] Implicit Places using invariants and state equation in 2541 ms returned []
Implicit Place search using SMT with State Equation took 3707 ms to find 0 implicit places.
Running 3978 sub problems to find dead transitions.
[2025-05-31 07:27:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2172/6152 variables, and 0 constraints, problems are : Problem set: 0 solved, 3978 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2173 constraints, PredecessorRefiner: 3978/3978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3978 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2172/6152 variables, and 0 constraints, problems are : Problem set: 0 solved, 3978 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2173 constraints, PredecessorRefiner: 0/3978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61632ms problems are : Problem set: 0 solved, 3978 unsolved
Search for dead transitions found 0 dead transitions in 61639ms
Starting structural reductions in LTL mode, iteration 1 : 2173/2183 places, 3979/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65584 ms. Remains : 2173/2183 places, 3979/3989 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) p1), (OR (NOT p0) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), true]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 506 ms.
Product exploration explored 100000 steps with 33333 reset in 487 ms.
Computed a total of 365 stabilizing places and 365 stable transitions
Computed a total of 365 stabilizing places and 365 stable transitions
Detected a total of 365/2173 stabilizing places and 365/3979 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-09b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-09b-LTLFireability-08 finished in 66911 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((p0||X((F((p1 U (G(p1)||(p1&&G(p2)))))||(X(p3) U (p0&&X(p3))))))))'
Support contains 5 out of 2183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2176 transition count 3982
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2176 transition count 3982
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 2172 transition count 3978
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2172 transition count 3978
Applied a total of 22 rules in 226 ms. Remains 2172 /2183 variables (removed 11) and now considering 3978/3989 (removed 11) transitions.
// Phase 1: matrix 3978 rows 2172 cols
[2025-05-31 07:28:47] [INFO ] Computed 184 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:28:48] [INFO ] Implicit Places using invariants in 1179 ms returned []
[2025-05-31 07:28:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:28:51] [INFO ] Implicit Places using invariants and state equation in 2589 ms returned []
Implicit Place search using SMT with State Equation took 3770 ms to find 0 implicit places.
Running 3977 sub problems to find dead transitions.
[2025-05-31 07:28:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2171/6150 variables, and 0 constraints, problems are : Problem set: 0 solved, 3977 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2172 constraints, PredecessorRefiner: 3977/3977 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3977 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 2171/6150 variables, and 0 constraints, problems are : Problem set: 0 solved, 3977 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2172 constraints, PredecessorRefiner: 0/3977 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61623ms problems are : Problem set: 0 solved, 3977 unsolved
Search for dead transitions found 0 dead transitions in 61629ms
Starting structural reductions in LTL mode, iteration 1 : 2172/2183 places, 3978/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65638 ms. Remains : 2172/2183 places, 3978/3989 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 619 ms.
Product exploration explored 100000 steps with 0 reset in 790 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (OR (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p2 p1)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p2 p1 (NOT p3)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (OR (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 149 ms. Reduced automaton from 7 states, 24 edges and 4 AP (stutter sensitive) to 7 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (8 resets) in 406 ms. (98 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
[2025-05-31 07:29:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 212/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1957/2172 variables, 181/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:29:56] [INFO ] Deduced a trap composed of 90 places in 798 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:29:57] [INFO ] Deduced a trap composed of 91 places in 762 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:29:58] [INFO ] Deduced a trap composed of 125 places in 779 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:29:59] [INFO ] Deduced a trap composed of 129 places in 602 ms of which 55 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2172 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2172 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3978/6150 variables, 2172/2360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6150 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 2 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 6150/6150 variables, and 2360 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2172/2172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 212/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1957/2172 variables, 181/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2172 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2172 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3978/6150 variables, 2172/2360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6150 variables, 2/2362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6150 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/6150 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6150/6150 variables, and 2362 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2284 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2172/2172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7309ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 644 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=161 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (OR (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p2 p1)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p2 p1 (NOT p3)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (OR (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p2 p3))), (F p3), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (OR p1 p3) (OR p2 p3)))), (F (NOT (AND p1 p2 (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 24 factoid took 716 ms. Reduced automaton from 7 states, 24 edges and 4 AP (stutter sensitive) to 7 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 2172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3978/3978 transitions.
Applied a total of 0 rules in 79 ms. Remains 2172 /2172 variables (removed 0) and now considering 3978/3978 (removed 0) transitions.
[2025-05-31 07:30:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:30:05] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2025-05-31 07:30:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:30:08] [INFO ] Implicit Places using invariants and state equation in 2623 ms returned []
Implicit Place search using SMT with State Equation took 3791 ms to find 0 implicit places.
Running 3977 sub problems to find dead transitions.
[2025-05-31 07:30:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2171/6150 variables, and 0 constraints, problems are : Problem set: 0 solved, 3977 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2172 constraints, PredecessorRefiner: 3977/3977 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3977 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2171/6150 variables, and 0 constraints, problems are : Problem set: 0 solved, 3977 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2172 constraints, PredecessorRefiner: 0/3977 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61758ms problems are : Problem set: 0 solved, 3977 unsolved
Search for dead transitions found 0 dead transitions in 61764ms
Finished structural reductions in LTL mode , in 1 iterations and 65648 ms. Remains : 2172/2172 places, 3978/3978 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2 (NOT p3)), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT p0)), (X p1), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p1 p2 (NOT p3)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 141 ms. Reduced automaton from 7 states, 24 edges and 4 AP (stutter sensitive) to 7 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (8 resets) in 301 ms. (132 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
[2025-05-31 07:31:10] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 263/268 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1904/2172 variables, 180/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2172 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3978/6150 variables, 2172/2356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6150 variables, 0/2356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/6150 variables, 0/2356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6150/6150 variables, and 2356 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3053 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2172/2172 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 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 263/268 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1904/2172 variables, 180/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2172 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3978/6150 variables, 2172/2356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6150 variables, 3/2359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:31:16] [INFO ] Deduced a trap along path composed of 5 places in 55 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/6150 variables, 1/2360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6150 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/6150 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6150/6150 variables, and 2360 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4760 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2172/2172 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7828ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 648 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=64 )
Parikh walk visited 3 properties in 1185 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2 (NOT p3)), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT p0)), (X p1), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p1 p2 (NOT p3)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p2 p3))), (F p3), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (OR p1 p3) (OR p2 p3)))), (F (NOT (AND p1 p2 (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 24 factoid took 781 ms. Reduced automaton from 7 states, 24 edges and 4 AP (stutter sensitive) to 7 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 662 ms.
Product exploration explored 100000 steps with 0 reset in 801 ms.
Applying partial POR strategy [false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 2172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2172/2172 places, 3978/3978 transitions.
Graph (trivial) has 1906 edges and 2172 vertex of which 518 / 2172 are part of one of the 42 SCC in 4 ms
Free SCC test removed 476 places
Ensure Unique test removed 514 transitions
Reduce isomorphic transitions removed 514 transitions.
Performed 332 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1696 transition count 3464
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 28 rules applied. Total rules applied 361 place count 1696 transition count 3450
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 361 place count 1696 transition count 3455
Deduced a syphon composed of 357 places in 14 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 372 place count 1696 transition count 3455
Discarding 151 places :
Symmetric choice reduction at 2 with 151 rule applications. Total rules 523 place count 1545 transition count 2812
Deduced a syphon composed of 272 places in 12 ms
Iterating global reduction 2 with 151 rules applied. Total rules applied 674 place count 1545 transition count 2812
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 678 place count 1545 transition count 2808
Performed 584 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 856 places in 1 ms
Iterating global reduction 3 with 584 rules applied. Total rules applied 1262 place count 1545 transition count 2818
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1272 place count 1545 transition count 2808
Renaming transitions due to excessive name length > 1024 char.
Discarding 422 places :
Symmetric choice reduction at 4 with 422 rule applications. Total rules 1694 place count 1123 transition count 2098
Deduced a syphon composed of 459 places in 0 ms
Iterating global reduction 4 with 422 rules applied. Total rules applied 2116 place count 1123 transition count 2098
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2140 place count 1123 transition count 2074
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2150 place count 1113 transition count 2064
Deduced a syphon composed of 449 places in 1 ms
Iterating global reduction 5 with 10 rules applied. Total rules applied 2160 place count 1113 transition count 2064
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -197
Deduced a syphon composed of 481 places in 1 ms
Iterating global reduction 5 with 32 rules applied. Total rules applied 2192 place count 1113 transition count 2261
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 2210 place count 1113 transition count 2243
Discarding 46 places :
Symmetric choice reduction at 6 with 46 rule applications. Total rules 2256 place count 1067 transition count 2069
Deduced a syphon composed of 439 places in 1 ms
Iterating global reduction 6 with 46 rules applied. Total rules applied 2302 place count 1067 transition count 2069
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2310 place count 1067 transition count 2061
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2318 place count 1059 transition count 2045
Deduced a syphon composed of 431 places in 1 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2326 place count 1059 transition count 2045
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 435 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2330 place count 1059 transition count 2085
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2334 place count 1055 transition count 2077
Deduced a syphon composed of 431 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2338 place count 1055 transition count 2077
Deduced a syphon composed of 431 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 7 with 36 rules applied. Total rules applied 2374 place count 1055 transition count 2041
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2392 place count 1037 transition count 2005
Deduced a syphon composed of 431 places in 0 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2410 place count 1037 transition count 2005
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2428 place count 1019 transition count 1769
Deduced a syphon composed of 431 places in 0 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2446 place count 1019 transition count 1769
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 2473 place count 1019 transition count 1742
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2490 place count 1002 transition count 1716
Deduced a syphon composed of 414 places in 1 ms
Iterating global reduction 8 with 17 rules applied. Total rules applied 2507 place count 1002 transition count 1716
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 415 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 2508 place count 1002 transition count 1728
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2509 place count 1001 transition count 1726
Deduced a syphon composed of 414 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 2510 place count 1001 transition count 1726
Deduced a syphon composed of 414 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2513 place count 1001 transition count 1723
Deduced a syphon composed of 414 places in 0 ms
Applied a total of 2513 rules in 1683 ms. Remains 1001 /2172 variables (removed 1171) and now considering 1723/3978 (removed 2255) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:31:25] [INFO ] Redundant transitions in 35 ms returned []
Running 1722 sub problems to find dead transitions.
[2025-05-31 07:31:25] [INFO ] Flow matrix only has 1692 transitions (discarded 31 similar events)
// Phase 1: matrix 1692 rows 1001 cols
[2025-05-31 07:31:25] [INFO ] Computed 184 invariants in 50 ms
[2025-05-31 07:31:25] [INFO ] State equation strengthened by 218 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2693 variables, and 0 constraints, problems are : Problem set: 0 solved, 1722 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/1001 constraints, ReadFeed: 0/218 constraints, PredecessorRefiner: 1722/1394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1722 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1000/2693 variables, and 0 constraints, problems are : Problem set: 0 solved, 1722 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/1001 constraints, ReadFeed: 0/218 constraints, PredecessorRefiner: 328/1394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61210ms problems are : Problem set: 0 solved, 1722 unsolved
Search for dead transitions found 0 dead transitions in 61213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2172 places, 1723/3978 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62944 ms. Remains : 1001/2172 places, 1723/3978 transitions.
Built C files in :
/tmp/ltsmin1800786893430374384
[2025-05-31 07:32:26] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1800786893430374384
Running compilation step : cd /tmp/ltsmin1800786893430374384;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1800786893430374384;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1800786893430374384;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 2172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3978/3978 transitions.
Applied a total of 0 rules in 71 ms. Remains 2172 /2172 variables (removed 0) and now considering 3978/3978 (removed 0) transitions.
// Phase 1: matrix 3978 rows 2172 cols
[2025-05-31 07:32:29] [INFO ] Computed 184 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:32:30] [INFO ] Implicit Places using invariants in 1225 ms returned []
[2025-05-31 07:32:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:32:33] [INFO ] Implicit Places using invariants and state equation in 2615 ms returned []
Implicit Place search using SMT with State Equation took 3852 ms to find 0 implicit places.
Running 3977 sub problems to find dead transitions.
[2025-05-31 07:32:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2171/6150 variables, and 0 constraints, problems are : Problem set: 0 solved, 3977 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2172 constraints, PredecessorRefiner: 3977/3977 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3977 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(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 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(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 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 1)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 1)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 1)
(s1789 1)
(s1790 1)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 1)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 1)
(s1803 1)
(s1804 1)
(s1805 1)
(s1806 1)
(s1807 1)
(s1808 1)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 1)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 1)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 1)
(s1842 1)
(s1843 1)
(s1844 1)
(s1845 1)
(s1846 1)
(s1847 1)
(s1848 1)
(s1849 1)
(s1850 1)
(s1851 1)
(s1852 1)
(s1853 1)
(s1854 1)
(s1855 1)
(s1856 1)
(s1857 1)
(s1858 1)
(s1859 1)
(s1860 1)
(s1861 1)
(s1862 1)
(s1863 1)
(s1864 1)
(s1865 1)
(s1866 1)
(s1867 1)
(s1868 1)
(s1869 1)
(s1870 1)
(s1871 1)
(s1872 1)
(s1873 1)
(s1874 1)
(s1875 1)
(s1876 1)
(s1877 1)
(s1878 1)
(s1879 1)
(s1880 1)
(s1881 1)
(s1882 1)
(s1883 1)
(s1884 1)
(s1885 1)
(s1886 1)
(s1887 1)
(s1888 1)
(s1889 1)
(s1890 1)
(s1891 1)
(s1892 1)
(s1893 1)
(s1894 1)
(s1895 1)
(s1896 1)
(s1897 1)
(s1898 1)
(s1899 1)
(s1900 1)
(s1901 1)
(s1902 1)
(s1903 1)
(s1904 1)
(s1905 1)
(s1906 1)
(s1907 1)
(s1908 1)
(s1909 1)
(s1910 1)
(s1911 1)
(s1912 1)
(s1913 1)
(s1914 1)
(s1915 1)
(s1916 1)
(s1917 1)
(s1918 1)
(s1919 1)
(s1920 1)
(s1921 1)
(s1922 1)
(s1923 1)
(s1924 1)
(s1925 1)
(s1926 1)
(s1927 1)
(s1928 1)
(s1929 1)
(s1930 1)
(s1931 1)
(s1932 1)
(s1933 1)
(s1934 1)
(s1935 1)
(s1936 1)
(s1937 1)
(s1938 1)
(s1939 1)
(s1940 1)
(s1941 1)
(s1942 1)
(s1943 1)
(s1944 1)
(s1945 1)
(s1946 1)
(s1947 1)
(s1948 1)
(s1949 1)
(s1950 1)
(s1951 1)
(s1952 1)
(s1953 1)
(s1954 1)
(s1955 1)
(s1956 1)
(s1957 1)
(s1958 1)
(s1959 1)
(s1960 1)
(s1961 1)
(s1962 1)
(s1963 1)
(s1964 1)
(s1965 1)
(s1966 1)
(s1967 1)
(s1968 1)
(s1969 1)
(s1970 1)
(s1971 1)
(s1972 1)
(s1973 1)
(s1974 1)
(s1975 1)
(s1976 1)
(s1977 1)
(s1978 1)
(s1979 1)
(s1980 1)
(s1981 1)
(s1982 1)
(s1983 1)
(s1984 1)
(s1985 1)
(s1986 1)
(s1987 1)
(s1988 1)
(s1989 1)
(s1990 1)
(s1991 1)
(s1992 1)
(s1993 1)
(s1994 1)
(s1995 1)
(s1996 1)
(s1997 1)
(s1998 1)
(s1999 1)
(s2000 1)
(s2001 1)
(s2002 1)
(s2003 1)
(s2004 1)
(s2005 1)
(s2006 1)
(s2007 1)
(s2008 1)
(s2009 1)
(s2010 1)
(s2011 1)
(s2012 1)
(s2013 1)
(s2014 1)
(s2015 1)
(s2016 1)
(s2017 1)
(s2018 1)
(s2019 1)
(s2020 1)
(s2021 1)
(s2022 1)
(s2023 1)
(s2024 1)
(s2025 1)
(s2026 1)
(s2027 1)
(s2028 1)
(s2029 1)
(s2030 1)
(s2031 1)
(s2032 1)
(s2033 1)
(s2034 1)
(s2035 1)
(s2036 1)
(s2037 1)
(s2038 1)
(s2039 1)
(s2040 1)
(s2041 1)
(s2042 1)
(s2043 1)
(s2044 1)
(s2045 1)
(s2046 1)
(s2047 1)
(s2048 1)
(s2049 1)
(s2050 1)
(s2051 1)
(s2052 1)
(s2053 1)
(s2054 1)
(s2055 1)
(s2056 1)
(s2057 1)
(s2058 1)
(s2059 1)
(s2060 1)
(s2061 1)
(s2062 1)
(s2063 1)
(s2064 1)
(s2065 1)
(s2066 1)
(s2067 1)
(s2068 1)
(s2069 1)
(s2070 1)
(s2071 1)
(s2072 1)
(s2073 1)
(s2074 1)
(s2075 1)
(s2076 1)
(s2077 1)
(s2078 1)
(s2079 1)
(s2080 1)
(s2081 1)
(s2082 1)
(s2083 1)
(s2084 1)
(s2085 1)
(s2086 1)
(s2087 1)
(s2088 1)
(s2089 1)
(s2090 1)
(s2091 1)
(s2092 1)
(s2093 1)
(s2094 1)
(s2095 1)
(s2096 1)
(s2097 1)
(s2098 1)
(s2099 1)
(s2100 1)
(s2101 1)
(s2102 1)
(s2103 1)
(s2104 1)
(s2105 1)
(s2106 1)
(s2107 1)
(s2108 1)
(s2109 1)
(s2110 1)
(s2111 1)
(s2112 1)
(s2113 1)
(s2114 1)
(s2115 1)
(s2116 1)
(s2117 1)
(s2118 1)
(s2119 1)
(s2120 1)
(s2121 1)
(s2122 1)
(s2123 1)
(s2124 1)
(s2125 1)
(s2126 1)
(s2127 1)
(s2128 1)
(s2129 1)
(s2130 1)
(s2131 1)
(s2132 1)
(s2133 1)
(s2134 1)
(s2135 1)
(s2136 1)timeout

(s2137 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2171/6150 variables, and 0 constraints, problems are : Problem set: 0 solved, 3977 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2172 constraints, PredecessorRefiner: 0/3977 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61720ms problems are : Problem set: 0 solved, 3977 unsolved
Search for dead transitions found 0 dead transitions in 61726ms
Finished structural reductions in LTL mode , in 1 iterations and 65659 ms. Remains : 2172/2172 places, 3978/3978 transitions.
Built C files in :
/tmp/ltsmin7500949003599138083
[2025-05-31 07:33:35] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7500949003599138083
Running compilation step : cd /tmp/ltsmin7500949003599138083;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7500949003599138083;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7500949003599138083;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 07:33:38] [INFO ] Flatten gal took : 103 ms
[2025-05-31 07:33:38] [INFO ] Flatten gal took : 104 ms
[2025-05-31 07:33:38] [INFO ] Time to serialize gal into /tmp/LTL13239353512259287820.gal : 30 ms
[2025-05-31 07:33:38] [INFO ] Time to serialize properties into /tmp/LTL2750632184642215922.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/LTL13239353512259287820.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9359142500968068325.hoa' '-atoms' '/tmp/LTL2750632184642215922.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/LTL2750632184642215922.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9359142500968068325.hoa
Detected timeout of ITS tools.
[2025-05-31 07:33:53] [INFO ] Flatten gal took : 96 ms
[2025-05-31 07:33:53] [INFO ] Flatten gal took : 103 ms
[2025-05-31 07:33:53] [INFO ] Time to serialize gal into /tmp/LTL8007415044544473419.gal : 21 ms
[2025-05-31 07:33:53] [INFO ] Time to serialize properties into /tmp/LTL13150661387433805132.ltl : 4 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/LTL8007415044544473419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13150661387433805132.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(p3020==1)")||(X((F(("(p1576!=1)")U((G("(p1576!=1)"))||(("(p1576!=1)")&&(G("(p1319!=1)"))))))||((X("((p1579==1)&&(p2551==1))"))...211
Formula 0 simplified : F(!"(p3020==1)" & X(G(F!"(p1319!=1)" U !"(p1576!=1)") & (!"(p3020==1)" W X!"((p1579==1)&&(p2551==1))")))
Detected timeout of ITS tools.
[2025-05-31 07:34:09] [INFO ] Flatten gal took : 81 ms
[2025-05-31 07:34:09] [INFO ] Applying decomposition
[2025-05-31 07:34:09] [INFO ] Flatten gal took : 86 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/graph5639347936354743016.txt' '-o' '/tmp/graph5639347936354743016.bin' '-w' '/tmp/graph5639347936354743016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5639347936354743016.bin' '-l' '-1' '-v' '-w' '/tmp/graph5639347936354743016.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:34:09] [INFO ] Decomposing Gal with order
[2025-05-31 07:34:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:34:10] [INFO ] Removed a total of 3811 redundant transitions.
[2025-05-31 07:34:10] [INFO ] Flatten gal took : 280 ms
[2025-05-31 07:34:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 62 ms.
[2025-05-31 07:34:10] [INFO ] Time to serialize gal into /tmp/LTL17502821721966762875.gal : 32 ms
[2025-05-31 07:34:10] [INFO ] Time to serialize properties into /tmp/LTL4349905434293755015.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/LTL17502821721966762875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4349905434293755015.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(i11.u715.p3020==1)")||(X((F(("(i20.i1.i6.u403.p1576!=1)")U((G("(i20.i1.i6.u403.p1576!=1)"))||(("(i20.i1.i6.u403.p1576!=1)")&&(...351
Formula 0 simplified : F(!"(i11.u715.p3020==1)" & X(G(F!"(i17.i0.i2.u332.p1319!=1)" U !"(i20.i1.i6.u403.p1576!=1)") & (!"(i11.u715.p3020==1)" W X!"((i20.i1...206
Detected timeout of ITS tools.
Treatment of property DLCround-PT-09b-LTLFireability-09 finished in 337913 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)))'
Support contains 1 out of 2183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Graph (trivial) has 1924 edges and 2183 vertex of which 530 / 2183 are part of one of the 44 SCC in 1 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 338 place count 1696 transition count 3127
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 379 rules applied. Total rules applied 717 place count 1359 transition count 3085
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 745 place count 1331 transition count 3085
Performed 181 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 181 Pre rules applied. Total rules applied 745 place count 1331 transition count 2904
Deduced a syphon composed of 181 places in 11 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 1107 place count 1150 transition count 2904
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 1174 place count 1083 transition count 2357
Iterating global reduction 3 with 67 rules applied. Total rules applied 1241 place count 1083 transition count 2357
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1245 place count 1083 transition count 2353
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1245 place count 1083 transition count 2351
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1249 place count 1081 transition count 2351
Performed 414 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 414 places in 0 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 4 with 828 rules applied. Total rules applied 2077 place count 667 transition count 1927
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 2086 place count 667 transition count 1918
Renaming transitions due to excessive name length > 1024 char.
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 2113 place count 640 transition count 1579
Iterating global reduction 5 with 27 rules applied. Total rules applied 2140 place count 640 transition count 1579
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 2165 place count 640 transition count 1554
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2189 place count 628 transition count 1661
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2193 place count 628 transition count 1657
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2197 place count 624 transition count 1573
Iterating global reduction 7 with 4 rules applied. Total rules applied 2201 place count 624 transition count 1573
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2205 place count 624 transition count 1569
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2213 place count 620 transition count 1603
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 8 with 40 rules applied. Total rules applied 2253 place count 620 transition count 1563
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 2273 place count 600 transition count 1523
Iterating global reduction 8 with 20 rules applied. Total rules applied 2293 place count 600 transition count 1523
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 2313 place count 580 transition count 1259
Iterating global reduction 8 with 20 rules applied. Total rules applied 2333 place count 580 transition count 1259
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 2353 place count 580 transition count 1239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2354 place count 579 transition count 1238
Applied a total of 2354 rules in 423 ms. Remains 579 /2183 variables (removed 1604) and now considering 1238/3989 (removed 2751) transitions.
[2025-05-31 07:34:25] [INFO ] Flow matrix only has 1210 transitions (discarded 28 similar events)
// Phase 1: matrix 1210 rows 579 cols
[2025-05-31 07:34:25] [INFO ] Computed 184 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:34:26] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-05-31 07:34:26] [INFO ] Flow matrix only has 1210 transitions (discarded 28 similar events)
[2025-05-31 07:34:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:34:26] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-05-31 07:34:26] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:34:26] [INFO ] Redundant transitions in 52 ms returned []
Running 1169 sub problems to find dead transitions.
[2025-05-31 07:34:26] [INFO ] Flow matrix only has 1210 transitions (discarded 28 similar events)
[2025-05-31 07:34:26] [INFO ] Invariant cache hit.
[2025-05-31 07:34:26] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 2 (OVERLAPS) 2/579 variables, 171/184 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1789 variables, and 184 constraints, problems are : Problem set: 0 solved, 1169 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/579 constraints, ReadFeed: 0/66 constraints, PredecessorRefiner: 1169/1169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 2 (OVERLAPS) 2/579 variables, 171/184 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 1)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 1)
(s359 0)
(s360 0)
(s361 1)
(s362 0)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 1)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 0)
(s385 1)
(s386 0)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 0)
(s409 1)
(s410 0)
(s411 0)
(s412 1)
(s413 0)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 1)
(s422 0)
(s423 0)
(s424 1)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 1)
(s431 0)
(s432 0)
(s433 1)
(s434 0)
(s435 0)
(s436 1)
(s437 0)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 1)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 1)
(s449 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/1789 variables, and 184 constraints, problems are : Problem set: 0 solved, 1169 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/579 constraints, ReadFeed: 0/66 constraints, PredecessorRefiner: 0/1169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60860ms problems are : Problem set: 0 solved, 1169 unsolved
Search for dead transitions found 0 dead transitions in 60862ms
Starting structural reductions in SI_LTL mode, iteration 1 : 579/2183 places, 1238/3989 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62244 ms. Remains : 579/2183 places, 1238/3989 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-09b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-10 finished in 62343 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(F((G(F(p0))||(!p1&&F(p0)))))||(X(X(!p1))&&F((G(F(p0))||(!p1&&F(p0))))))) U p0))'
Support contains 3 out of 2183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2176 transition count 3982
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2176 transition count 3982
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 2173 transition count 3979
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 2173 transition count 3979
Applied a total of 20 rules in 279 ms. Remains 2173 /2183 variables (removed 10) and now considering 3979/3989 (removed 10) transitions.
// Phase 1: matrix 3979 rows 2173 cols
[2025-05-31 07:35:28] [INFO ] Computed 184 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:35:29] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2025-05-31 07:35:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:35:31] [INFO ] Implicit Places using invariants and state equation in 2756 ms returned []
Implicit Place search using SMT with State Equation took 3912 ms to find 0 implicit places.
Running 3978 sub problems to find dead transitions.
[2025-05-31 07:35:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2172/6152 variables, and 0 constraints, problems are : Problem set: 0 solved, 3978 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2173 constraints, PredecessorRefiner: 3978/3978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3978 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2172/6152 variables, and 0 constraints, problems are : Problem set: 0 solved, 3978 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2173 constraints, PredecessorRefiner: 0/3978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61706ms problems are : Problem set: 0 solved, 3978 unsolved
Search for dead transitions found 0 dead transitions in 61712ms
Starting structural reductions in LTL mode, iteration 1 : 2173/2183 places, 3979/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65916 ms. Remains : 2173/2183 places, 3979/3989 transitions.
Stuttering acceptance computed with spot in 338 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-11
Product exploration explored 100000 steps with 25038 reset in 451 ms.
Product exploration explored 100000 steps with 25053 reset in 460 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 146 ms. Reduced automaton from 8 states, 17 edges and 2 AP (stutter sensitive) to 8 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 36415 steps (7 resets) in 290 ms. (125 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 245 ms. Reduced automaton from 8 states, 17 edges and 2 AP (stutter sensitive) to 8 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2025-05-31 07:36:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:36:40] [INFO ] [Real]Absence check using 184 positive place invariants in 2263 ms returned sat
[2025-05-31 07:36:51] [INFO ] [Real]Absence check using state equation in 11243 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 2173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2173/2173 places, 3979/3979 transitions.
Applied a total of 0 rules in 89 ms. Remains 2173 /2173 variables (removed 0) and now considering 3979/3979 (removed 0) transitions.
[2025-05-31 07:36:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:36:52] [INFO ] Implicit Places using invariants in 1233 ms returned []
[2025-05-31 07:36:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:36:55] [INFO ] Implicit Places using invariants and state equation in 2814 ms returned []
Implicit Place search using SMT with State Equation took 4049 ms to find 0 implicit places.
Running 3978 sub problems to find dead transitions.
[2025-05-31 07:36:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2172/6152 variables, and 0 constraints, problems are : Problem set: 0 solved, 3978 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2173 constraints, PredecessorRefiner: 3978/3978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3978 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2172/6152 variables, and 0 constraints, problems are : Problem set: 0 solved, 3978 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2173 constraints, PredecessorRefiner: 0/3978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61754ms problems are : Problem set: 0 solved, 3978 unsolved
Search for dead transitions found 0 dead transitions in 61760ms
Finished structural reductions in LTL mode , in 1 iterations and 65910 ms. Remains : 2173/2173 places, 3979/3979 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 8 states, 17 edges and 2 AP (stutter sensitive) to 8 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 360 ms. (110 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 245 ms. Reduced automaton from 8 states, 17 edges and 2 AP (stutter sensitive) to 8 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 321 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2025-05-31 07:37:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:38:03] [INFO ] [Real]Absence check using 184 positive place invariants in 2253 ms returned sat
[2025-05-31 07:38:14] [INFO ] [Real]Absence check using state equation in 11197 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 356 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 25082 reset in 445 ms.
Product exploration explored 100000 steps with 24994 reset in 439 ms.
Applying partial POR strategy [false, true, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 366 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 2173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2173/2173 places, 3979/3979 transitions.
Graph (trivial) has 1912 edges and 2173 vertex of which 530 / 2173 are part of one of the 44 SCC in 1 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Performed 332 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1687 transition count 3455
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 28 rules applied. Total rules applied 361 place count 1687 transition count 3441
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 361 place count 1687 transition count 3445
Deduced a syphon composed of 354 places in 14 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 369 place count 1687 transition count 3445
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 522 place count 1534 transition count 2788
Deduced a syphon composed of 268 places in 11 ms
Iterating global reduction 2 with 153 rules applied. Total rules applied 675 place count 1534 transition count 2788
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 679 place count 1534 transition count 2784
Performed 581 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 849 places in 0 ms
Iterating global reduction 3 with 581 rules applied. Total rules applied 1260 place count 1534 transition count 2794
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1270 place count 1534 transition count 2784
Renaming transitions due to excessive name length > 1024 char.
Discarding 421 places :
Symmetric choice reduction at 4 with 421 rule applications. Total rules 1691 place count 1113 transition count 2087
Deduced a syphon composed of 452 places in 1 ms
Iterating global reduction 4 with 421 rules applied. Total rules applied 2112 place count 1113 transition count 2087
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2136 place count 1113 transition count 2063
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2146 place count 1103 transition count 2053
Deduced a syphon composed of 442 places in 0 ms
Iterating global reduction 5 with 10 rules applied. Total rules applied 2156 place count 1103 transition count 2053
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -200
Deduced a syphon composed of 473 places in 1 ms
Iterating global reduction 5 with 31 rules applied. Total rules applied 2187 place count 1103 transition count 2253
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 2205 place count 1103 transition count 2235
Discarding 44 places :
Symmetric choice reduction at 6 with 44 rule applications. Total rules 2249 place count 1059 transition count 2083
Deduced a syphon composed of 432 places in 0 ms
Iterating global reduction 6 with 44 rules applied. Total rules applied 2293 place count 1059 transition count 2083
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2299 place count 1059 transition count 2077
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2305 place count 1053 transition count 2065
Deduced a syphon composed of 426 places in 1 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 2311 place count 1053 transition count 2065
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 430 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2315 place count 1053 transition count 2115
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2319 place count 1049 transition count 2106
Deduced a syphon composed of 426 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2323 place count 1049 transition count 2106
Deduced a syphon composed of 426 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 7 with 42 rules applied. Total rules applied 2365 place count 1049 transition count 2064
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 2384 place count 1030 transition count 2026
Deduced a syphon composed of 426 places in 1 ms
Iterating global reduction 7 with 19 rules applied. Total rules applied 2403 place count 1030 transition count 2026
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 2422 place count 1011 transition count 1773
Deduced a syphon composed of 426 places in 1 ms
Iterating global reduction 7 with 19 rules applied. Total rules applied 2441 place count 1011 transition count 1773
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 2470 place count 1011 transition count 1744
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2489 place count 992 transition count 1715
Deduced a syphon composed of 407 places in 0 ms
Iterating global reduction 8 with 19 rules applied. Total rules applied 2508 place count 992 transition count 1715
Deduced a syphon composed of 407 places in 0 ms
Applied a total of 2508 rules in 1116 ms. Remains 992 /2173 variables (removed 1181) and now considering 1715/3979 (removed 2264) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:38:17] [INFO ] Redundant transitions in 34 ms returned []
Running 1714 sub problems to find dead transitions.
[2025-05-31 07:38:17] [INFO ] Flow matrix only has 1687 transitions (discarded 28 similar events)
// Phase 1: matrix 1687 rows 992 cols
[2025-05-31 07:38:17] [INFO ] Computed 184 invariants in 48 ms
[2025-05-31 07:38:17] [INFO ] State equation strengthened by 216 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 991/2679 variables, and 0 constraints, problems are : Problem set: 0 solved, 1714 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/992 constraints, ReadFeed: 0/216 constraints, PredecessorRefiner: 1714/1384 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1714 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 991/2679 variables, and 0 constraints, problems are : Problem set: 0 solved, 1714 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/992 constraints, ReadFeed: 0/216 constraints, PredecessorRefiner: 330/1384 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61064ms problems are : Problem set: 0 solved, 1714 unsolved
Search for dead transitions found 0 dead transitions in 61068ms
Starting structural reductions in SI_LTL mode, iteration 1 : 992/2173 places, 1715/3979 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62227 ms. Remains : 992/2173 places, 1715/3979 transitions.
Built C files in :
/tmp/ltsmin9002464111006057663
[2025-05-31 07:39:18] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9002464111006057663
Running compilation step : cd /tmp/ltsmin9002464111006057663;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9002464111006057663;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9002464111006057663;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 2173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2173/2173 places, 3979/3979 transitions.
Applied a total of 0 rules in 84 ms. Remains 2173 /2173 variables (removed 0) and now considering 3979/3979 (removed 0) transitions.
// Phase 1: matrix 3979 rows 2173 cols
[2025-05-31 07:39:21] [INFO ] Computed 184 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:39:22] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2025-05-31 07:39:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:39:25] [INFO ] Implicit Places using invariants and state equation in 2648 ms returned []
Implicit Place search using SMT with State Equation took 3838 ms to find 0 implicit places.
Running 3978 sub problems to find dead transitions.
[2025-05-31 07:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2172/6152 variables, and 0 constraints, problems are : Problem set: 0 solved, 3978 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2173 constraints, PredecessorRefiner: 3978/3978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3978 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(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 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(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 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 timeout
1)
(s637 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2172/6152 variables, and 0 constraints, problems are : Problem set: 0 solved, 3978 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2173 constraints, PredecessorRefiner: 0/3978 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61612ms problems are : Problem set: 0 solved, 3978 unsolved
Search for dead transitions found 0 dead transitions in 61618ms
Finished structural reductions in LTL mode , in 1 iterations and 65555 ms. Remains : 2173/2173 places, 3979/3979 transitions.
Built C files in :
/tmp/ltsmin10813388548932240334
[2025-05-31 07:40:26] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10813388548932240334
Running compilation step : cd /tmp/ltsmin10813388548932240334;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10813388548932240334;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10813388548932240334;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 07:40:30] [INFO ] Flatten gal took : 79 ms
[2025-05-31 07:40:30] [INFO ] Flatten gal took : 71 ms
[2025-05-31 07:40:30] [INFO ] Time to serialize gal into /tmp/LTL1112195339253334941.gal : 15 ms
[2025-05-31 07:40:30] [INFO ] Time to serialize properties into /tmp/LTL8825722438265603777.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/LTL1112195339253334941.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15261519841487774255.hoa' '-atoms' '/tmp/LTL8825722438265603777.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/LTL8825722438265603777.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15261519841487774255.hoa
Detected timeout of ITS tools.
[2025-05-31 07:40:45] [INFO ] Flatten gal took : 74 ms
[2025-05-31 07:40:45] [INFO ] Flatten gal took : 73 ms
[2025-05-31 07:40:45] [INFO ] Time to serialize gal into /tmp/LTL6551508359473775950.gal : 13 ms
[2025-05-31 07:40:45] [INFO ] Time to serialize properties into /tmp/LTL13548295874226048228.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/LTL6551508359473775950.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13548295874226048228.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 : !(((F((G(F((G(F("(p332==1)")))||((!("((p1202==1)&&(p2351==1))"))&&(F("(p332==1)"))))))||((F((G(F("(p332==1)")))||((!("((p1202==1)&&(p2...245
Formula 0 simplified : G(FG!"(p332==1)" & (G(FG!"(p332==1)" & ("((p1202==1)&&(p2351==1))" | G!"(p332==1)")) | XX"((p1202==1)&&(p2351==1))")) R !"(p332==1)"
Detected timeout of ITS tools.
[2025-05-31 07:41:00] [INFO ] Flatten gal took : 71 ms
[2025-05-31 07:41:00] [INFO ] Applying decomposition
[2025-05-31 07:41:00] [INFO ] Flatten gal took : 74 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/graph9242256056650293468.txt' '-o' '/tmp/graph9242256056650293468.bin' '-w' '/tmp/graph9242256056650293468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9242256056650293468.bin' '-l' '-1' '-v' '-w' '/tmp/graph9242256056650293468.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:41:00] [INFO ] Decomposing Gal with order
[2025-05-31 07:41:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:41:01] [INFO ] Removed a total of 3805 redundant transitions.
[2025-05-31 07:41:01] [INFO ] Flatten gal took : 177 ms
[2025-05-31 07:41:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 72 ms.
[2025-05-31 07:41:01] [INFO ] Time to serialize gal into /tmp/LTL16374245541068992989.gal : 29 ms
[2025-05-31 07:41:01] [INFO ] Time to serialize properties into /tmp/LTL16191165573659066838.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/LTL16374245541068992989.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16191165573659066838.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((F((G(F((G(F("(i3.u69.p332==1)")))||((!("((i13.i1.i2.u296.p1202==1)&&(i13.i1.i9.u588.p2351==1))"))&&(F("(i3.u69.p332==1)"))))))||((...370
Formula 0 simplified : G(FG!"(i3.u69.p332==1)" & (G(FG!"(i3.u69.p332==1)" & ("((i13.i1.i2.u296.p1202==1)&&(i13.i1.i9.u588.p2351==1))" | G!"(i3.u69.p332==1)...243
Detected timeout of ITS tools.
Treatment of property DLCround-PT-09b-LTLFireability-11 finished in 348872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2175 transition count 3981
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2175 transition count 3981
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 2171 transition count 3977
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 2171 transition count 3977
Applied a total of 24 rules in 325 ms. Remains 2171 /2183 variables (removed 12) and now considering 3977/3989 (removed 12) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2025-05-31 07:41:16] [INFO ] Computed 184 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:41:18] [INFO ] Implicit Places using invariants in 1162 ms returned []
[2025-05-31 07:41:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:41:20] [INFO ] Implicit Places using invariants and state equation in 2529 ms returned []
Implicit Place search using SMT with State Equation took 3701 ms to find 0 implicit places.
Running 3976 sub problems to find dead transitions.
[2025-05-31 07:41:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.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 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.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 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 3976/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3976 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 0/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61636ms problems are : Problem set: 0 solved, 3976 unsolved
Search for dead transitions found 0 dead transitions in 61642ms
Starting structural reductions in LTL mode, iteration 1 : 2171/2183 places, 3977/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65675 ms. Remains : 2171/2183 places, 3977/3989 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-13
Product exploration explored 100000 steps with 11 reset in 555 ms.
Product exploration explored 100000 steps with 9 reset in 656 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24730 steps (4 resets) in 147 ms. (167 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2025-05-31 07:42:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:42:26] [INFO ] [Real]Absence check using 184 positive place invariants in 747 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-09b-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-09b-LTLFireability-13 finished in 70001 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((G((!(!p1 U X(p1))||p0))||X(X(p2))))))'
Support contains 6 out of 2183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2175 transition count 3981
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2175 transition count 3981
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 2171 transition count 3977
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 2171 transition count 3977
Applied a total of 24 rules in 277 ms. Remains 2171 /2183 variables (removed 12) and now considering 3977/3989 (removed 12) transitions.
[2025-05-31 07:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:42:27] [INFO ] Implicit Places using invariants in 1149 ms returned []
[2025-05-31 07:42:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:42:30] [INFO ] Implicit Places using invariants and state equation in 2585 ms returned []
Implicit Place search using SMT with State Equation took 3737 ms to find 0 implicit places.
Running 3976 sub problems to find dead transitions.
[2025-05-31 07:42:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.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 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.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 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.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 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 timeout
1.0)
(s895 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 3976/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3976 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 0/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61650ms problems are : Problem set: 0 solved, 3976 unsolved
Search for dead transitions found 0 dead transitions in 61656ms
Starting structural reductions in LTL mode, iteration 1 : 2171/2183 places, 3977/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65679 ms. Remains : 2171/2183 places, 3977/3989 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 621 ms.
Product exploration explored 100000 steps with 0 reset in 751 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 132 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 361 ms. (110 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
[2025-05-31 07:43: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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 302/308 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1863/2171 variables, 179/184 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2171 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3977/6148 variables, 2171/2355 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6148 variables, 0/2355 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/6148 variables, 0/2355 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6148/6148 variables, and 2355 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2160 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2171/2171 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 302/308 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1863/2171 variables, 179/184 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2171 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3977/6148 variables, 2171/2355 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6148 variables, 6/2361 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6148 variables, 0/2361 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/6148 variables, 0/2361 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
After SMT solving in domain Int declared 6148/6148 variables, and 2361 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2171/2171 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7192ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 48216 steps, including 57 resets, run visited all 1 properties in 207 ms. (steps per millisecond=232 )
Parikh walk visited 6 properties in 1035 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 33 factoid took 659 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 6 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 89 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2025-05-31 07:43:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:43:44] [INFO ] Implicit Places using invariants in 1163 ms returned []
[2025-05-31 07:43:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:43:47] [INFO ] Implicit Places using invariants and state equation in 2560 ms returned []
Implicit Place search using SMT with State Equation took 3725 ms to find 0 implicit places.
Running 3976 sub problems to find dead transitions.
[2025-05-31 07:43:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 3976/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3976 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 0/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61625ms problems are : Problem set: 0 solved, 3976 unsolved
Search for dead transitions found 0 dead transitions in 61633ms
Finished structural reductions in LTL mode , in 1 iterations and 65456 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 149 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 349 ms. (114 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 7/7 properties
[2025-05-31 07:44:49] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 302/308 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1863/2171 variables, 179/184 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2171 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3977/6148 variables, 2171/2355 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6148 variables, 0/2355 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/6148 variables, 0/2355 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6148/6148 variables, and 2355 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2171/2171 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 302/308 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1863/2171 variables, 179/184 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2171 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3977/6148 variables, 2171/2355 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6148 variables, 6/2361 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6148 variables, 0/2361 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/6148 variables, 0/2361 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6148/6148 variables, and 2361 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2171/2171 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7010ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 829 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=103 )
Parikh walk visited 6 properties in 1759 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p1))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR p2 p0))), (F p1), (F (NOT (OR p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (AND p2 p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 32 factoid took 671 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 123 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 581 ms.
Product exploration explored 100000 steps with 0 reset in 700 ms.
Built C files in :
/tmp/ltsmin14237572682437349991
[2025-05-31 07:45:01] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14237572682437349991
Running compilation step : cd /tmp/ltsmin14237572682437349991;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14237572682437349991;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14237572682437349991;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 87 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2025-05-31 07:45:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:45:05] [INFO ] Implicit Places using invariants in 1202 ms returned []
[2025-05-31 07:45:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:45:07] [INFO ] Implicit Places using invariants and state equation in 2630 ms returned []
Implicit Place search using SMT with State Equation took 3834 ms to find 0 implicit places.
Running 3976 sub problems to find dead transitions.
[2025-05-31 07:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.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 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.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 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.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 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 timeout
1.0)
(s525 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 3976/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3976 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 0/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61582ms problems are : Problem set: 0 solved, 3976 unsolved
Search for dead transitions found 0 dead transitions in 61588ms
Finished structural reductions in LTL mode , in 1 iterations and 65520 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Built C files in :
/tmp/ltsmin2140602834058218538
[2025-05-31 07:46:09] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2140602834058218538
Running compilation step : cd /tmp/ltsmin2140602834058218538;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2140602834058218538;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2140602834058218538;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 07:46:12] [INFO ] Flatten gal took : 87 ms
[2025-05-31 07:46:12] [INFO ] Flatten gal took : 70 ms
[2025-05-31 07:46:12] [INFO ] Time to serialize gal into /tmp/LTL10189161949730664280.gal : 14 ms
[2025-05-31 07:46:12] [INFO ] Time to serialize properties into /tmp/LTL4600399398779872918.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/LTL10189161949730664280.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2355676344157261168.hoa' '-atoms' '/tmp/LTL4600399398779872918.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/LTL4600399398779872918.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2355676344157261168.hoa
Detected timeout of ITS tools.
[2025-05-31 07:46:28] [INFO ] Flatten gal took : 70 ms
[2025-05-31 07:46:28] [INFO ] Flatten gal took : 72 ms
[2025-05-31 07:46:28] [INFO ] Time to serialize gal into /tmp/LTL8212667954131084241.gal : 14 ms
[2025-05-31 07:46:28] [INFO ] Time to serialize properties into /tmp/LTL14650621578909536467.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/LTL8212667954131084241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14650621578909536467.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 : !((F(G((G(((!((!("((p167==1)&&(p1988==1))"))U(X("((p167==1)&&(p1988==1))"))))||("(p1202==0)"))||("(p3181==0)")))||(X(X("((p141==0)||(p...172
Formula 0 simplified : G(F(!"(p1202==0)" & !"(p3181==0)" & (!"((p167==1)&&(p1988==1))" U X"((p167==1)&&(p1988==1))")) & F!"((p141==0)||(p2061==0))")
Detected timeout of ITS tools.
[2025-05-31 07:46:43] [INFO ] Flatten gal took : 66 ms
[2025-05-31 07:46:43] [INFO ] Applying decomposition
[2025-05-31 07:46:43] [INFO ] Flatten gal took : 66 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/graph9500763609049752550.txt' '-o' '/tmp/graph9500763609049752550.bin' '-w' '/tmp/graph9500763609049752550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9500763609049752550.bin' '-l' '-1' '-v' '-w' '/tmp/graph9500763609049752550.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:46:43] [INFO ] Decomposing Gal with order
[2025-05-31 07:46:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:46:43] [INFO ] Removed a total of 3820 redundant transitions.
[2025-05-31 07:46:43] [INFO ] Flatten gal took : 125 ms
[2025-05-31 07:46:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 17 ms.
[2025-05-31 07:46:43] [INFO ] Time to serialize gal into /tmp/LTL15678736588743110930.gal : 23 ms
[2025-05-31 07:46:43] [INFO ] Time to serialize properties into /tmp/LTL4469487616202079908.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/LTL15678736588743110930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4469487616202079908.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 : !((F(G((G(((!((!("((i1.i0.i1.u36.p167==1)&&(i8.u518.p1988==1))"))U(X("((i1.i0.i1.u36.p167==1)&&(i8.u518.p1988==1))"))))||("(i12.u298.p...253
Formula 0 simplified : G(F(!"(i12.u298.p1202==0)" & !"(i12.u743.p3181==0)" & (!"((i1.i0.i1.u36.p167==1)&&(i8.u518.p1988==1))" U X"((i1.i0.i1.u36.p167==1)&&...229
Detected timeout of ITS tools.
Treatment of property DLCround-PT-09b-LTLFireability-14 finished in 272452 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(p0)||X(F(p1))))'
Support contains 3 out of 2183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2175 transition count 3981
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2175 transition count 3981
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 2171 transition count 3977
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 2171 transition count 3977
Applied a total of 24 rules in 280 ms. Remains 2171 /2183 variables (removed 12) and now considering 3977/3989 (removed 12) transitions.
[2025-05-31 07:46:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:47:00] [INFO ] Implicit Places using invariants in 1136 ms returned []
[2025-05-31 07:47:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:47:02] [INFO ] Implicit Places using invariants and state equation in 2549 ms returned []
Implicit Place search using SMT with State Equation took 3689 ms to find 0 implicit places.
Running 3976 sub problems to find dead transitions.
[2025-05-31 07:47:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.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 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.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 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.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 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 3976/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3976 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2170/6148 variables, and 0 constraints, problems are : Problem set: 0 solved, 3976 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/184 constraints, State Equation: 0/2171 constraints, PredecessorRefiner: 0/3976 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61581ms problems are : Problem set: 0 solved, 3976 unsolved
Search for dead transitions found 0 dead transitions in 61587ms
Starting structural reductions in LTL mode, iteration 1 : 2171/2183 places, 3977/3989 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65563 ms. Remains : 2171/2183 places, 3977/3989 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-15
Product exploration explored 100000 steps with 10 reset in 531 ms.
Product exploration explored 100000 steps with 7 reset in 645 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 291 ms. (136 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2025-05-31 07:48:06] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 171/174 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1997/2171 variables, 181/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2171 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3977/6148 variables, 2171/2355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6148 variables, 0/2355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6148 variables, 0/2355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6148/6148 variables, and 2355 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1258 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2171/2171 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 171/174 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1997/2171 variables, 181/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2171 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3977/6148 variables, 2171/2355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6148 variables, 1/2356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6148 variables, 0/2356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/6148 variables, 0/2356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6148/6148 variables, and 2356 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 2171/2171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2994ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 455 ms.
Support contains 3 out of 2171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1909 edges and 2171 vertex of which 524 / 2171 are part of one of the 43 SCC in 1 ms
Free SCC test removed 481 places
Drop transitions (Empty/Sink Transition effects.) removed 548 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 562 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 334 place count 1690 transition count 3082
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 375 rules applied. Total rules applied 709 place count 1357 transition count 3040
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 737 place count 1329 transition count 3040
Performed 183 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 183 Pre rules applied. Total rules applied 737 place count 1329 transition count 2857
Deduced a syphon composed of 183 places in 12 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 1103 place count 1146 transition count 2857
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 1169 place count 1080 transition count 2299
Iterating global reduction 3 with 66 rules applied. Total rules applied 1235 place count 1080 transition count 2299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1239 place count 1080 transition count 2295
Performed 415 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 415 places in 0 ms
Reduce places removed 415 places and 0 transitions.
Iterating global reduction 4 with 830 rules applied. Total rules applied 2069 place count 665 transition count 1870
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2079 place count 665 transition count 1860
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 2104 place count 640 transition count 1547
Iterating global reduction 5 with 25 rules applied. Total rules applied 2129 place count 640 transition count 1547
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2153 place count 640 transition count 1523
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 2235 place count 599 transition count 1953
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2252 place count 599 transition count 1936
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 2274 place count 577 transition count 1383
Iterating global reduction 7 with 22 rules applied. Total rules applied 2296 place count 577 transition count 1383
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 2318 place count 577 transition count 1361
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2326 place count 573 transition count 1394
Drop transitions (Redundant composition of simpler transitions.) removed 151 transitions
Redundant transition composition rules discarded 151 transitions
Iterating global reduction 8 with 151 rules applied. Total rules applied 2477 place count 573 transition count 1243
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 2487 place count 563 transition count 1112
Iterating global reduction 8 with 10 rules applied. Total rules applied 2497 place count 563 transition count 1112
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 2507 place count 563 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2515 place count 559 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2520 place count 559 transition count 1124
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 2542 place count 559 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2550 place count 555 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2556 place count 555 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 2577 place count 555 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2585 place count 551 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2591 place count 551 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 2612 place count 551 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2620 place count 547 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 2626 place count 547 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 2647 place count 547 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2655 place count 543 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2661 place count 543 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 2682 place count 543 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2690 place count 539 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2696 place count 539 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 2717 place count 539 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2725 place count 535 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2731 place count 535 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 2752 place count 535 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2760 place count 531 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2766 place count 531 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 2787 place count 531 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2795 place count 527 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2801 place count 527 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 2822 place count 527 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2830 place count 523 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2836 place count 523 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2857 place count 523 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2865 place count 519 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2871 place count 519 transition count 1123
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2892 place count 519 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2900 place count 515 transition count 1133
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2906 place count 515 transition count 1127
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2927 place count 515 transition count 1106
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2935 place count 511 transition count 1137
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2941 place count 511 transition count 1131
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2962 place count 511 transition count 1110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2970 place count 507 transition count 1137
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2976 place count 507 transition count 1131
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 2997 place count 507 transition count 1110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 3005 place count 503 transition count 1137
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 3011 place count 503 transition count 1131
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 3032 place count 503 transition count 1110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 3040 place count 499 transition count 1137
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 3046 place count 499 transition count 1131
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 25 with 21 rules applied. Total rules applied 3067 place count 499 transition count 1110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 3075 place count 495 transition count 1137
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 3081 place count 495 transition count 1131
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 26 with 21 rules applied. Total rules applied 3102 place count 495 transition count 1110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 3110 place count 491 transition count 1141
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 3116 place count 491 transition count 1135
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 27 with 21 rules applied. Total rules applied 3137 place count 491 transition count 1114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 3145 place count 487 transition count 1145
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 27 with 6 rules applied. Total rules applied 3151 place count 487 transition count 1139
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 28 with 21 rules applied. Total rules applied 3172 place count 487 transition count 1118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 3180 place count 483 transition count 1137
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 3184 place count 483 transition count 1133
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 3203 place count 483 transition count 1114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 3211 place count 479 transition count 1133
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 3215 place count 479 transition count 1129
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 3234 place count 479 transition count 1110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 3242 place count 475 transition count 1129
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 3246 place count 475 transition count 1125
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 3265 place count 475 transition count 1106
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 3273 place count 471 transition count 1125
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 3277 place count 471 transition count 1121
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 3296 place count 471 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 3304 place count 467 transition count 1121
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 3308 place count 467 transition count 1117
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 3327 place count 467 transition count 1098
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 3335 place count 463 transition count 1117
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 3339 place count 463 transition count 1113
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 3358 place count 463 transition count 1094
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 3366 place count 459 transition count 1113
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 3370 place count 459 transition count 1109
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 3389 place count 459 transition count 1090
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 3397 place count 455 transition count 1109
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 3401 place count 455 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 36 with 19 rules applied. Total rules applied 3420 place count 455 transition count 1086
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 3428 place count 451 transition count 1105
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 3432 place count 451 transition count 1101
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 3451 place count 451 transition count 1082
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 37 with 8 rules applied. Total rules applied 3459 place count 447 transition count 1101
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 3463 place count 447 transition count 1097
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 38 with 19 rules applied. Total rules applied 3482 place count 447 transition count 1078
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 38 with 8 rules applied. Total rules applied 3490 place count 443 transition count 1097
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 3494 place count 443 transition count 1093
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 39 with 19 rules applied. Total rules applied 3513 place count 443 transition count 1074
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 39 with 8 rules applied. Total rules applied 3521 place count 439 transition count 1093
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3525 place count 439 transition count 1089
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 40 with 19 rules applied. Total rules applied 3544 place count 439 transition count 1070
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 40 with 8 rules applied. Total rules applied 3552 place count 435 transition count 1089
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 3556 place count 435 transition count 1085
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 41 with 19 rules applied. Total rules applied 3575 place count 435 transition count 1066
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 41 with 8 rules applied. Total rules applied 3583 place count 431 transition count 1089
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 41 with 4 rules applied. Total rules applied 3587 place count 431 transition count 1085
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 42 with 19 rules applied. Total rules applied 3606 place count 431 transition count 1066
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 42 with 8 rules applied. Total rules applied 3614 place count 427 transition count 1093
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 42 with 4 rules applied. Total rules applied 3618 place count 427 transition count 1089
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 43 with 19 rules applied. Total rules applied 3637 place count 427 transition count 1070
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 43 with 8 rules applied. Total rules applied 3645 place count 423 transition count 1095
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 43 with 4 rules applied. Total rules applied 3649 place count 423 transition count 1091
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 44 with 19 rules applied. Total rules applied 3668 place count 423 transition count 1072
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 44 with 8 rules applied. Total rules applied 3676 place count 419 transition count 1091
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 44 with 4 rules applied. Total rules applied 3680 place count 419 transition count 1087
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 45 with 19 rules applied. Total rules applied 3699 place count 419 transition count 1068
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 45 with 8 rules applied. Total rules applied 3707 place count 415 transition count 1087
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 45 with 4 rules applied. Total rules applied 3711 place count 415 transition count 1083
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 46 with 19 rules applied. Total rules applied 3730 place count 415 transition count 1064
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 46 with 8 rules applied. Total rules applied 3738 place count 411 transition count 1083
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 3742 place count 411 transition count 1079
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 47 with 19 rules applied. Total rules applied 3761 place count 411 transition count 1060
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 8 rules applied. Total rules applied 3769 place count 407 transition count 1079
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 47 with 4 rules applied. Total rules applied 3773 place count 407 transition count 1075
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 48 with 19 rules applied. Total rules applied 3792 place count 407 transition count 1056
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 48 with 8 rules applied. Total rules applied 3800 place count 403 transition count 1081
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 3804 place count 403 transition count 1077
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 49 with 19 rules applied. Total rules applied 3823 place count 403 transition count 1058
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 49 with 8 rules applied. Total rules applied 3831 place count 399 transition count 1085
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 49 with 4 rules applied. Total rules applied 3835 place count 399 transition count 1081
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 50 with 19 rules applied. Total rules applied 3854 place count 399 transition count 1062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 50 with 2 rules applied. Total rules applied 3856 place count 398 transition count 1066
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 50 with 1 rules applied. Total rules applied 3857 place count 398 transition count 1065
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 51 with 2 rules applied. Total rules applied 3859 place count 398 transition count 1063
Free-agglomeration rule applied 35 times with reduction of 1 identical transitions.
Iterating global reduction 51 with 35 rules applied. Total rules applied 3894 place count 398 transition count 1027
Reduce places removed 35 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 392 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 405 transitions.
Graph (complete) has 1038 edges and 363 vertex of which 219 are kept as prefixes of interest. Removing 144 places using SCC suffix rule.0 ms
Discarding 144 places :
Also discarding 0 output transitions
Iterating post reduction 51 with 441 rules applied. Total rules applied 4335 place count 219 transition count 622
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 52 with 144 rules applied. Total rules applied 4479 place count 219 transition count 478
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 53 with 53 rules applied. Total rules applied 4532 place count 219 transition count 425
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 53 with 1 rules applied. Total rules applied 4533 place count 218 transition count 424
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 53 with 8 rules applied. Total rules applied 4541 place count 210 transition count 424
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 54 with 96 rules applied. Total rules applied 4637 place count 146 transition count 392
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 54 with 92 rules applied. Total rules applied 4729 place count 146 transition count 300
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 55 with 141 rules applied. Total rules applied 4870 place count 52 transition count 253
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 141 transitions.
Graph (trivial) has 11 edges and 52 vertex of which 10 / 52 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 55 with 142 rules applied. Total rules applied 5012 place count 47 transition count 112
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 82 edges and 43 vertex of which 27 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Iterating post reduction 56 with 52 rules applied. Total rules applied 5064 place count 27 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 57 with 8 rules applied. Total rules applied 5072 place count 27 transition count 49
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 58 with 24 rules applied. Total rules applied 5096 place count 11 transition count 41
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 58 with 24 rules applied. Total rules applied 5120 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 59 with 4 rules applied. Total rules applied 5124 place count 11 transition count 13
Graph (complete) has 20 edges and 11 vertex of which 9 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 59 with 1 rules applied. Total rules applied 5125 place count 9 transition count 13
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 60 with 2 rules applied. Total rules applied 5127 place count 9 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 61 with 1 rules applied. Total rules applied 5128 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 61 with 1 rules applied. Total rules applied 5129 place count 8 transition count 10
Applied a total of 5129 rules in 1664 ms. Remains 8 /2171 variables (removed 2163) and now considering 10/3977 (removed 3967) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1664 ms. Remains : 8/2171 places, 10/3977 transitions.
RANDOM walk for 64 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 297 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1909 edges and 2171 vertex of which 524 / 2171 are part of one of the 43 SCC in 0 ms
Free SCC test removed 481 places
Ensure Unique test removed 519 transitions
Reduce isomorphic transitions removed 519 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 334 place count 1689 transition count 3124
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 375 rules applied. Total rules applied 709 place count 1356 transition count 3082
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 737 place count 1328 transition count 3082
Performed 183 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 183 Pre rules applied. Total rules applied 737 place count 1328 transition count 2899
Deduced a syphon composed of 183 places in 11 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 1103 place count 1145 transition count 2899
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 1169 place count 1079 transition count 2341
Iterating global reduction 3 with 66 rules applied. Total rules applied 1235 place count 1079 transition count 2341
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1239 place count 1079 transition count 2337
Performed 413 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 413 places in 0 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 4 with 826 rules applied. Total rules applied 2065 place count 666 transition count 1914
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2075 place count 666 transition count 1904
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 2100 place count 641 transition count 1591
Iterating global reduction 5 with 25 rules applied. Total rules applied 2125 place count 641 transition count 1591
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2149 place count 641 transition count 1567
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 2175 place count 628 transition count 1686
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2179 place count 628 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2183 place count 624 transition count 1598
Iterating global reduction 7 with 4 rules applied. Total rules applied 2187 place count 624 transition count 1598
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2191 place count 624 transition count 1594
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2199 place count 620 transition count 1628
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2238 place count 620 transition count 1589
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2256 place count 602 transition count 1553
Iterating global reduction 8 with 18 rules applied. Total rules applied 2274 place count 602 transition count 1553
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2292 place count 584 transition count 1315
Iterating global reduction 8 with 18 rules applied. Total rules applied 2310 place count 584 transition count 1315
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2328 place count 584 transition count 1297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2329 place count 583 transition count 1296
Applied a total of 2329 rules in 317 ms. Remains 583 /2171 variables (removed 1588) and now considering 1296/3977 (removed 2681) transitions.
[2025-05-31 07:48:12] [INFO ] Flow matrix only has 1267 transitions (discarded 29 similar events)
// Phase 1: matrix 1267 rows 583 cols
[2025-05-31 07:48:12] [INFO ] Computed 184 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:48:12] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-31 07:48:12] [INFO ] Flow matrix only has 1267 transitions (discarded 29 similar events)
[2025-05-31 07:48:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:48:13] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-31 07:48:13] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:48:13] [INFO ] Redundant transitions in 22 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-05-31 07:48:13] [INFO ] Flow matrix only has 1267 transitions (discarded 29 similar events)
[2025-05-31 07:48:13] [INFO ] Invariant cache hit.
[2025-05-31 07:48:13] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/582 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 30839ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 30841ms
Starting structural reductions in SI_LTL mode, iteration 1 : 583/2171 places, 1296/3977 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32003 ms. Remains : 583/2171 places, 1296/3977 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 101 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 16552 steps (3 resets) in 207 ms. (79 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 316 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering criterion allowed to conclude after 1466 steps with 2 reset in 20 ms.
FORMULA DLCround-PT-09b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-15 finished in 106495 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((p0||X((F((p1 U (G(p1)||(p1&&G(p2)))))||(X(p3) U (p0&&X(p3))))))))'
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(F((G(F(p0))||(!p1&&F(p0)))))||(X(X(!p1))&&F((G(F(p0))||(!p1&&F(p0))))))) U p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((!(!p1 U X(p1))||p0))||X(X(p2))))))'
Found a Lengthening insensitive property : DLCround-PT-09b-LTLFireability-14
Stuttering acceptance computed with spot in 123 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 6 out of 2183 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2183/2183 places, 3989/3989 transitions.
Graph (trivial) has 1920 edges and 2183 vertex of which 530 / 2183 are part of one of the 44 SCC in 1 ms
Free SCC test removed 486 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 339 place count 1696 transition count 3126
Reduce places removed 338 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 380 rules applied. Total rules applied 719 place count 1358 transition count 3084
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 747 place count 1330 transition count 3084
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 180 Pre rules applied. Total rules applied 747 place count 1330 transition count 2904
Deduced a syphon composed of 180 places in 11 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 1107 place count 1150 transition count 2904
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 1174 place count 1083 transition count 2369
Iterating global reduction 3 with 67 rules applied. Total rules applied 1241 place count 1083 transition count 2369
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1245 place count 1083 transition count 2365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1245 place count 1083 transition count 2363
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1249 place count 1081 transition count 2363
Performed 414 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 414 places in 0 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 4 with 828 rules applied. Total rules applied 2077 place count 667 transition count 1939
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 2086 place count 667 transition count 1930
Renaming transitions due to excessive name length > 1024 char.
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 2112 place count 641 transition count 1601
Iterating global reduction 5 with 26 rules applied. Total rules applied 2138 place count 641 transition count 1601
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2162 place count 641 transition count 1577
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2186 place count 629 transition count 1691
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2189 place count 629 transition count 1688
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2192 place count 626 transition count 1624
Iterating global reduction 7 with 3 rules applied. Total rules applied 2195 place count 626 transition count 1624
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2198 place count 626 transition count 1621
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2204 place count 623 transition count 1646
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2208 place count 623 transition count 1642
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2209 place count 622 transition count 1641
Applied a total of 2209 rules in 326 ms. Remains 622 /2183 variables (removed 1561) and now considering 1641/3989 (removed 2348) transitions.
[2025-05-31 07:48:46] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
// Phase 1: matrix 1593 rows 622 cols
[2025-05-31 07:48:46] [INFO ] Computed 184 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:48:46] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-05-31 07:48:46] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2025-05-31 07:48:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:48:47] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-31 07:48:47] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2025-05-31 07:48:47] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2025-05-31 07:48:47] [INFO ] Invariant cache hit.
[2025-05-31 07:48:47] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2215 variables, and 14 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/184 constraints, State Equation: 0/622 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (OVERLAPS) 1/622 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/2215 variables, and 184 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/622 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60986ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 60988ms
Starting structural reductions in LI_LTL mode, iteration 1 : 622/2183 places, 1641/3989 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62297 ms. Remains : 622/2183 places, 1641/3989 transitions.
Running random walk in product with property : DLCround-PT-09b-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 950 ms.
Product exploration explored 100000 steps with 0 reset in 1147 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 118 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 584 ms. (68 steps per ms) remains 3/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
[2025-05-31 07:49:51] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2025-05-31 07:49:51] [INFO ] Invariant cache hit.
[2025-05-31 07:49:51] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 29/2215 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 5/184 constraints, State Equation: 0/622 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 33 factoid took 638 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Applied a total of 0 rules in 13 ms. Remains 622 /622 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
[2025-05-31 07:49:51] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2025-05-31 07:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:49:52] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-05-31 07:49:52] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2025-05-31 07:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:49:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-31 07:49:52] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2025-05-31 07:49:52] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2025-05-31 07:49:52] [INFO ] Invariant cache hit.
[2025-05-31 07:49:52] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2215 variables, and 14 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/184 constraints, State Equation: 0/622 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (OVERLAPS) 1/622 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/2215 variables, and 184 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/622 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61047ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 61050ms
Finished structural reductions in LTL mode , in 1 iterations and 61957 ms. Remains : 622/622 places, 1641/1641 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 132 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 769 ms. (51 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
[2025-05-31 07:50:54] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2025-05-31 07:50:54] [INFO ] Invariant cache hit.
[2025-05-31 07:50:54] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 23/29 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 497/526 variables, 167/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1472/1998 variables, 526/698 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1998 variables, 33/731 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1998 variables, 0/731 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 216/2214 variables, 96/827 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2214 variables, 12/839 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2214 variables, 22/861 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2214 variables, 0/861 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2214 variables, 0/861 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2214/2215 variables, and 861 constraints, problems are : Problem set: 1 solved, 1 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 622/622 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 500/526 variables, 168/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1472/1998 variables, 526/698 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1998 variables, 33/731 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1998 variables, 1/732 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1998 variables, 0/732 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 216/2214 variables, 96/828 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2214 variables, 12/840 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2214 variables, 22/862 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2214 variables, 0/862 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2214 variables, 0/862 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2214/2215 variables, and 862 constraints, problems are : Problem set: 1 solved, 1 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 622/622 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 935ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 117 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p1))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR p2 p0))), (F p1), (F (NOT (OR p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (AND p2 p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 32 factoid took 651 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 139 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 920 ms.
Product exploration explored 100000 steps with 0 reset in 1004 ms.
Built C files in :
/tmp/ltsmin5157139566419000646
[2025-05-31 07:50:58] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5157139566419000646
Running compilation step : cd /tmp/ltsmin5157139566419000646;'/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 2906 ms.
Running link step : cd /tmp/ltsmin5157139566419000646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin5157139566419000646;'/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/stateBased5932264305423819225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Applied a total of 0 rules in 17 ms. Remains 622 /622 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
[2025-05-31 07:51:13] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2025-05-31 07:51:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:51:13] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-05-31 07:51:13] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2025-05-31 07:51:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:51:14] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-31 07:51:14] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2025-05-31 07:51:14] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2025-05-31 07:51:14] [INFO ] Invariant cache hit.
[2025-05-31 07:51:14] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.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 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.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 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 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 621/2215 variables, and 14 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/184 constraints, State Equation: 0/622 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (OVERLAPS) 1/622 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/2215 variables, and 184 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 0/622 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61088ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 61090ms
Finished structural reductions in LTL mode , in 1 iterations and 62049 ms. Remains : 622/622 places, 1641/1641 transitions.
Built C files in :
/tmp/ltsmin2632583313156085054
[2025-05-31 07:52:15] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2632583313156085054
Running compilation step : cd /tmp/ltsmin2632583313156085054;'/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 2932 ms.
Running link step : cd /tmp/ltsmin2632583313156085054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2632583313156085054;'/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/stateBased7118775389327574030.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 07:52:31] [INFO ] Flatten gal took : 75 ms
[2025-05-31 07:52:31] [INFO ] Flatten gal took : 76 ms
[2025-05-31 07:52:31] [INFO ] Time to serialize gal into /tmp/LTL4202383788163382183.gal : 7 ms
[2025-05-31 07:52:31] [INFO ] Time to serialize properties into /tmp/LTL3436952344459518426.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/LTL4202383788163382183.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12498192570290676889.hoa' '-atoms' '/tmp/LTL3436952344459518426.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/LTL3436952344459518426.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12498192570290676889.hoa
Detected timeout of ITS tools.
[2025-05-31 07:52:46] [INFO ] Flatten gal took : 70 ms
[2025-05-31 07:52:46] [INFO ] Flatten gal took : 72 ms
[2025-05-31 07:52:46] [INFO ] Time to serialize gal into /tmp/LTL15306565542125032745.gal : 9 ms
[2025-05-31 07:52:46] [INFO ] Time to serialize properties into /tmp/LTL668067871391673567.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/LTL15306565542125032745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL668067871391673567.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 : !((F(G((G(((!((!("((p167==1)&&(p1988==1))"))U(X("((p167==1)&&(p1988==1))"))))||("(p1202==0)"))||("(p3181==0)")))||(X(X("((p141==0)||(p...172
Formula 0 simplified : G(F(!"(p1202==0)" & !"(p3181==0)" & (!"((p167==1)&&(p1988==1))" U X"((p167==1)&&(p1988==1))")) & F!"((p141==0)||(p2061==0))")
Detected timeout of ITS tools.
[2025-05-31 07:53:01] [INFO ] Flatten gal took : 71 ms
[2025-05-31 07:53:01] [INFO ] Applying decomposition
[2025-05-31 07:53:01] [INFO ] Flatten gal took : 70 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/graph6948755983802315870.txt' '-o' '/tmp/graph6948755983802315870.bin' '-w' '/tmp/graph6948755983802315870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6948755983802315870.bin' '-l' '-1' '-v' '-w' '/tmp/graph6948755983802315870.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:53:01] [INFO ] Decomposing Gal with order
[2025-05-31 07:53:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:53:01] [INFO ] Removed a total of 4401 redundant transitions.
[2025-05-31 07:53:01] [INFO ] Flatten gal took : 67 ms
[2025-05-31 07:53:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 82 ms.
[2025-05-31 07:53:01] [INFO ] Time to serialize gal into /tmp/LTL5092972241381731422.gal : 6 ms
[2025-05-31 07:53:01] [INFO ] Time to serialize properties into /tmp/LTL10503039269070545664.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/LTL5092972241381731422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10503039269070545664.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 : !((F(G((G(((!((!("((i1.u2.p167==1)&&(i1.u64.p1988==1))"))U(X("((i1.u2.p167==1)&&(i1.u64.p1988==1))"))))||("(i9.u30.p1202==0)"))||("(i9...226
Formula 0 simplified : G(F(!"(i9.u30.p1202==0)" & !"(i9.u183.p3181==0)" & (!"((i1.u2.p167==1)&&(i1.u64.p1988==1))" U X"((i1.u2.p167==1)&&(i1.u64.p1988==1))...202
Reverse transition relation is NOT exact ! Due to transitions t1929_t991_t994_t996_t1000, i1.t1373, i3.t129, i3.t126, i3.t122, i3.u6.t127, i3.u7.t124, i3.u...814
Computing Next relation with stutter on 3.14573e+07 deadlock states
7 unique states visited
3 strongly connected components in search stack
16 transitions explored
7 items max in DFS search stack
822 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.31446,572960,1,0,1.80871e+06,338,9734,2.27003e+06,279,903,127560
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DLCround-PT-09b-LTLFireability-14 finished in 268166 ms.
FORMULA DLCround-PT-09b-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-05-31 07:53:14] [INFO ] Flatten gal took : 66 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14160555722171273544
[2025-05-31 07:53:14] [INFO ] Too many transitions (3989) to apply POR reductions. Disabling POR matrices.
[2025-05-31 07:53:14] [INFO ] Applying decomposition
[2025-05-31 07:53:14] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14160555722171273544
Running compilation step : cd /tmp/ltsmin14160555722171273544;'/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-05-31 07:53:14] [INFO ] Flatten gal took : 67 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/graph10471405581477235875.txt' '-o' '/tmp/graph10471405581477235875.bin' '-w' '/tmp/graph10471405581477235875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10471405581477235875.bin' '-l' '-1' '-v' '-w' '/tmp/graph10471405581477235875.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:53:14] [INFO ] Decomposing Gal with order
[2025-05-31 07:53:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:53:14] [INFO ] Removed a total of 3821 redundant transitions.
[2025-05-31 07:53:14] [INFO ] Flatten gal took : 119 ms
[2025-05-31 07:53:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 58 ms.
[2025-05-31 07:53:14] [INFO ] Time to serialize gal into /tmp/LTLFireability13775521349788156726.gal : 17 ms
[2025-05-31 07:53:14] [INFO ] Time to serialize properties into /tmp/LTLFireability15661711696558327927.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/LTLFireability13775521349788156726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15661711696558327927.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 : !((G(("(i9.i1.i17.u726.p3020==1)")||(X((F(("(i16.i1.i5.u412.p1576!=1)")U((G("(i16.i1.i5.u412.p1576!=1)"))||(("(i16.i1.i5.u412.p1576!=1...363
Formula 0 simplified : F(!"(i9.i1.i17.u726.p3020==1)" & X(G(F!"(i13.i1.i3.u338.p1319!=1)" U !"(i16.i1.i5.u412.p1576!=1)") & (!"(i9.i1.i17.u726.p3020==1)" W...218
Compilation finished in 10563 ms.
Running link step : cd /tmp/ltsmin14160555722171273544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin14160555722171273544;'/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' '[](((LTLAPp0==true)||X((<>(((LTLAPp1==true) U ([]((LTLAPp1==true))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))||(X((LTLAPp3==true)) U ((LTLAPp0==true)&&X((LTLAPp3==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin14160555722171273544;'/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' '[](((LTLAPp0==true)||X((<>(((LTLAPp1==true) U ([]((LTLAPp1==true))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))||(X((LTLAPp3==true)) U ((LTLAPp0==true)&&X((LTLAPp3==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14160555722171273544;'/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' '(<>(([](<>(([](<>((LTLAPp4==true)))||(!(LTLAPp5==true)&&<>((LTLAPp4==true))))))||(X(X(!(LTLAPp5==true)))&&<>(([](<>((LTLAPp4==true)))||(!(LTLAPp5==true)&&<>((LTLAPp4==true)))))))) U (LTLAPp4==true))' '--buchi-type=spotba'
LTSmin run took 39323 ms.
FORMULA DLCround-PT-09b-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin14160555722171273544;'/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' '[](((LTLAPp0==true)||X((<>(((LTLAPp1==true) U ([]((LTLAPp1==true))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))||(X((LTLAPp3==true)) U ((LTLAPp0==true)&&X((LTLAPp3==true))))))))' '--buchi-type=spotba'
LTSmin run took 308107 ms.
FORMULA DLCround-PT-09b-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2978149 ms.

BK_STOP 1748678954440

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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