Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K 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 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 660K 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 CloudReconfiguration-PT-307-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748587908768

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-307
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 06:51:49] [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-30 06:51:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 06:51:50] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2025-05-30 06:51:50] [INFO ] Transformed 2584 places.
[2025-05-30 06:51:50] [INFO ] Transformed 3094 transitions.
[2025-05-30 06:51:50] [INFO ] Found NUPN structural information;
[2025-05-30 06:51:50] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-307-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-307-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 514 places :
Symmetric choice reduction at 0 with 514 rule applications. Total rules 514 place count 2070 transition count 2580
Iterating global reduction 0 with 514 rules applied. Total rules applied 1028 place count 2070 transition count 2580
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1056 place count 2070 transition count 2552
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1295 place count 1831 transition count 2313
Iterating global reduction 1 with 239 rules applied. Total rules applied 1534 place count 1831 transition count 2313
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 1624 place count 1741 transition count 2223
Iterating global reduction 1 with 90 rules applied. Total rules applied 1714 place count 1741 transition count 2223
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1731 place count 1741 transition count 2206
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 1781 place count 1691 transition count 2156
Iterating global reduction 2 with 50 rules applied. Total rules applied 1831 place count 1691 transition count 2156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1840 place count 1691 transition count 2147
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1878 place count 1653 transition count 2104
Iterating global reduction 3 with 38 rules applied. Total rules applied 1916 place count 1653 transition count 2104
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1944 place count 1625 transition count 2076
Iterating global reduction 3 with 28 rules applied. Total rules applied 1972 place count 1625 transition count 2076
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1998 place count 1599 transition count 2050
Iterating global reduction 3 with 26 rules applied. Total rules applied 2024 place count 1599 transition count 2050
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2049 place count 1574 transition count 2025
Iterating global reduction 3 with 25 rules applied. Total rules applied 2074 place count 1574 transition count 2025
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 2091 place count 1557 transition count 1999
Iterating global reduction 3 with 17 rules applied. Total rules applied 2108 place count 1557 transition count 1999
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2114 place count 1551 transition count 1989
Iterating global reduction 3 with 6 rules applied. Total rules applied 2120 place count 1551 transition count 1989
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2126 place count 1545 transition count 1980
Iterating global reduction 3 with 6 rules applied. Total rules applied 2132 place count 1545 transition count 1980
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2133 place count 1545 transition count 1979
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2136 place count 1542 transition count 1976
Iterating global reduction 4 with 3 rules applied. Total rules applied 2139 place count 1542 transition count 1976
Applied a total of 2139 rules in 1964 ms. Remains 1542 /2584 variables (removed 1042) and now considering 1976/3094 (removed 1118) transitions.
// Phase 1: matrix 1976 rows 1542 cols
[2025-05-30 06:51:52] [INFO ] Computed 4 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:51:53] [INFO ] Implicit Places using invariants in 590 ms returned []
[2025-05-30 06:51:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:51:54] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned [1531]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1671 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1541/2584 places, 1976/3094 transitions.
Applied a total of 0 rules in 55 ms. Remains 1541 /1541 variables (removed 0) and now considering 1976/1976 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3703 ms. Remains : 1541/2584 places, 1976/3094 transitions.
Support contains 32 out of 1541 places after structural reductions.
[2025-05-30 06:51:54] [INFO ] Flatten gal took : 116 ms
[2025-05-30 06:51:54] [INFO ] Flatten gal took : 68 ms
[2025-05-30 06:51:54] [INFO ] Input system was already deterministic with 1976 transitions.
RANDOM walk for 40000 steps (326 resets) in 1272 ms. (31 steps per ms) remains 23/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 53 ms. (74 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (10 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (10 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
// Phase 1: matrix 1976 rows 1541 cols
[2025-05-30 06:51:55] [INFO ] Computed 3 invariants in 16 ms
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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1496/1518 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1518 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1958/3476 variables, 1518/1521 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3476 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 7/3483 variables, 5/1526 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3483 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 6/3489 variables, 3/1529 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3489 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 6/3495 variables, 3/1532 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3495/3517 variables, and 1532 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1529/1541 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1496/1518 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1518 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1958/3476 variables, 1518/1521 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3476 variables, 23/1544 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3476 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 7/3483 variables, 5/1549 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3483/3517 variables, and 1549 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1523/1541 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10100ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 1541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Graph (trivial) has 1839 edges and 1541 vertex of which 680 / 1541 are part of one of the 64 SCC in 8 ms
Free SCC test removed 616 places
Drop transitions (Empty/Sink Transition effects.) removed 778 transitions
Reduce isomorphic transitions removed 778 transitions.
Graph (complete) has 1369 edges and 925 vertex of which 917 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 917 transition count 701
Reduce places removed 487 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 544 rules applied. Total rules applied 1039 place count 430 transition count 644
Reduce places removed 37 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 42 rules applied. Total rules applied 1081 place count 393 transition count 639
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1086 place count 388 transition count 639
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1086 place count 388 transition count 590
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1184 place count 339 transition count 590
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1194 place count 329 transition count 578
Iterating global reduction 4 with 10 rules applied. Total rules applied 1204 place count 329 transition count 578
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1204 place count 329 transition count 576
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1208 place count 327 transition count 576
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1217 place count 318 transition count 566
Iterating global reduction 4 with 9 rules applied. Total rules applied 1226 place count 318 transition count 566
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1232 place count 318 transition count 560
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1234 place count 316 transition count 552
Iterating global reduction 5 with 2 rules applied. Total rules applied 1236 place count 316 transition count 552
Performed 156 Post agglomeration using F-continuation condition with reduction of 97 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 5 with 312 rules applied. Total rules applied 1548 place count 160 transition count 299
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1564 place count 160 transition count 283
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1565 place count 159 transition count 282
Iterating global reduction 6 with 1 rules applied. Total rules applied 1566 place count 159 transition count 282
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 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1582 place count 151 transition count 274
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1594 place count 151 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1596 place count 150 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1598 place count 150 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1600 place count 149 transition count 258
Performed 33 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 1666 place count 116 transition count 281
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1690 place count 116 transition count 257
Discarding 18 places :
Symmetric choice reduction at 9 with 18 rule applications. Total rules 1708 place count 98 transition count 221
Iterating global reduction 9 with 18 rules applied. Total rules applied 1726 place count 98 transition count 221
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1734 place count 98 transition count 213
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1738 place count 94 transition count 205
Iterating global reduction 10 with 4 rules applied. Total rules applied 1742 place count 94 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1746 place count 94 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1748 place count 93 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 1758 place count 93 transition count 206
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1760 place count 93 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1762 place count 91 transition count 204
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 1766 place count 91 transition count 204
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 1769 place count 91 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1770 place count 90 transition count 203
Applied a total of 1770 rules in 177 ms. Remains 90 /1541 variables (removed 1451) and now considering 203/1976 (removed 1773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 90/1541 places, 203/1976 transitions.
RANDOM walk for 37972 steps (4159 resets) in 706 ms. (53 steps per ms) remains 0/23 properties
FORMULA CloudReconfiguration-PT-307-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2152 edges and 1541 vertex of which 1533 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.28 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U p1)&&X(X(F(p2)))))'
Support contains 4 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1526 transition count 1959
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1526 transition count 1959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1526 transition count 1958
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 1519 transition count 1949
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 1519 transition count 1949
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 1515 transition count 1944
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 1515 transition count 1944
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 1515 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1514 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1514 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1513 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1513 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1512 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1512 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1511 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1511 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1511 transition count 1935
Applied a total of 64 rules in 473 ms. Remains 1511 /1541 variables (removed 30) and now considering 1935/1976 (removed 41) transitions.
// Phase 1: matrix 1935 rows 1511 cols
[2025-05-30 06:52:06] [INFO ] Computed 3 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:52:07] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-05-30 06:52:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:52:08] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2025-05-30 06:52:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3446 variables, and 3 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30054 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3446 variables, and 3 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60582ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60590ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1541 places, 1935/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62268 ms. Remains : 1511/1541 places, 1935/1976 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-00
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 3 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-00 finished in 62660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(X(p1)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1525 transition count 1958
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1525 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1525 transition count 1957
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 1516 transition count 1946
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 1516 transition count 1946
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 1511 transition count 1940
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 1511 transition count 1940
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 1511 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1510 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1510 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 1509 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1509 transition count 1935
Applied a total of 67 rules in 320 ms. Remains 1509 /1541 variables (removed 32) and now considering 1935/1976 (removed 41) transitions.
// Phase 1: matrix 1935 rows 1509 cols
[2025-05-30 06:53:09] [INFO ] Computed 3 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:53:09] [INFO ] Implicit Places using invariants in 292 ms returned []
[2025-05-30 06:53:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:53:10] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2025-05-30 06:53:10] [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: Stream closed")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3444 variables, and 3 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1934 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 1508/3444 variables, and 3 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60427ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1541 places, 1935/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61893 ms. Remains : 1509/1541 places, 1935/1976 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-01 finished in 62222 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) U X((F(G((G(p2) U p3)))||p1))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1525 transition count 1959
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1525 transition count 1959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1525 transition count 1958
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 1516 transition count 1947
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 1516 transition count 1947
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 1512 transition count 1942
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 1512 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 1512 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1511 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1510 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1510 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1509 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1509 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1508 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1508 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 1508 transition count 1934
Applied a total of 69 rules in 407 ms. Remains 1508 /1541 variables (removed 33) and now considering 1934/1976 (removed 42) transitions.
// Phase 1: matrix 1934 rows 1508 cols
[2025-05-30 06:54:11] [INFO ] Computed 3 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:54:11] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-30 06:54:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:54:12] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2025-05-30 06:54:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3442 variables, and 3 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1933 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 1507/3442 variables, and 3 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60427ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1541 places, 1934/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61918 ms. Remains : 1508/1541 places, 1934/1976 transitions.
Stuttering acceptance computed with spot in 646 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) p2 (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-02
Product exploration explored 100000 steps with 851 reset in 239 ms.
Product exploration explored 100000 steps with 821 reset in 214 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1500 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1) (NOT p3) (NOT p2))), (X (NOT p1)), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 34 factoid took 168 ms. Reduced automaton from 15 states, 58 edges and 4 AP (stutter sensitive) to 14 states, 61 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 617 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND p2 (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), false, false, false, false]
Reduction of identical properties reduced properties to check from 31 to 23
RANDOM walk for 40000 steps (332 resets) in 655 ms. (60 steps per ms) remains 18/23 properties
BEST_FIRST walk for 4002 steps (11 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (11 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (10 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (12 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (11 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
[2025-05-30 06:55:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf16 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1081/1084 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 401/1485 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1916/3401 variables, 1485/1488 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3401 variables, 0/1488 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 7/3408 variables, 5/1493 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3408 variables, 0/1493 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 6/3414 variables, 3/1496 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3414 variables, 0/1496 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 6/3420 variables, 3/1499 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3420 variables, 0/1499 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 6/3426 variables, 3/1502 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3426 variables, 0/1502 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 3/3429 variables, 2/1504 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3429 variables, 0/1504 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 2/3431 variables, 1/1505 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3431 variables, 0/1505 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 2/3433 variables, 1/1506 constraints. Problems are: Problem set: 6 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3433/3442 variables, and 1506 constraints, problems are : Problem set: 6 solved, 12 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1503/1508 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 12 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: 6 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1081/1084 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 401/1485 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1916/3401 variables, 1485/1488 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3401 variables, 12/1500 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3401 variables, 0/1500 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 7/3408 variables, 5/1505 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3408 variables, 0/1505 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 6/3414 variables, 3/1508 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3414 variables, 0/1508 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 6/3420 variables, 3/1511 constraints. Problems are: Problem set: 6 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3420/3442 variables, and 1511 constraints, problems are : Problem set: 6 solved, 12 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1496/1508 constraints, PredecessorRefiner: 12/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10040ms problems are : Problem set: 6 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1508/1508 places, 1934/1934 transitions.
Graph (trivial) has 1841 edges and 1508 vertex of which 686 / 1508 are part of one of the 63 SCC in 6 ms
Free SCC test removed 623 places
Drop transitions (Empty/Sink Transition effects.) removed 787 transitions
Reduce isomorphic transitions removed 787 transitions.
Graph (complete) has 1315 edges and 885 vertex of which 877 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 877 transition count 644
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 552 rules applied. Total rules applied 1053 place count 385 transition count 584
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1092 place count 346 transition count 584
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1092 place count 346 transition count 533
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1194 place count 295 transition count 533
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1205 place count 284 transition count 517
Iterating global reduction 3 with 11 rules applied. Total rules applied 1216 place count 284 transition count 517
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1219 place count 284 transition count 514
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1222 place count 281 transition count 514
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1230 place count 273 transition count 504
Iterating global reduction 5 with 8 rules applied. Total rules applied 1238 place count 273 transition count 504
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1244 place count 273 transition count 498
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1245 place count 272 transition count 492
Iterating global reduction 6 with 1 rules applied. Total rules applied 1246 place count 272 transition count 492
Performed 142 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 6 with 284 rules applied. Total rules applied 1530 place count 130 transition count 254
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1544 place count 130 transition count 240
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1547 place count 127 transition count 237
Iterating global reduction 7 with 3 rules applied. Total rules applied 1550 place count 127 transition count 237
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1576 place count 114 transition count 221
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1591 place count 114 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1593 place count 113 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1595 place count 113 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1597 place count 112 transition count 202
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1599 place count 112 transition count 200
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1665 place count 79 transition count 231
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 10 with 46 rules applied. Total rules applied 1711 place count 79 transition count 185
Discarding 23 places :
Symmetric choice reduction at 11 with 23 rule applications. Total rules 1734 place count 56 transition count 154
Iterating global reduction 11 with 23 rules applied. Total rules applied 1757 place count 56 transition count 154
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1771 place count 56 transition count 140
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1776 place count 51 transition count 130
Iterating global reduction 12 with 5 rules applied. Total rules applied 1781 place count 51 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1786 place count 51 transition count 125
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 1807 place count 51 transition count 104
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1809 place count 49 transition count 98
Iterating global reduction 13 with 2 rules applied. Total rules applied 1811 place count 49 transition count 98
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1813 place count 47 transition count 96
Iterating global reduction 13 with 2 rules applied. Total rules applied 1815 place count 47 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1817 place count 47 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1819 place count 46 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1821 place count 46 transition count 91
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 1824 place count 46 transition count 88
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 149 edges and 43 vertex of which 33 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Iterating post reduction 14 with 5 rules applied. Total rules applied 1829 place count 33 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 15 with 14 rules applied. Total rules applied 1843 place count 33 transition count 70
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 16 with 4 rules applied. Total rules applied 1847 place count 33 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1848 place count 33 transition count 69
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1849 place count 33 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1850 place count 33 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1851 place count 32 transition count 67
Applied a total of 1851 rules in 96 ms. Remains 32 /1508 variables (removed 1476) and now considering 67/1934 (removed 1867) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 32/1508 places, 67/1934 transitions.
RANDOM walk for 40000 steps (976 resets) in 90 ms. (439 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40003 steps (272 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (328 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
[2025-05-30 06:55:25] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
// Phase 1: matrix 63 rows 32 cols
[2025-05-30 06:55:25] [INFO ] Computed 3 invariants in 0 ms
[2025-05-30 06:55:25] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf6 is UNSAT
Problem apf26 is UNSAT
After SMT solving in domain Real declared 17/95 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/32 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 10 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1) (NOT p3) (NOT p2))), (X (NOT p1)), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (G (AND (OR (NOT p0) p1 (NOT p2)) (OR (NOT p0) p1 (NOT p3)))), (G (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR (NOT p0) p1 (NOT p2))), (G (OR (NOT p2) (NOT p3))), (G (OR p0 p1 (NOT p2))), (G (OR (NOT p0) (NOT p1) p2 p3)), (G (OR p0 p1 (NOT p2) p3)), (G (OR (NOT p0) p1 (NOT p2) (NOT p3))), (G (OR (NOT p0) p1 p2 (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F p2), (F (NOT p0)), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p2 (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 44 factoid took 971 ms. Reduced automaton from 14 states, 61 edges and 4 AP (stutter insensitive) to 10 states, 28 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 429 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 398 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), false, false, false, false, false, false]
// Phase 1: matrix 1934 rows 1508 cols
[2025-05-30 06:55:27] [INFO ] Computed 3 invariants in 12 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 06:55:28] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 12 ms returned sat
[2025-05-30 06:55:28] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2025-05-30 06:55:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 06:55:29] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 11 ms returned sat
[2025-05-30 06:55:30] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2025-05-30 06:55:30] [INFO ] Computed and/alt/rep : 1927/2355/1927 causal constraints (skipped 6 transitions) in 78 ms.
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 3 out of 1508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1508/1508 places, 1934/1934 transitions.
Graph (trivial) has 1841 edges and 1508 vertex of which 686 / 1508 are part of one of the 63 SCC in 6 ms
Free SCC test removed 623 places
Ensure Unique test removed 723 transitions
Reduce isomorphic transitions removed 723 transitions.
Graph (complete) has 1378 edges and 885 vertex of which 877 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 479 place count 876 transition count 728
Reduce places removed 477 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 501 rules applied. Total rules applied 980 place count 399 transition count 704
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 992 place count 387 transition count 704
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 992 place count 387 transition count 657
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1086 place count 340 transition count 657
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1101 place count 325 transition count 633
Iterating global reduction 3 with 15 rules applied. Total rules applied 1116 place count 325 transition count 633
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1119 place count 325 transition count 630
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1122 place count 322 transition count 630
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1132 place count 312 transition count 616
Iterating global reduction 5 with 10 rules applied. Total rules applied 1142 place count 312 transition count 616
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1148 place count 312 transition count 610
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1150 place count 310 transition count 606
Iterating global reduction 6 with 2 rules applied. Total rules applied 1152 place count 310 transition count 606
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1154 place count 308 transition count 602
Iterating global reduction 6 with 2 rules applied. Total rules applied 1156 place count 308 transition count 602
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1158 place count 306 transition count 598
Iterating global reduction 6 with 2 rules applied. Total rules applied 1160 place count 306 transition count 598
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1162 place count 304 transition count 594
Iterating global reduction 6 with 2 rules applied. Total rules applied 1164 place count 304 transition count 594
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1166 place count 302 transition count 590
Iterating global reduction 6 with 2 rules applied. Total rules applied 1168 place count 302 transition count 590
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1169 place count 301 transition count 583
Iterating global reduction 6 with 1 rules applied. Total rules applied 1170 place count 301 transition count 583
Performed 138 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 6 with 276 rules applied. Total rules applied 1446 place count 163 transition count 367
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1458 place count 163 transition count 355
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1462 place count 159 transition count 350
Iterating global reduction 7 with 4 rules applied. Total rules applied 1466 place count 159 transition count 350
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1492 place count 146 transition count 334
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1506 place count 146 transition count 320
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1542 place count 128 transition count 354
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 1560 place count 128 transition count 336
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1569 place count 119 transition count 318
Iterating global reduction 9 with 9 rules applied. Total rules applied 1578 place count 119 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1584 place count 119 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 10 with 37 rules applied. Total rules applied 1621 place count 119 transition count 275
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1622 place count 119 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1623 place count 119 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1624 place count 118 transition count 273
Applied a total of 1624 rules in 130 ms. Remains 118 /1508 variables (removed 1390) and now considering 273/1934 (removed 1661) transitions.
[2025-05-30 06:55:43] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
// Phase 1: matrix 216 rows 118 cols
[2025-05-30 06:55:43] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:55:44] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 06:55:44] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2025-05-30 06:55:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:55:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 06:55:44] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [11, 48, 81]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 179 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1508 places, 273/1934 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 112 transition count 270
Applied a total of 3 rules in 12 ms. Remains 112 /115 variables (removed 3) and now considering 270/273 (removed 3) transitions.
[2025-05-30 06:55:44] [INFO ] Flow matrix only has 213 transitions (discarded 57 similar events)
// Phase 1: matrix 213 rows 112 cols
[2025-05-30 06:55:44] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:55:44] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-30 06:55:44] [INFO ] Flow matrix only has 213 transitions (discarded 57 similar events)
[2025-05-30 06:55:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:55:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 06:55:44] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1508 places, 270/1934 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 450 ms. Remains : 112/1508 places, 270/1934 transitions.
Computed a total of 1 stabilizing places and 24 stable transitions
Computed a total of 1 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (AND p0 (NOT p2) (NOT p3))), (X p0), (X (NOT p1)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 123 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter insensitive) to 10 states, 28 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 472 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), false, false, false, false, false, false]
RANDOM walk for 40000 steps (5451 resets) in 537 ms. (74 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40003 steps (931 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (930 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (894 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (887 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
[2025-05-30 06:55:45] [INFO ] Flow matrix only has 213 transitions (discarded 57 similar events)
[2025-05-30 06:55:45] [INFO ] Invariant cache hit.
[2025-05-30 06:55:45] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 6/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/139 variables, 6/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 178/317 variables, 90/105 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 3/108 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/108 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Real declared 324/325 variables, and 115 constraints, problems are : Problem set: 4 solved, 0 unsolved in 84 ms.
Refiners :[State Equation: 112/112 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (AND p0 (NOT p2) (NOT p3))), (X p0), (X (NOT p1)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR (NOT p0) p1 p2 (NOT p3))), (G (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR p0 p1))), (F p2), (F p3), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F p1)]
Knowledge based reduction with 29 factoid took 460 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter insensitive) to 10 states, 28 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 435 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 458 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), false, false, false, false, false, false]
[2025-05-30 06:55:46] [INFO ] Flow matrix only has 213 transitions (discarded 57 similar events)
[2025-05-30 06:55:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 06:55:46] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-30 06:55:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 06:55:46] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2025-05-30 06:55:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 06:55:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-30 06:55:46] [INFO ] Computed and/alt/rep : 154/255/153 causal constraints (skipped 51 transitions) in 10 ms.
[2025-05-30 06:55:46] [INFO ] Added : 1 causal constraints over 1 iterations in 34 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 470 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), false, false, false, false, false, false]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-02 finished in 96203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1526 transition count 1960
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1526 transition count 1960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1526 transition count 1959
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 1518 transition count 1948
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 1518 transition count 1948
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 1514 transition count 1944
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 1514 transition count 1944
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 1514 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1513 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1513 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1512 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1512 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1511 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1511 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1510 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1510 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 1510 transition count 1935
Applied a total of 66 rules in 415 ms. Remains 1510 /1541 variables (removed 31) and now considering 1935/1976 (removed 41) transitions.
// Phase 1: matrix 1935 rows 1510 cols
[2025-05-30 06:55:47] [INFO ] Computed 3 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:55:48] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-05-30 06:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:55:48] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2025-05-30 06:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3445 variables, and 3 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1934 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 1509/3445 variables, and 3 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60512ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60519ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1541 places, 1935/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62054 ms. Remains : 1510/1541 places, 1935/1976 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-03
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-03 finished in 62274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p0))||(F(p0)&&(X(X(p1)) U ((p1&&X(X(p1)))||X(X(G(p1)))))))))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1525 transition count 1958
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1525 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1525 transition count 1957
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 1516 transition count 1945
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 1516 transition count 1945
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 1511 transition count 1939
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 1511 transition count 1939
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 1511 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1510 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1510 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 1509 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1509 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1508 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1507 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1507 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 1507 transition count 1930
Applied a total of 72 rules in 453 ms. Remains 1507 /1541 variables (removed 34) and now considering 1930/1976 (removed 46) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2025-05-30 06:56:50] [INFO ] Computed 3 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:56:50] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-30 06:56:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:56:51] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 06:56:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1541 places, 1930/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62097 ms. Remains : 1507/1541 places, 1930/1976 transitions.
Stuttering acceptance computed with spot in 501 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 294 ms.
Product exploration explored 100000 steps with 20000 reset in 291 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2103 edges and 1507 vertex of which 1499 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 11 states, 22 edges and 2 AP (stutter sensitive) to 11 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 421 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (334 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (95 resets) in 46 ms. (851 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (100 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
[2025-05-30 06:57:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1482/1484 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1912/3396 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3396 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/3403 variables, 5/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3403 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/3409 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3409 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/3415 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3415 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/3421 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/3424 variables, 2/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3426 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3437/3437 variables, and 1510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4270 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1482/1484 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1912/3396 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3396 variables, 2/1489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3396 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/3403 variables, 5/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3403 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/3409 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3409 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3415 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/3421 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/3424 variables, 2/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3437/3437 variables, and 1512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3469 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7749ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 43 ms.
Support contains 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Graph (trivial) has 1840 edges and 1507 vertex of which 692 / 1507 are part of one of the 64 SCC in 2 ms
Free SCC test removed 628 places
Drop transitions (Empty/Sink Transition effects.) removed 793 transitions
Reduce isomorphic transitions removed 793 transitions.
Graph (complete) has 1305 edges and 879 vertex of which 871 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 871 transition count 638
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 548 rules applied. Total rules applied 1045 place count 383 transition count 578
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1084 place count 344 transition count 578
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1084 place count 344 transition count 527
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1186 place count 293 transition count 527
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1197 place count 282 transition count 511
Iterating global reduction 3 with 11 rules applied. Total rules applied 1208 place count 282 transition count 511
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1211 place count 282 transition count 508
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1214 place count 279 transition count 508
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1222 place count 271 transition count 498
Iterating global reduction 5 with 8 rules applied. Total rules applied 1230 place count 271 transition count 498
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1236 place count 271 transition count 492
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1237 place count 270 transition count 486
Iterating global reduction 6 with 1 rules applied. Total rules applied 1238 place count 270 transition count 486
Performed 143 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 6 with 286 rules applied. Total rules applied 1524 place count 127 transition count 247
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1537 place count 127 transition count 234
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1540 place count 124 transition count 231
Iterating global reduction 7 with 3 rules applied. Total rules applied 1543 place count 124 transition count 231
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1569 place count 111 transition count 215
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1584 place count 111 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1586 place count 110 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1588 place count 110 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1590 place count 109 transition count 196
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1592 place count 109 transition count 194
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1658 place count 76 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 10 with 46 rules applied. Total rules applied 1704 place count 76 transition count 179
Discarding 22 places :
Symmetric choice reduction at 11 with 22 rule applications. Total rules 1726 place count 54 transition count 150
Iterating global reduction 11 with 22 rules applied. Total rules applied 1748 place count 54 transition count 150
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1761 place count 54 transition count 137
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1767 place count 48 transition count 125
Iterating global reduction 12 with 6 rules applied. Total rules applied 1773 place count 48 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1779 place count 48 transition count 119
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 1801 place count 48 transition count 97
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1803 place count 46 transition count 91
Iterating global reduction 13 with 2 rules applied. Total rules applied 1805 place count 46 transition count 91
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1807 place count 44 transition count 89
Iterating global reduction 13 with 2 rules applied. Total rules applied 1809 place count 44 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1811 place count 44 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1813 place count 44 transition count 85
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 1816 place count 44 transition count 82
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1820 place count 41 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1821 place count 41 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1822 place count 40 transition count 80
Applied a total of 1822 rules in 46 ms. Remains 40 /1507 variables (removed 1467) and now considering 80/1930 (removed 1850) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 40/1507 places, 80/1930 transitions.
RANDOM walk for 3097 steps (79 resets) in 7 ms. (387 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 11 states, 18 edges and 2 AP (stutter sensitive) to 11 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 58 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2025-05-30 06:58:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:58:02] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-05-30 06:58:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:58:03] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 06:58:03] [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")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 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 1506/3437 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60406ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Finished structural reductions in LTL mode , in 1 iterations and 61548 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2103 edges and 1507 vertex of which 1499 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 11 states, 18 edges and 2 AP (stutter sensitive) to 11 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (338 resets) in 112 ms. (353 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (96 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (99 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
[2025-05-30 06:59: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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1482/1484 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1912/3396 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3396 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/3403 variables, 5/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3403 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/3409 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3409 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/3415 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3415 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/3421 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/3424 variables, 2/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3426 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3437/3437 variables, and 1510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4287 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1482/1484 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1912/3396 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3396 variables, 2/1489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3396 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/3403 variables, 5/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3403 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/3409 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3409 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3415 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/3421 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/3424 variables, 2/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3437/3437 variables, and 1512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3477 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7775ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 41 ms.
Support contains 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Graph (trivial) has 1840 edges and 1507 vertex of which 692 / 1507 are part of one of the 64 SCC in 1 ms
Free SCC test removed 628 places
Drop transitions (Empty/Sink Transition effects.) removed 793 transitions
Reduce isomorphic transitions removed 793 transitions.
Graph (complete) has 1305 edges and 879 vertex of which 871 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 871 transition count 638
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 548 rules applied. Total rules applied 1045 place count 383 transition count 578
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1084 place count 344 transition count 578
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1084 place count 344 transition count 527
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1186 place count 293 transition count 527
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1197 place count 282 transition count 511
Iterating global reduction 3 with 11 rules applied. Total rules applied 1208 place count 282 transition count 511
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1211 place count 282 transition count 508
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1214 place count 279 transition count 508
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1222 place count 271 transition count 498
Iterating global reduction 5 with 8 rules applied. Total rules applied 1230 place count 271 transition count 498
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1236 place count 271 transition count 492
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1237 place count 270 transition count 486
Iterating global reduction 6 with 1 rules applied. Total rules applied 1238 place count 270 transition count 486
Performed 143 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 6 with 286 rules applied. Total rules applied 1524 place count 127 transition count 247
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1537 place count 127 transition count 234
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1540 place count 124 transition count 231
Iterating global reduction 7 with 3 rules applied. Total rules applied 1543 place count 124 transition count 231
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1569 place count 111 transition count 215
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1584 place count 111 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1586 place count 110 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1588 place count 110 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1590 place count 109 transition count 196
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1592 place count 109 transition count 194
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1658 place count 76 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 10 with 46 rules applied. Total rules applied 1704 place count 76 transition count 179
Discarding 22 places :
Symmetric choice reduction at 11 with 22 rule applications. Total rules 1726 place count 54 transition count 150
Iterating global reduction 11 with 22 rules applied. Total rules applied 1748 place count 54 transition count 150
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1761 place count 54 transition count 137
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1767 place count 48 transition count 125
Iterating global reduction 12 with 6 rules applied. Total rules applied 1773 place count 48 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1779 place count 48 transition count 119
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 1801 place count 48 transition count 97
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1803 place count 46 transition count 91
Iterating global reduction 13 with 2 rules applied. Total rules applied 1805 place count 46 transition count 91
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1807 place count 44 transition count 89
Iterating global reduction 13 with 2 rules applied. Total rules applied 1809 place count 44 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1811 place count 44 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1813 place count 44 transition count 85
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 1816 place count 44 transition count 82
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1820 place count 41 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1821 place count 41 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1822 place count 40 transition count 80
Applied a total of 1822 rules in 43 ms. Remains 40 /1507 variables (removed 1467) and now considering 80/1930 (removed 1850) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 40/1507 places, 80/1930 transitions.
RANDOM walk for 1672 steps (39 resets) in 6 ms. (238 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 11 states, 18 edges and 2 AP (stutter sensitive) to 11 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 411 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 219 ms.
Product exploration explored 100000 steps with 20000 reset in 219 ms.
Applying partial POR strategy [false, false, false, true, false, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 398 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Graph (trivial) has 1840 edges and 1507 vertex of which 692 / 1507 are part of one of the 64 SCC in 1 ms
Free SCC test removed 628 places
Ensure Unique test removed 728 transitions
Reduce isomorphic transitions removed 728 transitions.
Graph (complete) has 1369 edges and 879 vertex of which 871 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 473 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 473 rules applied. Total rules applied 475 place count 871 transition count 1197
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 487 place count 871 transition count 1185
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 487 place count 871 transition count 1197
Deduced a syphon composed of 495 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 509 place count 871 transition count 1197
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 791 place count 589 transition count 905
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 282 rules applied. Total rules applied 1073 place count 589 transition count 905
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1085 place count 577 transition count 889
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1097 place count 577 transition count 889
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1103 place count 577 transition count 883
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1115 place count 565 transition count 871
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1127 place count 565 transition count 871
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1129 place count 563 transition count 867
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1131 place count 563 transition count 867
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1133 place count 561 transition count 863
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1135 place count 561 transition count 863
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1139 place count 557 transition count 859
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1143 place count 557 transition count 859
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1145 place count 555 transition count 855
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1147 place count 555 transition count 855
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1149 place count 553 transition count 851
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1151 place count 553 transition count 851
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1155 place count 549 transition count 845
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1159 place count 549 transition count 845
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1162 place count 546 transition count 836
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1165 place count 546 transition count 836
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1167 place count 544 transition count 834
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1169 place count 544 transition count 834
Performed 108 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 318 places in 0 ms
Iterating global reduction 3 with 108 rules applied. Total rules applied 1277 place count 544 transition count 905
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 1313 place count 544 transition count 869
Discarding 102 places :
Symmetric choice reduction at 4 with 102 rule applications. Total rules 1415 place count 442 transition count 757
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 4 with 102 rules applied. Total rules applied 1517 place count 442 transition count 757
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1523 place count 436 transition count 748
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1529 place count 436 transition count 748
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1536 place count 436 transition count 748
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1541 place count 436 transition count 743
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1556 place count 421 transition count 724
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1571 place count 421 transition count 724
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1577 place count 421 transition count 718
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1581 place count 417 transition count 714
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1585 place count 417 transition count 714
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1588 place count 417 transition count 714
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1594 place count 417 transition count 708
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1597 place count 414 transition count 705
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1600 place count 414 transition count 705
Performed 70 Post agglomeration using F-continuation condition with reduction of 123 identical transitions.
Deduced a syphon composed of 282 places in 1 ms
Iterating global reduction 7 with 70 rules applied. Total rules applied 1670 place count 414 transition count 1021
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 7 with 123 rules applied. Total rules applied 1793 place count 414 transition count 898
Discarding 125 places :
Symmetric choice reduction at 8 with 125 rule applications. Total rules 1918 place count 289 transition count 569
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 8 with 125 rules applied. Total rules applied 2043 place count 289 transition count 569
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 2058 place count 289 transition count 554
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 2085 place count 262 transition count 497
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 9 with 27 rules applied. Total rules applied 2112 place count 262 transition count 497
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2115 place count 262 transition count 545
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2118 place count 259 transition count 518
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2121 place count 259 transition count 518
Deduced a syphon composed of 139 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 9 with 47 rules applied. Total rules applied 2168 place count 259 transition count 471
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2172 place count 255 transition count 467
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2176 place count 255 transition count 467
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2179 place count 255 transition count 527
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2182 place count 252 transition count 512
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2185 place count 252 transition count 512
Deduced a syphon composed of 135 places in 0 ms
Applied a total of 2185 rules in 279 ms. Remains 252 /1507 variables (removed 1255) and now considering 512/1930 (removed 1418) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:59:15] [INFO ] Redundant transitions in 32 ms returned []
Running 511 sub problems to find dead transitions.
[2025-05-30 06:59:15] [INFO ] Flow matrix only has 455 transitions (discarded 57 similar events)
// Phase 1: matrix 455 rows 252 cols
[2025-05-30 06:59:15] [INFO ] Computed 0 invariants in 3 ms
[2025-05-30 06:59:15] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
At refinement iteration 1 (OVERLAPS) 454/705 variables, 251/251 constraints. Problems are: Problem set: 241 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/705 variables, 3/254 constraints. Problems are: Problem set: 241 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 0/254 constraints. Problems are: Problem set: 241 solved, 270 unsolved
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/706 variables, 1/255 constraints. Problems are: Problem set: 246 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/706 variables, 0/255 constraints. Problems are: Problem set: 246 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/707 variables, 1/256 constraints. Problems are: Problem set: 246 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 0/256 constraints. Problems are: Problem set: 246 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 707/707 variables, and 256 constraints, problems are : Problem set: 246 solved, 265 unsolved in 30015 ms.
Refiners :[State Equation: 252/252 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 511/511 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 246 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 246 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 451/567 variables, 116/116 constraints. Problems are: Problem set: 246 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 3/119 constraints. Problems are: Problem set: 246 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 265/384 constraints. Problems are: Problem set: 246 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/384 constraints. Problems are: Problem set: 246 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 139/706 variables, 136/520 constraints. Problems are: Problem set: 246 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/706 variables, 0/520 constraints. Problems are: Problem set: 246 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/707 variables, 1/521 constraints. Problems are: Problem set: 246 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 707/707 variables, and 521 constraints, problems are : Problem set: 246 solved, 265 unsolved in 30012 ms.
Refiners :[State Equation: 252/252 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 265/511 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 246 solved, 265 unsolved
Search for dead transitions found 246 dead transitions in 60137ms
Found 246 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 246 transitions
Dead transitions reduction (with SMT) removed 246 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 252/1507 places, 266/1930 transitions.
Graph (complete) has 407 edges and 252 vertex of which 117 are kept as prefixes of interest. Removing 135 places using SCC suffix rule.0 ms
Discarding 135 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 110 transition count 248
Applied a total of 8 rules in 14 ms. Remains 110 /252 variables (removed 142) and now considering 248/266 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1507 places, 248/1930 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60480 ms. Remains : 110/1507 places, 248/1930 transitions.
Built C files in :
/tmp/ltsmin4586383375875213653
[2025-05-30 07:00:15] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4586383375875213653
Running compilation step : cd /tmp/ltsmin4586383375875213653;'/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/ltsmin4586383375875213653;'/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/ltsmin4586383375875213653;'/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 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 50 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2025-05-30 07:00:18] [INFO ] Computed 3 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:00:18] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 07:00:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:00:19] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 07:00:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60393ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Finished structural reductions in LTL mode , in 1 iterations and 61533 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Built C files in :
/tmp/ltsmin7505077005337732890
[2025-05-30 07:01:19] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7505077005337732890
Running compilation step : cd /tmp/ltsmin7505077005337732890;'/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/ltsmin7505077005337732890;'/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/ltsmin7505077005337732890;'/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-30 07:01:22] [INFO ] Flatten gal took : 56 ms
[2025-05-30 07:01:23] [INFO ] Flatten gal took : 57 ms
[2025-05-30 07:01:23] [INFO ] Time to serialize gal into /tmp/LTL10935071694937352569.gal : 13 ms
[2025-05-30 07:01:23] [INFO ] Time to serialize properties into /tmp/LTL3515999657479635391.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/LTL10935071694937352569.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14534767327844281889.hoa' '-atoms' '/tmp/LTL3515999657479635391.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3515999657479635391.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14534767327844281889.hoa
Detected timeout of ITS tools.
[2025-05-30 07:01:38] [INFO ] Flatten gal took : 45 ms
[2025-05-30 07:01:38] [INFO ] Flatten gal took : 41 ms
[2025-05-30 07:01:38] [INFO ] Time to serialize gal into /tmp/LTL14112153530837538239.gal : 9 ms
[2025-05-30 07:01:38] [INFO ] Time to serialize properties into /tmp/LTL4628647865770481529.ltl : 2 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/LTL14112153530837538239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4628647865770481529.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(p2269!=1)")))||((F("(p2269!=1)"))&&((X(X("(p213!=1)")))U((X(X(G("(p213!=1)"))))||(("(p213!=1)")&&(X(X("(p213!=1)")))))...162
Formula 0 simplified : XXG(FG!"(p2269!=1)" & (G!"(p2269!=1)" | (XX!"(p213!=1)" R (XXF!"(p213!=1)" & (!"(p213!=1)" | XX!"(p213!=1)")))))
Detected timeout of ITS tools.
[2025-05-30 07:01:53] [INFO ] Flatten gal took : 36 ms
[2025-05-30 07:01:53] [INFO ] Applying decomposition
[2025-05-30 07:01:53] [INFO ] Flatten gal took : 37 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/graph7981461141602808404.txt' '-o' '/tmp/graph7981461141602808404.bin' '-w' '/tmp/graph7981461141602808404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7981461141602808404.bin' '-l' '-1' '-v' '-w' '/tmp/graph7981461141602808404.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:01:53] [INFO ] Decomposing Gal with order
[2025-05-30 07:01:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:01:53] [INFO ] Removed a total of 492 redundant transitions.
[2025-05-30 07:01:53] [INFO ] Flatten gal took : 119 ms
[2025-05-30 07:01:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 26 ms.
[2025-05-30 07:01:53] [INFO ] Time to serialize gal into /tmp/LTL1936754711548985670.gal : 19 ms
[2025-05-30 07:01:53] [INFO ] Time to serialize properties into /tmp/LTL17852230894211092426.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/LTL1936754711548985670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17852230894211092426.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(i35.i1.i0.u549.p2269!=1)")))||((F("(i35.i1.i0.u549.p2269!=1)"))&&((X(X("(i0.u39.p213!=1)")))U((X(X(G("(i0.u39.p213!=1)...220
Formula 0 simplified : XXG(FG!"(i35.i1.i0.u549.p2269!=1)" & (G!"(i35.i1.i0.u549.p2269!=1)" | (XX!"(i0.u39.p213!=1)" R (XXF!"(i0.u39.p213!=1)" & (!"(i0.u39....193
Reverse transition relation is NOT exact ! Due to transitions t26, t194, t225, t277, t308, t459, t508, t669, t698, t750, t781, t810, t982, t1176, t1230, t1...2115
Computing Next relation with stutter on 49920 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
301 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,3.18186,121224,1,0,193118,3597,19033,313712,631,18138,925726
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-307-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-307-LTLFireability-04 finished in 307854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Graph (trivial) has 1886 edges and 1541 vertex of which 700 / 1541 are part of one of the 63 SCC in 2 ms
Free SCC test removed 637 places
Ensure Unique test removed 740 transitions
Reduce isomorphic transitions removed 740 transitions.
Graph (complete) has 1406 edges and 904 vertex of which 896 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 490 place count 895 transition count 742
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 512 rules applied. Total rules applied 1002 place count 407 transition count 718
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1014 place count 395 transition count 718
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1014 place count 395 transition count 672
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1106 place count 349 transition count 672
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1124 place count 331 transition count 645
Iterating global reduction 3 with 18 rules applied. Total rules applied 1142 place count 331 transition count 645
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1142 place count 331 transition count 644
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1144 place count 330 transition count 644
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1159 place count 315 transition count 622
Iterating global reduction 3 with 15 rules applied. Total rules applied 1174 place count 315 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 1181 place count 315 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1182 place count 314 transition count 615
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1186 place count 310 transition count 607
Iterating global reduction 5 with 4 rules applied. Total rules applied 1190 place count 310 transition count 607
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1191 place count 310 transition count 606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1192 place count 309 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1194 place count 307 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1196 place count 307 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1198 place count 305 transition count 598
Iterating global reduction 7 with 2 rules applied. Total rules applied 1200 place count 305 transition count 598
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1202 place count 303 transition count 594
Iterating global reduction 7 with 2 rules applied. Total rules applied 1204 place count 303 transition count 594
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 301 transition count 590
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 301 transition count 590
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1209 place count 300 transition count 583
Iterating global reduction 7 with 1 rules applied. Total rules applied 1210 place count 300 transition count 583
Performed 145 Post agglomeration using F-continuation condition with reduction of 85 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 7 with 290 rules applied. Total rules applied 1500 place count 155 transition count 353
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1512 place count 155 transition count 341
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1516 place count 151 transition count 332
Iterating global reduction 8 with 4 rules applied. Total rules applied 1520 place count 151 transition count 332
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1544 place count 139 transition count 318
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1558 place count 139 transition count 304
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1592 place count 122 transition count 338
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1609 place count 122 transition count 321
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1618 place count 113 transition count 303
Iterating global reduction 10 with 9 rules applied. Total rules applied 1627 place count 113 transition count 303
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1633 place count 113 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 11 with 36 rules applied. Total rules applied 1669 place count 113 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1670 place count 112 transition count 260
Applied a total of 1670 rules in 74 ms. Remains 112 /1541 variables (removed 1429) and now considering 260/1976 (removed 1716) transitions.
[2025-05-30 07:01:57] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 112 cols
[2025-05-30 07:01:57] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:01:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-30 07:01:57] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2025-05-30 07:01:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:01:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 07:01:57] [INFO ] Implicit Places using invariants and state equation in 236 ms returned [8, 42, 75]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 307 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/1541 places, 260/1976 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 106 transition count 257
Applied a total of 3 rules in 6 ms. Remains 106 /109 variables (removed 3) and now considering 257/260 (removed 3) transitions.
[2025-05-30 07:01:57] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 106 cols
[2025-05-30 07:01:57] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:01:58] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 07:01:58] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2025-05-30 07:01:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:01:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 07:01:58] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/1541 places, 257/1976 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 601 ms. Remains : 106/1541 places, 257/1976 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-05 finished in 641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Graph (trivial) has 1883 edges and 1541 vertex of which 700 / 1541 are part of one of the 63 SCC in 1 ms
Free SCC test removed 637 places
Ensure Unique test removed 740 transitions
Reduce isomorphic transitions removed 740 transitions.
Graph (complete) has 1406 edges and 904 vertex of which 896 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 0 with 483 rules applied. Total rules applied 485 place count 895 transition count 747
Reduce places removed 483 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 507 rules applied. Total rules applied 992 place count 412 transition count 723
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 1007 place count 400 transition count 720
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1010 place count 397 transition count 720
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1010 place count 397 transition count 674
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1102 place count 351 transition count 674
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1120 place count 333 transition count 647
Iterating global reduction 4 with 18 rules applied. Total rules applied 1138 place count 333 transition count 647
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1138 place count 333 transition count 646
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1140 place count 332 transition count 646
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1155 place count 317 transition count 624
Iterating global reduction 4 with 15 rules applied. Total rules applied 1170 place count 317 transition count 624
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 1178 place count 317 transition count 616
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1179 place count 316 transition count 616
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1183 place count 312 transition count 608
Iterating global reduction 6 with 4 rules applied. Total rules applied 1187 place count 312 transition count 608
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1188 place count 312 transition count 607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1189 place count 311 transition count 607
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1191 place count 309 transition count 603
Iterating global reduction 8 with 2 rules applied. Total rules applied 1193 place count 309 transition count 603
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1195 place count 307 transition count 599
Iterating global reduction 8 with 2 rules applied. Total rules applied 1197 place count 307 transition count 599
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1199 place count 305 transition count 595
Iterating global reduction 8 with 2 rules applied. Total rules applied 1201 place count 305 transition count 595
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1202 place count 304 transition count 593
Iterating global reduction 8 with 1 rules applied. Total rules applied 1203 place count 304 transition count 593
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1204 place count 303 transition count 586
Iterating global reduction 8 with 1 rules applied. Total rules applied 1205 place count 303 transition count 586
Performed 144 Post agglomeration using F-continuation condition with reduction of 85 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 8 with 288 rules applied. Total rules applied 1493 place count 159 transition count 357
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1505 place count 159 transition count 345
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1508 place count 156 transition count 341
Iterating global reduction 9 with 3 rules applied. Total rules applied 1511 place count 156 transition count 341
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1533 place count 145 transition count 328
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1546 place count 145 transition count 315
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1547 place count 144 transition count 313
Iterating global reduction 10 with 1 rules applied. Total rules applied 1548 place count 144 transition count 313
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1584 place count 126 transition count 351
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 1605 place count 126 transition count 330
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1614 place count 117 transition count 312
Iterating global reduction 11 with 9 rules applied. Total rules applied 1623 place count 117 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1629 place count 117 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 12 with 37 rules applied. Total rules applied 1666 place count 117 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1667 place count 116 transition count 268
Applied a total of 1667 rules in 70 ms. Remains 116 /1541 variables (removed 1425) and now considering 268/1976 (removed 1708) transitions.
[2025-05-30 07:01:58] [INFO ] Flow matrix only has 212 transitions (discarded 56 similar events)
// Phase 1: matrix 212 rows 116 cols
[2025-05-30 07:01:58] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:01:58] [INFO ] Implicit Places using invariants in 319 ms returned []
[2025-05-30 07:01:58] [INFO ] Flow matrix only has 212 transitions (discarded 56 similar events)
[2025-05-30 07:01:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:01:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 07:01:58] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [11, 46, 79]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 465 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/1541 places, 268/1976 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 110 transition count 265
Applied a total of 3 rules in 5 ms. Remains 110 /113 variables (removed 3) and now considering 265/268 (removed 3) transitions.
[2025-05-30 07:01:58] [INFO ] Flow matrix only has 209 transitions (discarded 56 similar events)
// Phase 1: matrix 209 rows 110 cols
[2025-05-30 07:01:58] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:01:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-30 07:01:58] [INFO ] Flow matrix only has 209 transitions (discarded 56 similar events)
[2025-05-30 07:01:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:01:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 07:01:58] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1541 places, 265/1976 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 678 ms. Remains : 110/1541 places, 265/1976 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-06 finished in 756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(X(X((p1 U (p2||G(p1)))))))))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1525 transition count 1958
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1525 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1525 transition count 1957
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 1516 transition count 1945
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 1516 transition count 1945
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 1512 transition count 1940
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 1512 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 1512 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1511 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1510 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1510 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1509 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1509 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1508 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1508 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 1508 transition count 1932
Applied a total of 69 rules in 480 ms. Remains 1508 /1541 variables (removed 33) and now considering 1932/1976 (removed 44) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2025-05-30 07:01:59] [INFO ] Computed 3 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:01:59] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-05-30 07:01:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:02:00] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 07:02:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 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 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1541 places, 1932/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61983 ms. Remains : 1508/1541 places, 1932/1976 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-08
Product exploration explored 100000 steps with 840 reset in 125 ms.
Product exploration explored 100000 steps with 835 reset in 176 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2105 edges and 1508 vertex of which 1500 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p2 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (323 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (100 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (101 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (102 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (103 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 328779 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 4
Probabilistic random walk after 328779 steps, saw 82539 distinct states, run finished after 3007 ms. (steps per millisecond=109 ) properties seen :0
[2025-05-30 07:03: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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 401/1485 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3399 variables, 1485/1488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3399 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/3406 variables, 5/1493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3406 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6/3412 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3412 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/3418 variables, 3/1499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3418 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/3424 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/3427 variables, 2/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3427 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3429 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3429 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3431 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3431 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3433 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3433 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3435 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3435 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3437 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 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 3437/3440 variables, and 1509 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1508 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 401/1485 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3399 variables, 1485/1488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3399 variables, 4/1492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3399 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/3406 variables, 5/1497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3406 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/3412 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3412 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6/3418 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3418 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 6/3424 variables, 3/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/3427 variables, 2/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3435 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3435/3440 variables, and 1512 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1505/1508 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10032ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Graph (trivial) has 1842 edges and 1508 vertex of which 693 / 1508 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1304 edges and 878 vertex of which 870 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 870 transition count 636
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 546 rules applied. Total rules applied 1044 place count 381 transition count 579
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1081 place count 344 transition count 579
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1081 place count 344 transition count 530
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1179 place count 295 transition count 530
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1190 place count 284 transition count 514
Iterating global reduction 3 with 11 rules applied. Total rules applied 1201 place count 284 transition count 514
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1204 place count 284 transition count 511
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1207 place count 281 transition count 511
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1214 place count 274 transition count 503
Iterating global reduction 5 with 7 rules applied. Total rules applied 1221 place count 274 transition count 503
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1227 place count 274 transition count 497
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1228 place count 273 transition count 491
Iterating global reduction 6 with 1 rules applied. Total rules applied 1229 place count 273 transition count 491
Performed 145 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 6 with 290 rules applied. Total rules applied 1519 place count 128 transition count 250
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1534 place count 128 transition count 235
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1537 place count 125 transition count 232
Iterating global reduction 7 with 3 rules applied. Total rules applied 1540 place count 125 transition count 232
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1566 place count 112 transition count 216
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1581 place count 112 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1583 place count 111 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1585 place count 111 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1587 place count 110 transition count 197
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1589 place count 110 transition count 195
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1655 place count 77 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 10 with 46 rules applied. Total rules applied 1701 place count 77 transition count 179
Discarding 22 places :
Symmetric choice reduction at 11 with 22 rule applications. Total rules 1723 place count 55 transition count 150
Iterating global reduction 11 with 22 rules applied. Total rules applied 1745 place count 55 transition count 150
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1759 place count 55 transition count 136
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1764 place count 50 transition count 126
Iterating global reduction 12 with 5 rules applied. Total rules applied 1769 place count 50 transition count 126
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1774 place count 50 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 1794 place count 50 transition count 101
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1796 place count 48 transition count 95
Iterating global reduction 13 with 2 rules applied. Total rules applied 1798 place count 48 transition count 95
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1800 place count 46 transition count 93
Iterating global reduction 13 with 2 rules applied. Total rules applied 1802 place count 46 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1804 place count 46 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1806 place count 46 transition count 89
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 1810 place count 46 transition count 85
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1816 place count 42 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1818 place count 42 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1819 place count 42 transition count 82
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1820 place count 41 transition count 81
Iterating global reduction 15 with 1 rules applied. Total rules applied 1821 place count 41 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1822 place count 40 transition count 80
Applied a total of 1822 rules in 45 ms. Remains 40 /1508 variables (removed 1468) and now considering 80/1932 (removed 1852) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 40/1508 places, 80/1932 transitions.
RANDOM walk for 463 steps (9 resets) in 7 ms. (57 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p2 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 213 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Applied a total of 0 rules in 70 ms. Remains 1508 /1508 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
[2025-05-30 07:03:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:03:16] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-30 07:03:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:03:16] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 07:03:16] [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 124.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 0.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 0.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 0.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 timeout
1.0)
(s1261 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60469ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Finished structural reductions in LTL mode , in 1 iterations and 61711 ms. Remains : 1508/1508 places, 1932/1932 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2105 edges and 1508 vertex of which 1500 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (335 resets) in 108 ms. (366 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (100 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (97 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (100 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (96 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 356768 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 4
Probabilistic random walk after 356768 steps, saw 86075 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2025-05-30 07:04:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 401/1485 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3399 variables, 1485/1488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3399 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/3406 variables, 5/1493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3406 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6/3412 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3412 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/3418 variables, 3/1499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3418 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/3424 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/3427 variables, 2/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3427 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3429 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3429 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3431 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3431 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3433 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3433 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3435 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3435 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3437 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3437/3440 variables, and 1509 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1508 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 401/1485 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3399 variables, 1485/1488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3399 variables, 4/1492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3399 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/3406 variables, 5/1497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3406 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/3412 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3412 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6/3418 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3418 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 6/3424 variables, 3/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/3427 variables, 2/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3435 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3435/3440 variables, and 1512 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1505/1508 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10032ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Graph (trivial) has 1842 edges and 1508 vertex of which 693 / 1508 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1304 edges and 878 vertex of which 870 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 870 transition count 636
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 546 rules applied. Total rules applied 1044 place count 381 transition count 579
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1081 place count 344 transition count 579
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1081 place count 344 transition count 530
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1179 place count 295 transition count 530
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1190 place count 284 transition count 514
Iterating global reduction 3 with 11 rules applied. Total rules applied 1201 place count 284 transition count 514
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1204 place count 284 transition count 511
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1207 place count 281 transition count 511
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1214 place count 274 transition count 503
Iterating global reduction 5 with 7 rules applied. Total rules applied 1221 place count 274 transition count 503
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1227 place count 274 transition count 497
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1228 place count 273 transition count 491
Iterating global reduction 6 with 1 rules applied. Total rules applied 1229 place count 273 transition count 491
Performed 145 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 6 with 290 rules applied. Total rules applied 1519 place count 128 transition count 250
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1534 place count 128 transition count 235
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1537 place count 125 transition count 232
Iterating global reduction 7 with 3 rules applied. Total rules applied 1540 place count 125 transition count 232
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1566 place count 112 transition count 216
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1581 place count 112 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1583 place count 111 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1585 place count 111 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1587 place count 110 transition count 197
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1589 place count 110 transition count 195
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1655 place count 77 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 10 with 46 rules applied. Total rules applied 1701 place count 77 transition count 179
Discarding 22 places :
Symmetric choice reduction at 11 with 22 rule applications. Total rules 1723 place count 55 transition count 150
Iterating global reduction 11 with 22 rules applied. Total rules applied 1745 place count 55 transition count 150
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1759 place count 55 transition count 136
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1764 place count 50 transition count 126
Iterating global reduction 12 with 5 rules applied. Total rules applied 1769 place count 50 transition count 126
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1774 place count 50 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 1794 place count 50 transition count 101
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1796 place count 48 transition count 95
Iterating global reduction 13 with 2 rules applied. Total rules applied 1798 place count 48 transition count 95
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1800 place count 46 transition count 93
Iterating global reduction 13 with 2 rules applied. Total rules applied 1802 place count 46 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1804 place count 46 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1806 place count 46 transition count 89
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 1810 place count 46 transition count 85
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1816 place count 42 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1818 place count 42 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1819 place count 42 transition count 82
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1820 place count 41 transition count 81
Iterating global reduction 15 with 1 rules applied. Total rules applied 1821 place count 41 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1822 place count 40 transition count 80
Applied a total of 1822 rules in 52 ms. Remains 40 /1508 variables (removed 1468) and now considering 80/1932 (removed 1852) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 40/1508 places, 80/1932 transitions.
RANDOM walk for 510 steps (13 resets) in 6 ms. (72 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 211 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 854 reset in 148 ms.
Product exploration explored 100000 steps with 848 reset in 162 ms.
Built C files in :
/tmp/ltsmin636129076485758147
[2025-05-30 07:04:32] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin636129076485758147
Running compilation step : cd /tmp/ltsmin636129076485758147;'/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/ltsmin636129076485758147;'/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/ltsmin636129076485758147;'/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 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Applied a total of 0 rules in 61 ms. Remains 1508 /1508 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
[2025-05-30 07:04:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:04:35] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-30 07:04:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:04:36] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 07:04:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60434ms
Finished structural reductions in LTL mode , in 1 iterations and 61606 ms. Remains : 1508/1508 places, 1932/1932 transitions.
Built C files in :
/tmp/ltsmin9226747832788493897
[2025-05-30 07:05:37] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9226747832788493897
Running compilation step : cd /tmp/ltsmin9226747832788493897;'/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/ltsmin9226747832788493897;'/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/ltsmin9226747832788493897;'/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-30 07:05:40] [INFO ] Flatten gal took : 33 ms
[2025-05-30 07:05:40] [INFO ] Flatten gal took : 47 ms
[2025-05-30 07:05:40] [INFO ] Time to serialize gal into /tmp/LTL4030896663180334356.gal : 10 ms
[2025-05-30 07:05:40] [INFO ] Time to serialize properties into /tmp/LTL12245852517040996065.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/LTL4030896663180334356.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13339338551992502045.hoa' '-atoms' '/tmp/LTL12245852517040996065.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12245852517040996065.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13339338551992502045.hoa
Detected timeout of ITS tools.
[2025-05-30 07:05:55] [INFO ] Flatten gal took : 28 ms
[2025-05-30 07:05:55] [INFO ] Flatten gal took : 39 ms
[2025-05-30 07:05:55] [INFO ] Time to serialize gal into /tmp/LTL894948700629336035.gal : 6 ms
[2025-05-30 07:05:55] [INFO ] Time to serialize properties into /tmp/LTL18280088195647022673.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/LTL894948700629336035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18280088195647022673.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(("(p311==0)")||(X(X(X(X(("(p311!=1)")U(("((p1058!=1)&&(p311!=1))")||(G("(p311!=1)"))))))))))))
Formula 0 simplified : GF(!"(p311==0)" & XXXX(!"(p311!=1)" M !"((p1058!=1)&&(p311!=1))"))
Detected timeout of ITS tools.
[2025-05-30 07:06:10] [INFO ] Flatten gal took : 27 ms
[2025-05-30 07:06:10] [INFO ] Applying decomposition
[2025-05-30 07:06:10] [INFO ] Flatten gal took : 28 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/graph7547897732163249736.txt' '-o' '/tmp/graph7547897732163249736.bin' '-w' '/tmp/graph7547897732163249736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7547897732163249736.bin' '-l' '-1' '-v' '-w' '/tmp/graph7547897732163249736.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:06:10] [INFO ] Decomposing Gal with order
[2025-05-30 07:06:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:06:10] [INFO ] Removed a total of 500 redundant transitions.
[2025-05-30 07:06:10] [INFO ] Flatten gal took : 65 ms
[2025-05-30 07:06:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 17 ms.
[2025-05-30 07:06:10] [INFO ] Time to serialize gal into /tmp/LTL17177107515446078858.gal : 14 ms
[2025-05-30 07:06:10] [INFO ] Time to serialize properties into /tmp/LTL18263041190026130094.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/LTL17177107515446078858.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18263041190026130094.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(("(i4.i0.i0.u55.p311==0)")||(X(X(X(X(("(i4.i0.i0.u55.p311!=1)")U(("((i16.u245.p1058!=1)&&(i4.i0.i0.u55.p311!=1))")||(G("(i4.i0....183
Formula 0 simplified : GF(!"(i4.i0.i0.u55.p311==0)" & XXXX(!"(i4.i0.i0.u55.p311!=1)" M !"((i16.u245.p1058!=1)&&(i4.i0.i0.u55.p311!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t26, t194, t277, t308, t337, t386, t459, t508, t669, t698, t750, t781, t810, t859, t982, t114...2072
Computing Next relation with stutter on 49920 deadlock states
102 unique states visited
102 strongly connected components in search stack
103 transitions explored
102 items max in DFS search stack
923 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,9.43764,400896,1,0,795152,8156,22538,2.21061e+06,567,47613,1352775
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-307-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-307-LTLFireability-08 finished in 263442 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 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Graph (trivial) has 1885 edges and 1541 vertex of which 700 / 1541 are part of one of the 63 SCC in 2 ms
Free SCC test removed 637 places
Ensure Unique test removed 740 transitions
Reduce isomorphic transitions removed 740 transitions.
Graph (complete) has 1406 edges and 904 vertex of which 896 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 490 place count 895 transition count 742
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 512 rules applied. Total rules applied 1002 place count 407 transition count 718
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1015 place count 395 transition count 717
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1016 place count 394 transition count 717
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1016 place count 394 transition count 671
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1108 place count 348 transition count 671
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1126 place count 330 transition count 644
Iterating global reduction 4 with 18 rules applied. Total rules applied 1144 place count 330 transition count 644
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1144 place count 330 transition count 643
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1146 place count 329 transition count 643
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1161 place count 314 transition count 621
Iterating global reduction 4 with 15 rules applied. Total rules applied 1176 place count 314 transition count 621
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 1184 place count 314 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1185 place count 313 transition count 613
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1189 place count 309 transition count 605
Iterating global reduction 6 with 4 rules applied. Total rules applied 1193 place count 309 transition count 605
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1194 place count 309 transition count 604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1195 place count 308 transition count 604
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1197 place count 306 transition count 600
Iterating global reduction 8 with 2 rules applied. Total rules applied 1199 place count 306 transition count 600
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1201 place count 304 transition count 596
Iterating global reduction 8 with 2 rules applied. Total rules applied 1203 place count 304 transition count 596
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1205 place count 302 transition count 592
Iterating global reduction 8 with 2 rules applied. Total rules applied 1207 place count 302 transition count 592
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1209 place count 300 transition count 588
Iterating global reduction 8 with 2 rules applied. Total rules applied 1211 place count 300 transition count 588
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1212 place count 299 transition count 581
Iterating global reduction 8 with 1 rules applied. Total rules applied 1213 place count 299 transition count 581
Performed 143 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 8 with 286 rules applied. Total rules applied 1499 place count 156 transition count 356
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1512 place count 156 transition count 343
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1516 place count 152 transition count 334
Iterating global reduction 9 with 4 rules applied. Total rules applied 1520 place count 152 transition count 334
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1544 place count 140 transition count 320
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1558 place count 140 transition count 306
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1592 place count 123 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 1609 place count 123 transition count 323
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1618 place count 114 transition count 305
Iterating global reduction 11 with 9 rules applied. Total rules applied 1627 place count 114 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1633 place count 114 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 12 with 36 rules applied. Total rules applied 1669 place count 114 transition count 263
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1670 place count 114 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1671 place count 114 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1672 place count 113 transition count 261
Applied a total of 1672 rules in 71 ms. Remains 113 /1541 variables (removed 1428) and now considering 261/1976 (removed 1715) transitions.
[2025-05-30 07:06:22] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 113 cols
[2025-05-30 07:06:22] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:06:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-30 07:06:22] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2025-05-30 07:06:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:06:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 07:06:22] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [8, 41, 74]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 171 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/1541 places, 261/1976 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 107 transition count 258
Applied a total of 3 rules in 6 ms. Remains 107 /110 variables (removed 3) and now considering 258/261 (removed 3) transitions.
[2025-05-30 07:06:22] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
// Phase 1: matrix 201 rows 107 cols
[2025-05-30 07:06:22] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:06:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 07:06:22] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
[2025-05-30 07:06:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:06:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 07:06:22] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/1541 places, 258/1976 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 370 ms. Remains : 107/1541 places, 258/1976 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-10
Stuttering criterion allowed to conclude after 1016 steps with 120 reset in 8 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-10 finished in 469 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)&&F(p1)))&&(G(p2)||(p2&&F(!p1)))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1523 transition count 1956
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1523 transition count 1956
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1523 transition count 1955
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 47 place count 1513 transition count 1942
Iterating global reduction 1 with 10 rules applied. Total rules applied 57 place count 1513 transition count 1942
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 1508 transition count 1936
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 1508 transition count 1936
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 1508 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1507 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1507 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1506 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1506 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 1505 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 1505 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 1504 transition count 1928
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1504 transition count 1928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 1504 transition count 1927
Applied a total of 78 rules in 474 ms. Remains 1504 /1541 variables (removed 37) and now considering 1927/1976 (removed 49) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2025-05-30 07:06:23] [INFO ] Computed 3 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:06:23] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 07:06:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:06:24] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2025-05-30 07:06:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60428ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1541 places, 1927/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62030 ms. Remains : 1504/1541 places, 1927/1976 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1)), (AND p1 (NOT p2)), (NOT p0), (NOT p1), p1]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-11
Stuttering criterion allowed to conclude after 77 steps with 1 reset in 1 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-11 finished in 62342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0)) U G(p1)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1525 transition count 1958
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1525 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1525 transition count 1957
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 1516 transition count 1945
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 1516 transition count 1945
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 1512 transition count 1940
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 1512 transition count 1940
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 1512 transition count 1938
Applied a total of 61 rules in 249 ms. Remains 1512 /1541 variables (removed 29) and now considering 1938/1976 (removed 38) transitions.
// Phase 1: matrix 1938 rows 1512 cols
[2025-05-30 07:07:25] [INFO ] Computed 3 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:07:25] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-05-30 07:07:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:07:26] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2025-05-30 07:07:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1541 places, 1938/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61759 ms. Remains : 1512/1541 places, 1938/1976 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-12
Product exploration explored 100000 steps with 844 reset in 148 ms.
Product exploration explored 100000 steps with 847 reset in 149 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2111 edges and 1512 vertex of which 1504 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (340 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (96 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (106 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 407678 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 2
Probabilistic random walk after 407678 steps, saw 93745 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2025-05-30 07:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1487/1489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1920/3409 variables, 1489/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3409 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/3416 variables, 5/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/3422 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3422 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/3428 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3428 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/3434 variables, 3/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3434 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/3437 variables, 2/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3437 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3439 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3439 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3441 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3441 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3443 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3443 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3445 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3445 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3447 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3447 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3449 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3449 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3450 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3450/3450 variables, and 1515 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4624 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1487/1489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1920/3409 variables, 1489/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3409 variables, 2/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3409 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/3416 variables, 5/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/3422 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3428 variables, 3/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/3434 variables, 3/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/3437 variables, 2/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3449 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3450/3450 variables, and 1517 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3608 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8239ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=56 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 1512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1512/1512 places, 1938/1938 transitions.
Applied a total of 0 rules in 59 ms. Remains 1512 /1512 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
[2025-05-30 07:08:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:08:39] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-05-30 07:08:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:08:40] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2025-05-30 07:08:40] [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: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Finished structural reductions in LTL mode , in 1 iterations and 61545 ms. Remains : 1512/1512 places, 1938/1938 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2111 edges and 1512 vertex of which 1504 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (326 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (99 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (99 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 407659 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 2
Probabilistic random walk after 407659 steps, saw 93738 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2025-05-30 07:09:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1487/1489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1920/3409 variables, 1489/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3409 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/3416 variables, 5/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/3422 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3422 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/3428 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3428 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/3434 variables, 3/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3434 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/3437 variables, 2/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3437 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3439 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3439 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3441 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3441 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3443 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3443 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3445 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3445 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3447 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3447 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3449 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3449 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3450 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3450/3450 variables, and 1515 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4856 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1487/1489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1920/3409 variables, 1489/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3409 variables, 2/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3409 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/3416 variables, 5/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/3422 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3428 variables, 3/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/3434 variables, 3/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/3437 variables, 2/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3449 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3450/3450 variables, and 1517 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3626 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8491ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 296 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=148 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 829 reset in 137 ms.
Product exploration explored 100000 steps with 864 reset in 148 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 1512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1512/1512 places, 1938/1938 transitions.
Graph (trivial) has 1848 edges and 1512 vertex of which 693 / 1512 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1373 edges and 882 vertex of which 874 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 874 transition count 1201
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 490 place count 874 transition count 1189
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 490 place count 874 transition count 1201
Deduced a syphon composed of 497 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 511 place count 874 transition count 1201
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 793 place count 592 transition count 909
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 2 with 282 rules applied. Total rules applied 1075 place count 592 transition count 909
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1087 place count 580 transition count 893
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1099 place count 580 transition count 893
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1105 place count 580 transition count 887
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1117 place count 568 transition count 875
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1129 place count 568 transition count 875
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1131 place count 566 transition count 871
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 566 transition count 871
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1135 place count 564 transition count 867
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 564 transition count 867
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1141 place count 560 transition count 863
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1145 place count 560 transition count 863
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1147 place count 558 transition count 859
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1149 place count 558 transition count 859
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 556 transition count 855
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 556 transition count 855
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1157 place count 552 transition count 849
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1161 place count 552 transition count 849
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 548 transition count 833
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 548 transition count 833
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1170 place count 548 transition count 833
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1174 place count 544 transition count 829
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1178 place count 544 transition count 829
Performed 107 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 319 places in 0 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1285 place count 544 transition count 907
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1324 place count 544 transition count 868
Discarding 102 places :
Symmetric choice reduction at 5 with 102 rule applications. Total rules 1426 place count 442 transition count 756
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 102 rules applied. Total rules applied 1528 place count 442 transition count 756
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1534 place count 436 transition count 747
Deduced a syphon composed of 221 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1540 place count 436 transition count 747
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1547 place count 436 transition count 747
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1551 place count 436 transition count 743
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1566 place count 421 transition count 724
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1581 place count 421 transition count 724
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1587 place count 421 transition count 718
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1591 place count 417 transition count 714
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1595 place count 417 transition count 714
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1598 place count 417 transition count 714
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1604 place count 417 transition count 708
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1607 place count 414 transition count 705
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1610 place count 414 transition count 705
Performed 71 Post agglomeration using F-continuation condition with reduction of 111 identical transitions.
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 8 with 71 rules applied. Total rules applied 1681 place count 414 transition count 1030
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 8 with 125 rules applied. Total rules applied 1806 place count 414 transition count 905
Discarding 125 places :
Symmetric choice reduction at 9 with 125 rule applications. Total rules 1931 place count 289 transition count 577
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 9 with 125 rules applied. Total rules applied 2056 place count 289 transition count 577
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2071 place count 289 transition count 562
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2098 place count 262 transition count 504
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2125 place count 262 transition count 504
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2128 place count 262 transition count 548
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2132 place count 262 transition count 544
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2136 place count 258 transition count 516
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2140 place count 258 transition count 516
Deduced a syphon composed of 140 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 11 with 44 rules applied. Total rules applied 2184 place count 258 transition count 472
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2188 place count 254 transition count 468
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2192 place count 254 transition count 468
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2195 place count 254 transition count 528
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2198 place count 251 transition count 513
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2201 place count 251 transition count 513
Deduced a syphon composed of 136 places in 0 ms
Applied a total of 2201 rules in 196 ms. Remains 251 /1512 variables (removed 1261) and now considering 513/1938 (removed 1425) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:09:54] [INFO ] Redundant transitions in 12 ms returned []
Running 512 sub problems to find dead transitions.
[2025-05-30 07:09:54] [INFO ] Flow matrix only has 456 transitions (discarded 57 similar events)
// Phase 1: matrix 456 rows 251 cols
[2025-05-30 07:09:54] [INFO ] Computed 0 invariants in 1 ms
[2025-05-30 07:09:54] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
At refinement iteration 1 (OVERLAPS) 455/705 variables, 250/250 constraints. Problems are: Problem set: 247 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/705 variables, 2/252 constraints. Problems are: Problem set: 247 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 0/252 constraints. Problems are: Problem set: 247 solved, 265 unsolved
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/706 variables, 1/253 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/706 variables, 0/253 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/707 variables, 1/254 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 0/254 constraints. Problems are: Problem set: 252 solved, 260 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 707/707 variables, and 254 constraints, problems are : Problem set: 252 solved, 260 unsolved in 30019 ms.
Refiners :[State Equation: 251/251 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 252 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 452/566 variables, 114/114 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 2/116 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 260/376 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/376 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 140/706 variables, 137/513 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/706 variables, 0/513 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/707 variables, 1/514 constraints. Problems are: Problem set: 252 solved, 260 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 707/707 variables, and 514 constraints, problems are : Problem set: 252 solved, 260 unsolved in 30011 ms.
Refiners :[State Equation: 251/251 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 260/512 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 252 solved, 260 unsolved
Search for dead transitions found 252 dead transitions in 60119ms
Found 252 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 252 transitions
Dead transitions reduction (with SMT) removed 252 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 251/1512 places, 261/1938 transitions.
Graph (complete) has 403 edges and 251 vertex of which 115 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.0 ms
Discarding 136 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 108 transition count 243
Applied a total of 8 rules in 3 ms. Remains 108 /251 variables (removed 143) and now considering 243/261 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/1512 places, 243/1938 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60341 ms. Remains : 108/1512 places, 243/1938 transitions.
Built C files in :
/tmp/ltsmin15379794583009261931
[2025-05-30 07:10:54] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15379794583009261931
Running compilation step : cd /tmp/ltsmin15379794583009261931;'/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/ltsmin15379794583009261931;'/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/ltsmin15379794583009261931;'/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 2 out of 1512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1512/1512 places, 1938/1938 transitions.
Applied a total of 0 rules in 65 ms. Remains 1512 /1512 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
// Phase 1: matrix 1938 rows 1512 cols
[2025-05-30 07:10:57] [INFO ] Computed 3 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:10:57] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-05-30 07:10:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:10:58] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2025-05-30 07:10:58] [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: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Finished structural reductions in LTL mode , in 1 iterations and 61578 ms. Remains : 1512/1512 places, 1938/1938 transitions.
Built C files in :
/tmp/ltsmin8644743327874850666
[2025-05-30 07:11:59] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8644743327874850666
Running compilation step : cd /tmp/ltsmin8644743327874850666;'/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/ltsmin8644743327874850666;'/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/ltsmin8644743327874850666;'/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-30 07:12:02] [INFO ] Flatten gal took : 26 ms
[2025-05-30 07:12:02] [INFO ] Flatten gal took : 25 ms
[2025-05-30 07:12:02] [INFO ] Time to serialize gal into /tmp/LTL14443289204430859505.gal : 5 ms
[2025-05-30 07:12:02] [INFO ] Time to serialize properties into /tmp/LTL12862723195601722883.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/LTL14443289204430859505.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15491072962830318501.hoa' '-atoms' '/tmp/LTL12862723195601722883.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12862723195601722883.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15491072962830318501.hoa
Detected timeout of ITS tools.
[2025-05-30 07:12:17] [INFO ] Flatten gal took : 27 ms
[2025-05-30 07:12:17] [INFO ] Flatten gal took : 28 ms
[2025-05-30 07:12:17] [INFO ] Time to serialize gal into /tmp/LTL13604269547350580046.gal : 6 ms
[2025-05-30 07:12:17] [INFO ] Time to serialize properties into /tmp/LTL5492401810745356892.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/LTL13604269547350580046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5492401810745356892.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(p764!=1)")))U(G("(p2339!=1)"))))))
Formula 0 simplified : XX(GF!"(p764!=1)" R F!"(p2339!=1)")
Detected timeout of ITS tools.
[2025-05-30 07:12:32] [INFO ] Flatten gal took : 39 ms
[2025-05-30 07:12:32] [INFO ] Applying decomposition
[2025-05-30 07:12:32] [INFO ] Flatten gal took : 25 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/graph7657060489555522335.txt' '-o' '/tmp/graph7657060489555522335.bin' '-w' '/tmp/graph7657060489555522335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7657060489555522335.bin' '-l' '-1' '-v' '-w' '/tmp/graph7657060489555522335.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:12:32] [INFO ] Decomposing Gal with order
[2025-05-30 07:12:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:12:32] [INFO ] Removed a total of 507 redundant transitions.
[2025-05-30 07:12:32] [INFO ] Flatten gal took : 66 ms
[2025-05-30 07:12:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 21 ms.
[2025-05-30 07:12:32] [INFO ] Time to serialize gal into /tmp/LTL11541721516528928473.gal : 15 ms
[2025-05-30 07:12:32] [INFO ] Time to serialize properties into /tmp/LTL7838216093003928595.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/LTL11541721516528928473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7838216093003928595.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(i10.i0.i1.u161.p764!=1)")))U(G("(i35.i2.i0.u561.p2339!=1)"))))))
Formula 0 simplified : XX(GF!"(i10.i0.i1.u161.p764!=1)" R F!"(i35.i2.i0.u561.p2339!=1)")
Reverse transition relation is NOT exact ! Due to transitions t26, t194, t277, t337, t386, t459, t508, t698, t750, t781, t810, t859, t982, t1176, t1230, t1...2012
Computing Next relation with stutter on 49920 deadlock states
38 unique states visited
38 strongly connected components in search stack
40 transitions explored
38 items max in DFS search stack
445 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,4.61897,184936,1,0,295799,6873,22060,528280,557,36956,1540469
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-307-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-307-LTLFireability-12 finished in 312764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1524 transition count 1957
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1524 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1524 transition count 1956
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 1514 transition count 1943
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 1514 transition count 1943
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 1509 transition count 1937
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 1509 transition count 1937
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 1509 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1508 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1508 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1507 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1507 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1506 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1506 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 1505 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 1505 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 1505 transition count 1928
Applied a total of 76 rules in 480 ms. Remains 1505 /1541 variables (removed 36) and now considering 1928/1976 (removed 48) transitions.
// Phase 1: matrix 1928 rows 1505 cols
[2025-05-30 07:12:38] [INFO ] Computed 3 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:12:38] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-05-30 07:12:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:12:39] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 07:12:39] [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: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1541 places, 1928/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62001 ms. Remains : 1505/1541 places, 1928/1976 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-13
Product exploration explored 100000 steps with 2792 reset in 149 ms.
Product exploration explored 100000 steps with 2800 reset in 151 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2101 edges and 1505 vertex of which 1497 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Detected a total of 26/1505 stabilizing places and 28/1928 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 138 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 3
RANDOM walk for 40000 steps (339 resets) in 60 ms. (655 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (102 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2025-05-30 07:13:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
After SMT solving in domain Real declared 2/3433 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 328 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-05-30 07:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 07:13:41] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 12 ms returned sat
[2025-05-30 07:13:42] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2025-05-30 07:13:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 07:13:42] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 12 ms returned sat
[2025-05-30 07:13:43] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2025-05-30 07:13:43] [INFO ] Computed and/alt/rep : 1921/2347/1921 causal constraints (skipped 6 transitions) in 76 ms.
[2025-05-30 07:13:56] [INFO ] Added : 706 causal constraints over 142 iterations in 12463 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 1505 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1505/1505 places, 1928/1928 transitions.
Graph (trivial) has 1839 edges and 1505 vertex of which 693 / 1505 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1363 edges and 875 vertex of which 867 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 470 transitions
Trivial Post-agglo rules discarded 470 transitions
Performed 470 trivial Post agglomeration. Transition count delta: 470
Iterating post reduction 0 with 470 rules applied. Total rules applied 472 place count 866 transition count 720
Reduce places removed 470 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 494 rules applied. Total rules applied 966 place count 396 transition count 696
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 979 place count 384 transition count 695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 980 place count 383 transition count 695
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 980 place count 383 transition count 648
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1074 place count 336 transition count 648
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1090 place count 320 transition count 622
Iterating global reduction 4 with 16 rules applied. Total rules applied 1106 place count 320 transition count 622
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1109 place count 320 transition count 619
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1112 place count 317 transition count 619
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1122 place count 307 transition count 605
Iterating global reduction 6 with 10 rules applied. Total rules applied 1132 place count 307 transition count 605
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1138 place count 307 transition count 599
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1140 place count 305 transition count 595
Iterating global reduction 7 with 2 rules applied. Total rules applied 1142 place count 305 transition count 595
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1144 place count 303 transition count 591
Iterating global reduction 7 with 2 rules applied. Total rules applied 1146 place count 303 transition count 591
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1148 place count 301 transition count 587
Iterating global reduction 7 with 2 rules applied. Total rules applied 1150 place count 301 transition count 587
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1152 place count 299 transition count 583
Iterating global reduction 7 with 2 rules applied. Total rules applied 1154 place count 299 transition count 583
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1156 place count 297 transition count 579
Iterating global reduction 7 with 2 rules applied. Total rules applied 1158 place count 297 transition count 579
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1160 place count 295 transition count 565
Iterating global reduction 7 with 2 rules applied. Total rules applied 1162 place count 295 transition count 565
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1163 place count 295 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1164 place count 294 transition count 564
Performed 136 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 9 with 272 rules applied. Total rules applied 1436 place count 158 transition count 350
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 12 rules applied. Total rules applied 1448 place count 158 transition count 338
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1450 place count 157 transition count 337
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1454 place count 153 transition count 332
Iterating global reduction 11 with 4 rules applied. Total rules applied 1458 place count 153 transition count 332
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1482 place count 141 transition count 317
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1494 place count 141 transition count 305
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1528 place count 124 transition count 339
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1545 place count 124 transition count 322
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1554 place count 115 transition count 304
Iterating global reduction 13 with 9 rules applied. Total rules applied 1563 place count 115 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1569 place count 115 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 1605 place count 115 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1606 place count 114 transition count 261
Applied a total of 1606 rules in 68 ms. Remains 114 /1505 variables (removed 1391) and now considering 261/1928 (removed 1667) transitions.
[2025-05-30 07:13:56] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 114 cols
[2025-05-30 07:13:56] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:13:56] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-30 07:13:56] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2025-05-30 07:13:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:13:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 07:13:56] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [8, 44, 77]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 187 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/1505 places, 261/1928 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 259
Applied a total of 2 rules in 3 ms. Remains 109 /111 variables (removed 2) and now considering 259/261 (removed 2) transitions.
[2025-05-30 07:13:56] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
// Phase 1: matrix 202 rows 109 cols
[2025-05-30 07:13:56] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:13:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-05-30 07:13:56] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2025-05-30 07:13:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:13:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 07:13:56] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/1505 places, 259/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 409 ms. Remains : 109/1505 places, 259/1928 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Detected a total of 3/109 stabilizing places and 17/259 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 551 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 3
RANDOM walk for 40000 steps (4463 resets) in 84 ms. (470 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (975 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
[2025-05-30 07:13:57] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2025-05-30 07:13:57] [INFO ] Invariant cache hit.
[2025-05-30 07:13:57] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
After SMT solving in domain Real declared 2/311 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 12 ms.
Refiners :[State Equation: 0/109 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 684 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-05-30 07:13:58] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2025-05-30 07:13:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 07:13:58] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-05-30 07:13:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 07:13:58] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-05-30 07:13:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 07:13:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-05-30 07:13:58] [INFO ] Computed and/alt/rep : 149/241/149 causal constraints (skipped 45 transitions) in 9 ms.
[2025-05-30 07:13:58] [INFO ] Added : 1 causal constraints over 1 iterations in 33 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-13 finished in 80524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(G(p0))) U (p1 U p2)))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1976/1976 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1524 transition count 1957
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1524 transition count 1957
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1514 transition count 1944
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1514 transition count 1944
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 1509 transition count 1938
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 1509 transition count 1938
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 1509 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 1508 transition count 1935
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 1508 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 1507 transition count 1933
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 1507 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 1506 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 1506 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 1505 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 1505 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 1505 transition count 1929
Applied a total of 75 rules in 480 ms. Remains 1505 /1541 variables (removed 36) and now considering 1929/1976 (removed 47) transitions.
// Phase 1: matrix 1929 rows 1505 cols
[2025-05-30 07:13:58] [INFO ] Computed 3 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:13:59] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-05-30 07:13:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:14:00] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2025-05-30 07:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3434 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3434 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60398ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1541 places, 1929/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61970 ms. Remains : 1505/1541 places, 1929/1976 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-14 finished in 62180 ms.
All properties solved by simple procedures.
Total runtime 1390709 ms.

BK_STOP 1748589300679

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-307"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-307, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028100260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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