Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.8M 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 CloudDeployment-PT-6b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-6b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748561198402

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 23:26:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 23:26:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 23:26:40] [INFO ] Load time of PNML (sax parser for PT used): 424 ms
[2025-05-29 23:26:40] [INFO ] Transformed 1888 places.
[2025-05-29 23:26:40] [INFO ] Transformed 6804 transitions.
[2025-05-29 23:26:40] [INFO ] Found NUPN structural information;
[2025-05-29 23:26:40] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 603 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudDeployment-PT-6b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-6b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 1888 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1881 transition count 6804
Discarding 521 places :
Symmetric choice reduction at 1 with 521 rule applications. Total rules 528 place count 1360 transition count 2200
Iterating global reduction 1 with 521 rules applied. Total rules applied 1049 place count 1360 transition count 2200
Discarding 197 places :
Symmetric choice reduction at 1 with 197 rule applications. Total rules 1246 place count 1163 transition count 2003
Iterating global reduction 1 with 197 rules applied. Total rules applied 1443 place count 1163 transition count 2003
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 1471 place count 1163 transition count 1975
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1492 place count 1142 transition count 1954
Iterating global reduction 2 with 21 rules applied. Total rules applied 1513 place count 1142 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1515 place count 1140 transition count 1952
Iterating global reduction 2 with 2 rules applied. Total rules applied 1517 place count 1140 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1518 place count 1139 transition count 1951
Iterating global reduction 2 with 1 rules applied. Total rules applied 1519 place count 1139 transition count 1951
Applied a total of 1519 rules in 1238 ms. Remains 1139 /1888 variables (removed 749) and now considering 1951/6804 (removed 4853) transitions.
// Phase 1: matrix 1951 rows 1139 cols
[2025-05-29 23:26:46] [INFO ] Computed 18 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:26:46] [INFO ] Implicit Places using invariants in 561 ms returned []
[2025-05-29 23:26:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:26:48] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned [12, 20, 188, 197, 366, 376, 544, 552, 721, 729, 898, 907]
[2025-05-29 23:26:48] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6703 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1138/1888 places, 1951/6804 transitions.
Applied a total of 0 rules in 38 ms. Remains 1138 /1138 variables (removed 0) and now considering 1951/1951 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7994 ms. Remains : 1138/1888 places, 1951/6804 transitions.
Support contains 32 out of 1138 places after structural reductions.
[2025-05-29 23:26:55] [INFO ] Flatten gal took : 186 ms
[2025-05-29 23:26:55] [INFO ] Flatten gal took : 127 ms
[2025-05-29 23:26:55] [INFO ] Input system was already deterministic with 1951 transitions.
RANDOM walk for 40000 steps (206 resets) in 1771 ms. (22 steps per ms) remains 7/17 properties
BEST_FIRST walk for 40004 steps (22 resets) in 311 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (21 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (20 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (23 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (25 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (24 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (21 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
// Phase 1: matrix 1951 rows 1138 cols
[2025-05-29 23:26:56] [INFO ] Computed 17 invariants in 17 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 117/131 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 127/258 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 963/1221 variables, 258/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1221 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 611/1832 variables, 256/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1832 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 553/2385 variables, 248/779 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2385 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 492/2877 variables, 229/1008 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2877 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 167/3044 variables, 119/1127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3044 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 33/3077 variables, 20/1147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3077 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 12/3089 variables, 8/1155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3089 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/3089 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3089/3089 variables, and 1155 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3061 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 1138/1138 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 117/131 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 127/258 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 963/1221 variables, 258/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1221 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 611/1832 variables, 256/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1832 variables, 7/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1832 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 553/2385 variables, 248/786 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2385 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 492/2877 variables, 229/1015 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2877 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 167/3044 variables, 119/1134 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3044 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 8163ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 1138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1138/1138 places, 1951/1951 transitions.
Graph (trivial) has 1165 edges and 1138 vertex of which 425 / 1138 are part of one of the 48 SCC in 5 ms
Free SCC test removed 377 places
Drop transitions (Empty/Sink Transition effects.) removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Graph (complete) has 3088 edges and 761 vertex of which 742 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.7 ms
Discarding 19 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 0 with 325 rules applied. Total rules applied 327 place count 742 transition count 1146
Reduce places removed 302 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 304 rules applied. Total rules applied 631 place count 440 transition count 1144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 633 place count 438 transition count 1144
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 633 place count 438 transition count 1079
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 763 place count 373 transition count 1079
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 774 place count 362 transition count 1068
Iterating global reduction 3 with 11 rules applied. Total rules applied 785 place count 362 transition count 1068
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 787 place count 362 transition count 1066
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 787 place count 362 transition count 1059
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 801 place count 355 transition count 1059
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 995 place count 258 transition count 962
Performed 35 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1065 place count 223 transition count 1178
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 1099 place count 223 transition count 1144
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1111 place count 217 transition count 1204
Drop transitions (Redundant composition of simpler transitions.) removed 153 transitions
Redundant transition composition rules discarded 153 transitions
Iterating global reduction 5 with 153 rules applied. Total rules applied 1264 place count 217 transition count 1051
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1266 place count 216 transition count 1064
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1267 place count 216 transition count 1063
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 1279 place count 216 transition count 1051
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 1339 place count 216 transition count 961
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 135 transitions
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 201 transitions.
Graph (complete) has 1273 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 262 rules applied. Total rules applied 1601 place count 155 transition count 760
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1602 place count 155 transition count 759
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1606 place count 151 transition count 730
Iterating global reduction 8 with 4 rules applied. Total rules applied 1610 place count 151 transition count 730
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 8 with 108 rules applied. Total rules applied 1718 place count 151 transition count 622
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1719 place count 151 transition count 622
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1720 place count 150 transition count 621
Applied a total of 1720 rules in 401 ms. Remains 150 /1138 variables (removed 988) and now considering 621/1951 (removed 1330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 150/1138 places, 621/1951 transitions.
RANDOM walk for 40000 steps (407 resets) in 653 ms. (61 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (49 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
[2025-05-29 23:27:05] [INFO ] Flow matrix only has 330 transitions (discarded 291 similar events)
// Phase 1: matrix 330 rows 150 cols
[2025-05-29 23:27:05] [INFO ] Computed 23 invariants in 1 ms
[2025-05-29 23:27:05] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/69 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/243 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/271 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:27:05] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:27:05] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 117/388 variables, 46/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 49/437 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/437 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 43/480 variables, 46/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 7/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/480 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 183 constraints, problems are : Problem set: 0 solved, 1 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 150/150 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/69 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 174/243 variables, 26/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/271 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 117/388 variables, 46/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 49/437 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/437 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 43/480 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 7/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/480 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/480 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 150/150 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 706ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 74 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 10 ms.
FORMULA CloudDeployment-PT-6b-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 167 stabilizing places and 659 stable transitions
Graph (complete) has 3735 edges and 1138 vertex of which 1119 are kept as prefixes of interest. Removing 19 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' '!(((G(p0)||X(p1)) U ((X(p2)||F(!p3)) U (G((X(p2)||F(!p3)))||(!p2&&(X(p2)||F(!p3)))))))'
Support contains 6 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1951/1951 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1122 transition count 1935
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1122 transition count 1935
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1122 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 1120 transition count 1931
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 1120 transition count 1931
Applied a total of 38 rules in 117 ms. Remains 1120 /1138 variables (removed 18) and now considering 1931/1951 (removed 20) transitions.
// Phase 1: matrix 1931 rows 1120 cols
[2025-05-29 23:27:06] [INFO ] Computed 17 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:27:07] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-29 23:27:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:27:09] [INFO ] Implicit Places using invariants and state equation in 1992 ms returned [19, 187, 195, 360, 368, 535, 543, 708, 716, 882, 890]
[2025-05-29 23:27:09] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2224 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1119/1138 places, 1931/1951 transitions.
Applied a total of 0 rules in 35 ms. Remains 1119 /1119 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2377 ms. Remains : 1119/1138 places, 1931/1951 transitions.
Stuttering acceptance computed with spot in 652 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3), (AND p3 (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p2) (NOT p0) (NOT p1) p3), p3, (AND p3 (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2)), (AND p3 (NOT p0) (NOT p2) p1), (AND p3 (NOT p0) (NOT p2) p1)]
Running random walk in product with property : CloudDeployment-PT-6b-LTLCardinality-00
Product exploration explored 100000 steps with 37512 reset in 713 ms.
Product exploration explored 100000 steps with 37578 reset in 520 ms.
Computed a total of 164 stabilizing places and 656 stable transitions
Graph (complete) has 3685 edges and 1119 vertex of which 1101 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.14 ms
Computed a total of 164 stabilizing places and 656 stable transitions
Detected a total of 164/1119 stabilizing places and 656/1931 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X p2), (X p3), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (AND p3 p0)), (X (AND p3 (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND p2 p0 (NOT p1))), (X (AND p3 p0 (NOT p1))), (X (NOT (AND (NOT p2) p3 p0))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (AND p3 p0))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (AND p3 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p2) p3 p0 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 49 factoid took 298 ms. Reduced automaton from 12 states, 30 edges and 4 AP (stutter sensitive) to 12 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 557 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3), (AND p3 (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p2) (NOT p0) (NOT p1) p3), p3, (AND p3 (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2)), (AND p3 (NOT p0) (NOT p2) p1), (AND p3 (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (197 resets) in 1305 ms. (30 steps per ms) remains 18/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
// Phase 1: matrix 1931 rows 1119 cols
[2025-05-29 23:27:12] [INFO ] Computed 16 invariants in 8 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 277/300 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 25/325 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 189/514 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 936/1450 variables, 315/363 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 600/2050 variables, 264/627 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2050 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 526/2576 variables, 234/861 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2576 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 348/2924 variables, 181/1042 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2924 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 104/3028 variables, 79/1121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3028 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 19/3047 variables, 11/1132 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3047 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (OVERLAPS) 3/3050 variables, 3/1135 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3050 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (OVERLAPS) 0/3050 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3050/3050 variables, and 1135 constraints, problems are : Problem set: 0 solved, 18 unsolved in 4713 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 1119/1119 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 277/300 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 25/325 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 189/514 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 936/1450 variables, 315/381 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 600/2050 variables, 264/645 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2050 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 526/2576 variables, 234/879 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2576 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 348/2924 variables, 181/1060 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2924/3050 variables, and 1060 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 1026/1119 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9781ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1119/1119 places, 1931/1931 transitions.
Graph (trivial) has 1157 edges and 1119 vertex of which 426 / 1119 are part of one of the 48 SCC in 2 ms
Free SCC test removed 378 places
Drop transitions (Empty/Sink Transition effects.) removed 484 transitions
Reduce isomorphic transitions removed 484 transitions.
Graph (complete) has 3031 edges and 741 vertex of which 723 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 299 transitions
Trivial Post-agglo rules discarded 299 transitions
Performed 299 trivial Post agglomeration. Transition count delta: 299
Iterating post reduction 0 with 321 rules applied. Total rules applied 323 place count 723 transition count 1126
Reduce places removed 299 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 300 rules applied. Total rules applied 623 place count 424 transition count 1125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 624 place count 423 transition count 1125
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 624 place count 423 transition count 1057
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 760 place count 355 transition count 1057
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 765 place count 350 transition count 1052
Iterating global reduction 3 with 5 rules applied. Total rules applied 770 place count 350 transition count 1052
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 770 place count 350 transition count 1047
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 780 place count 345 transition count 1047
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 972 place count 249 transition count 951
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -236
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1044 place count 213 transition count 1187
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 1088 place count 213 transition count 1143
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1100 place count 207 transition count 1203
Drop transitions (Redundant composition of simpler transitions.) removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 4 with 162 rules applied. Total rules applied 1262 place count 207 transition count 1041
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1322 place count 207 transition count 951
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 135 transitions
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 201 transitions.
Graph (complete) has 1262 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 262 rules applied. Total rules applied 1584 place count 146 transition count 750
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1585 place count 146 transition count 749
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1590 place count 141 transition count 713
Iterating global reduction 6 with 5 rules applied. Total rules applied 1595 place count 141 transition count 713
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 6 with 108 rules applied. Total rules applied 1703 place count 141 transition count 605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1704 place count 140 transition count 604
Applied a total of 1704 rules in 190 ms. Remains 140 /1119 variables (removed 979) and now considering 604/1931 (removed 1327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 140/1119 places, 604/1931 transitions.
RANDOM walk for 40000 steps (487 resets) in 279 ms. (142 steps per ms) remains 6/18 properties
BEST_FIRST walk for 40004 steps (56 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (54 resets) in 77 ms. (512 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (57 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (62 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (52 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
[2025-05-29 23:27:22] [INFO ] Flow matrix only has 319 transitions (discarded 285 similar events)
// Phase 1: matrix 319 rows 140 cols
[2025-05-29 23:27:22] [INFO ] Computed 23 invariants in 1 ms
[2025-05-29 23:27:22] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/126 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 300/426 variables, 126/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 16/442 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 9/451 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/459 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/459 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/459 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 171 constraints, problems are : Problem set: 0 solved, 4 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, ReadFeed: 8/8 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:27:23] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 21/126 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 300/426 variables, 126/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 16/442 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:27:23] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:27:23] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:27:23] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 9/451 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 8/459 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/459 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/459 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 179 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1502ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 5607 steps, including 216 resets, run visited all 2 properties in 17 ms. (steps per millisecond=329 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 92 ms.
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X p2), (X p3), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (AND p3 p0)), (X (AND p3 (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND p2 p0 (NOT p1))), (X (AND p3 p0 (NOT p1))), (X (NOT (AND (NOT p2) p3 p0))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (AND p3 p0))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (AND p3 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p2) p3 p0 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p3 p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p3) (NOT p0)))), (F (NOT p0)), (F (NOT (AND (NOT p1) p3))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT p2)), (F (NOT p3)), (F (NOT (AND (NOT p1) p3 p0))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR p1 p2 (NOT p3) (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p3) (NOT p0)))), (F (NOT (OR p2 (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p2 (NOT p3) p0))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p1 (NOT p3) p0))), (F (NOT (OR (NOT p1) p2 (NOT p3) p0))), (F (NOT (OR (NOT p3) p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p3) p0))), (F (NOT (OR p2 (NOT p3) p0))), (F (NOT (AND p2 p0))), (F (NOT (OR p1 (NOT p2) p0)))]
Knowledge based reduction with 49 factoid took 2118 ms. Reduced automaton from 12 states, 30 edges and 4 AP (stutter sensitive) to 12 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 540 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3), (AND p3 (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p2) (NOT p0) (NOT p1) p3), p3, (AND p3 (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2)), (AND p3 (NOT p0) (NOT p2) p1), (AND p3 (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 526 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3), (AND p3 (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p2) (NOT p0) (NOT p1) p3), p3, (AND p3 (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2)), (AND p3 (NOT p0) (NOT p2) p1), (AND p3 (NOT p0) (NOT p2) p1)]
Support contains 6 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 1931/1931 transitions.
Applied a total of 0 rules in 39 ms. Remains 1119 /1119 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
// Phase 1: matrix 1931 rows 1119 cols
[2025-05-29 23:27:27] [INFO ] Computed 16 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:27:27] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-05-29 23:27:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:27:29] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned [186, 194, 359, 367, 534, 542, 707, 715, 881, 889]
[2025-05-29 23:27:29] [INFO ] Actually due to overlaps returned [186]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2032 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1118/1119 places, 1931/1931 transitions.
Applied a total of 0 rules in 37 ms. Remains 1118 /1118 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2109 ms. Remains : 1118/1119 places, 1931/1931 transitions.
Computed a total of 164 stabilizing places and 656 stable transitions
Graph (complete) has 3665 edges and 1118 vertex of which 1101 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.5 ms
Computed a total of 164 stabilizing places and 656 stable transitions
Detected a total of 164/1118 stabilizing places and 656/1931 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (AND (NOT p1) p3 p0)), (X p3), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (AND p3 p0)), (X (AND (NOT p1) p3)), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p2) p3 p0))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p3 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p3 p0))), (X (X p3)), (X (X (NOT (AND p1 p3 p0)))), (X (X (AND p3 p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) p3))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND p1 (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 49 factoid took 305 ms. Reduced automaton from 12 states, 30 edges and 4 AP (stutter sensitive) to 12 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 549 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3), (AND p3 (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p2) (NOT p0) (NOT p1) p3), p3, (AND p3 (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2)), (AND p3 (NOT p0) (NOT p2) p1), (AND p3 (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (205 resets) in 375 ms. (106 steps per ms) remains 18/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
// Phase 1: matrix 1931 rows 1118 cols
[2025-05-29 23:27:30] [INFO ] Computed 15 invariants in 7 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 277/300 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 25/325 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 181/506 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 934/1440 variables, 309/356 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1440 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 606/2046 variables, 267/623 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2046 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 527/2573 variables, 235/858 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2573 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 350/2923 variables, 182/1040 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2923 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 104/3027 variables, 79/1119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3027 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 19/3046 variables, 11/1130 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3046 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (OVERLAPS) 3/3049 variables, 3/1133 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3049 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 18 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 3049/3049 variables, and 1133 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 1118/1118 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 277/300 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 25/325 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 181/506 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 934/1440 variables, 309/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1440 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 606/2046 variables, 267/641 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2046 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 527/2573 variables, 235/876 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2573 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 350/2923 variables, 182/1058 constraints. Problems are: Problem set: 0 solved, 18 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 2923/3049 variables, and 1058 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 1025/1118 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10049ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1118/1118 places, 1931/1931 transitions.
Graph (trivial) has 1156 edges and 1118 vertex of which 426 / 1118 are part of one of the 48 SCC in 3 ms
Free SCC test removed 378 places
Drop transitions (Empty/Sink Transition effects.) removed 485 transitions
Reduce isomorphic transitions removed 485 transitions.
Graph (complete) has 3011 edges and 740 vertex of which 723 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 299 transitions
Trivial Post-agglo rules discarded 299 transitions
Performed 299 trivial Post agglomeration. Transition count delta: 299
Iterating post reduction 0 with 320 rules applied. Total rules applied 322 place count 723 transition count 1126
Reduce places removed 299 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 300 rules applied. Total rules applied 622 place count 424 transition count 1125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 623 place count 423 transition count 1125
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 623 place count 423 transition count 1057
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 759 place count 355 transition count 1057
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 764 place count 350 transition count 1052
Iterating global reduction 3 with 5 rules applied. Total rules applied 769 place count 350 transition count 1052
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 769 place count 350 transition count 1047
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 779 place count 345 transition count 1047
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 971 place count 249 transition count 951
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -236
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1043 place count 213 transition count 1187
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 1087 place count 213 transition count 1143
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1099 place count 207 transition count 1203
Drop transitions (Redundant composition of simpler transitions.) removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 4 with 162 rules applied. Total rules applied 1261 place count 207 transition count 1041
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1321 place count 207 transition count 951
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 135 transitions
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 201 transitions.
Graph (complete) has 1262 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 262 rules applied. Total rules applied 1583 place count 146 transition count 750
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1584 place count 146 transition count 749
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1589 place count 141 transition count 713
Iterating global reduction 6 with 5 rules applied. Total rules applied 1594 place count 141 transition count 713
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 6 with 108 rules applied. Total rules applied 1702 place count 141 transition count 605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1703 place count 140 transition count 604
Applied a total of 1703 rules in 158 ms. Remains 140 /1118 variables (removed 978) and now considering 604/1931 (removed 1327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 140/1118 places, 604/1931 transitions.
RANDOM walk for 40000 steps (477 resets) in 385 ms. (103 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40003 steps (53 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (54 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (53 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
[2025-05-29 23:27:41] [INFO ] Flow matrix only has 319 transitions (discarded 285 similar events)
// Phase 1: matrix 319 rows 140 cols
[2025-05-29 23:27:41] [INFO ] Computed 23 invariants in 3 ms
[2025-05-29 23:27:41] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/126 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 300/426 variables, 126/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 16/442 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 9/451 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/459 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/459 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/459 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 171 constraints, problems are : Problem set: 0 solved, 4 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, ReadFeed: 8/8 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:27:41] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 21/126 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 300/426 variables, 126/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 16/442 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 9/451 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/451 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 8/459 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/459 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/459 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/459 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 176 constraints, problems are : Problem set: 0 solved, 4 unsolved in 791 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 97 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=97 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 41 ms.
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (AND (NOT p1) p3 p0)), (X p3), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (AND p3 p0)), (X (AND (NOT p1) p3)), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p2) p3 p0))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p3 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p3 p0))), (X (X p3)), (X (X (NOT (AND p1 p3 p0)))), (X (X (AND p3 p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) p3))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND p1 (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p3))), (F p1), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (AND p0 p3))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3) p2))), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR p0 p1 (NOT p3)))), (F (NOT (OR (NOT p3) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (AND p0 (NOT p1) p3))), (F (NOT (OR p0 (NOT p1) (NOT p3) p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1 (NOT p3) p2))), (F (NOT (OR p0 p1 (NOT p3) p2))), (F (NOT (OR p1 (NOT p3) p2))), (F (NOT (OR (NOT p0) (NOT p3) p2))), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p3) p2))), (F (NOT (OR p0 (NOT p3))))]
Knowledge based reduction with 49 factoid took 2044 ms. Reduced automaton from 12 states, 30 edges and 4 AP (stutter sensitive) to 12 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 531 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3), (AND p3 (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p2) (NOT p0) (NOT p1) p3), p3, (AND p3 (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2)), (AND p3 (NOT p0) (NOT p2) p1), (AND p3 (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 498 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3), (AND p3 (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p2) (NOT p0) (NOT p1) p3), p3, (AND p3 (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2)), (AND p3 (NOT p0) (NOT p2) p1), (AND p3 (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 521 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3), (AND p3 (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p2) (NOT p0) (NOT p1) p3), p3, (AND p3 (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2)), (AND p3 (NOT p0) (NOT p2) p1), (AND p3 (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 37418 reset in 455 ms.
Product exploration explored 100000 steps with 37485 reset in 469 ms.
Applying partial POR strategy [false, true, true, true, false, false, true, true, false, true, true, false]
Stuttering acceptance computed with spot in 553 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3), (AND p3 (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p2) (NOT p0) (NOT p1) p3), p3, (AND p3 (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2)), (AND p3 (NOT p0) (NOT p2) p1), (AND p3 (NOT p0) (NOT p2) p1)]
Support contains 6 out of 1118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1118/1118 places, 1931/1931 transitions.
Graph (trivial) has 1156 edges and 1118 vertex of which 426 / 1118 are part of one of the 48 SCC in 3 ms
Free SCC test removed 378 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Graph (complete) has 3160 edges and 740 vertex of which 723 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.4 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 294 rules applied. Total rules applied 296 place count 723 transition count 1497
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 296 place count 723 transition count 1533
Deduced a syphon composed of 337 places in 1 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 339 place count 723 transition count 1533
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 496 place count 566 transition count 1376
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 653 place count 566 transition count 1376
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 300 places in 0 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 773 place count 566 transition count 1376
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 861 place count 478 transition count 1288
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 949 place count 478 transition count 1288
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -244
Deduced a syphon composed of 247 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 984 place count 478 transition count 1532
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 990 place count 478 transition count 1526
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1031 place count 437 transition count 1393
Deduced a syphon composed of 206 places in 1 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 1072 place count 437 transition count 1393
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 1078 place count 437 transition count 1465
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1084 place count 431 transition count 1453
Deduced a syphon composed of 206 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 1090 place count 431 transition count 1453
Deduced a syphon composed of 206 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 88 transitions
Redundant transition composition rules discarded 88 transitions
Iterating global reduction 2 with 88 rules applied. Total rules applied 1178 place count 431 transition count 1365
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1189 place count 420 transition count 1354
Deduced a syphon composed of 195 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1200 place count 420 transition count 1354
Deduced a syphon composed of 195 places in 0 ms
Applied a total of 1200 rules in 244 ms. Remains 420 /1118 variables (removed 698) and now considering 1354/1931 (removed 577) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:27:48] [INFO ] Redundant transitions in 789 ms returned []
Running 1353 sub problems to find dead transitions.
[2025-05-29 23:27:48] [INFO ] Flow matrix only has 1127 transitions (discarded 227 similar events)
// Phase 1: matrix 1127 rows 420 cols
[2025-05-29 23:27:48] [INFO ] Computed 6 invariants in 5 ms
[2025-05-29 23:27:48] [INFO ] State equation strengthened by 336 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 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 TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 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 TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
At refinement iteration 2 (OVERLAPS) 1126/1545 variables, 419/425 constraints. Problems are: Problem set: 255 solved, 1098 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1545 variables, 335/760 constraints. Problems are: Problem set: 255 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1545/1547 variables, and 760 constraints, problems are : Problem set: 255 solved, 1098 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 419/420 constraints, ReadFeed: 335/336 constraints, PredecessorRefiner: 1353/884 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 255 solved, 1098 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 255 solved, 1098 unsolved
At refinement iteration 1 (OVERLAPS) 14/238 variables, 6/6 constraints. Problems are: Problem set: 255 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 255 solved, 1098 unsolved
At refinement iteration 3 (OVERLAPS) 1108/1346 variables, 238/244 constraints. Problems are: Problem set: 255 solved, 1098 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1346 variables, 335/579 constraints. Problems are: Problem set: 255 solved, 1098 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1346 variables, 629/1208 constraints. Problems are: Problem set: 255 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1346/1547 variables, and 1208 constraints, problems are : Problem set: 255 solved, 1098 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 238/420 constraints, ReadFeed: 335/336 constraints, PredecessorRefiner: 1098/884 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61860ms problems are : Problem set: 255 solved, 1098 unsolved
Search for dead transitions found 255 dead transitions in 61867ms
Found 255 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 255 transitions
Dead transitions reduction (with SMT) removed 255 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 420/1118 places, 1099/1931 transitions.
Graph (complete) has 2391 edges and 420 vertex of which 225 are kept as prefixes of interest. Removing 195 places using SCC suffix rule.3 ms
Discarding 195 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 225 /420 variables (removed 195) and now considering 1099/1099 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 225/1118 places, 1099/1931 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62942 ms. Remains : 225/1118 places, 1099/1931 transitions.
Built C files in :
/tmp/ltsmin11588501601167302410
[2025-05-29 23:28:50] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11588501601167302410
Running compilation step : cd /tmp/ltsmin11588501601167302410;'/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/ltsmin11588501601167302410;'/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/ltsmin11588501601167302410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 1118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1118/1118 places, 1931/1931 transitions.
Applied a total of 0 rules in 34 ms. Remains 1118 /1118 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
// Phase 1: matrix 1931 rows 1118 cols
[2025-05-29 23:28:53] [INFO ] Computed 15 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:28:53] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-05-29 23:28:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:28:55] [INFO ] Implicit Places using invariants and state equation in 1955 ms returned [193, 358, 366, 533, 541, 706, 714, 880, 888]
[2025-05-29 23:28:55] [INFO ] Actually due to overlaps returned [193]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2192 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1117/1118 places, 1931/1931 transitions.
Applied a total of 0 rules in 37 ms. Remains 1117 /1117 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2263 ms. Remains : 1117/1118 places, 1931/1931 transitions.
Built C files in :
/tmp/ltsmin858819410079347658
[2025-05-29 23:28:55] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin858819410079347658
Running compilation step : cd /tmp/ltsmin858819410079347658;'/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/ltsmin858819410079347658;'/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/ltsmin858819410079347658;'/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-29 23:28:59] [INFO ] Flatten gal took : 90 ms
[2025-05-29 23:28:59] [INFO ] Flatten gal took : 82 ms
[2025-05-29 23:28:59] [INFO ] Time to serialize gal into /tmp/LTL6155819841074581025.gal : 23 ms
[2025-05-29 23:28:59] [INFO ] Time to serialize properties into /tmp/LTL10016478999426223603.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/LTL6155819841074581025.gal' '-t' 'CGAL' '-hoa' '/tmp/aut43131573030874204.hoa' '-atoms' '/tmp/LTL10016478999426223603.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...316
Loading property file /tmp/LTL10016478999426223603.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut43131573030874204.hoa
Detected timeout of ITS tools.
[2025-05-29 23:29:14] [INFO ] Flatten gal took : 77 ms
[2025-05-29 23:29:14] [INFO ] Flatten gal took : 84 ms
[2025-05-29 23:29:14] [INFO ] Time to serialize gal into /tmp/LTL3465355001439736055.gal : 15 ms
[2025-05-29 23:29:14] [INFO ] Time to serialize properties into /tmp/LTL16504777549917868120.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3465355001439736055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16504777549917868120.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((G("((p1335==0)||(p1072==1))"))||(X("(p735==1)")))U(((X("(p302!=1)"))||(F(!("((p96==0)||(p1770==1))"))))U((G((X("(p302!=1)"))||(F(...261
Formula 0 simplified : (F!"((p1335==0)||(p1072==1))" & X!"(p735==1)") R (!"(p302==1)" U (X!"(p302!=1)" & G"((p96==0)||(p1770==1))"))
Detected timeout of ITS tools.
[2025-05-29 23:29:29] [INFO ] Flatten gal took : 62 ms
[2025-05-29 23:29:29] [INFO ] Applying decomposition
[2025-05-29 23:29:29] [INFO ] Flatten gal took : 93 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/graph6716400511585280037.txt' '-o' '/tmp/graph6716400511585280037.bin' '-w' '/tmp/graph6716400511585280037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6716400511585280037.bin' '-l' '-1' '-v' '-w' '/tmp/graph6716400511585280037.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:29:30] [INFO ] Decomposing Gal with order
[2025-05-29 23:29:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:29:30] [INFO ] Removed a total of 2634 redundant transitions.
[2025-05-29 23:29:31] [INFO ] Flatten gal took : 595 ms
[2025-05-29 23:29:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 53 ms.
[2025-05-29 23:29:31] [INFO ] Time to serialize gal into /tmp/LTL15313280926470582754.gal : 20 ms
[2025-05-29 23:29:31] [INFO ] Time to serialize properties into /tmp/LTL14982759002847265902.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/LTL15313280926470582754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14982759002847265902.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 : !((((G("((i16.i1.i0.u285.p1335==0)||(i14.u231.p1072==1))"))||(X("(i8.i1.i0.u154.p735==1)")))U(((X("(i4.i0.i0.u69.p302!=1)"))||(F(!("((...417
Formula 0 simplified : (F!"((i16.i1.i0.u285.p1335==0)||(i14.u231.p1072==1))" & X!"(i8.i1.i0.u154.p735==1)") R (!"(i4.i0.i0.u69.p302==1)" U (X!"(i4.i0.i0.u6...218
Detected timeout of ITS tools.
Treatment of property CloudDeployment-PT-6b-LTLCardinality-00 finished in 159926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((G(!p0) U X(p1))||G(F(p2))) U p2)))'
Support contains 5 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1951/1951 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1120 transition count 1933
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1120 transition count 1933
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 1120 transition count 1931
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 1117 transition count 1928
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 1117 transition count 1928
Applied a total of 44 rules in 96 ms. Remains 1117 /1138 variables (removed 21) and now considering 1928/1951 (removed 23) transitions.
// Phase 1: matrix 1928 rows 1117 cols
[2025-05-29 23:29:46] [INFO ] Computed 17 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:29:46] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-29 23:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:29:48] [INFO ] Implicit Places using invariants and state equation in 1827 ms returned [19, 185, 193, 359, 367, 532, 540, 705, 713, 878, 887]
[2025-05-29 23:29:48] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2065 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1116/1138 places, 1928/1951 transitions.
Applied a total of 0 rules in 36 ms. Remains 1116 /1116 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2198 ms. Remains : 1116/1138 places, 1928/1951 transitions.
Stuttering acceptance computed with spot in 474 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) p0), (NOT p2), (AND (NOT p2) p0)]
Running random walk in product with property : CloudDeployment-PT-6b-LTLCardinality-02
Product exploration explored 100000 steps with 25074 reset in 371 ms.
Product exploration explored 100000 steps with 24994 reset in 394 ms.
Computed a total of 161 stabilizing places and 653 stable transitions
Graph (complete) has 3683 edges and 1116 vertex of which 1098 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.5 ms
Computed a total of 161 stabilizing places and 653 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 196 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 445 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) p0), (NOT p2), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (199 resets) in 238 ms. (167 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40003 steps (25 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (22 resets) in 39 ms. (1000 steps per ms) remains 2/3 properties
// Phase 1: matrix 1928 rows 1116 cols
[2025-05-29 23:29:50] [INFO ] Computed 16 invariants in 12 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/221 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 910/1131 variables, 221/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1131 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 594/1725 variables, 244/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1725 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 537/2262 variables, 244/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2262 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 507/2769 variables, 224/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2769 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 215/2984 variables, 146/1095 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2984 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 42/3026 variables, 25/1120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3026 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 18/3044 variables, 12/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3044 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/3044 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3044/3044 variables, and 1132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1081 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 1116/1116 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/221 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 910/1131 variables, 221/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1131 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 594/1725 variables, 244/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1725 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1725 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 537/2262 variables, 244/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2262 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 507/2769 variables, 224/951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2769 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 215/2984 variables, 146/1097 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2984 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 42/3026 variables, 25/1122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3026 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 18/3044 variables, 12/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3044 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/3044 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3044/3044 variables, and 1134 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2409 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 1116/1116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3518ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 312 steps, including 1 resets, run visited all 2 properties in 6 ms. (steps per millisecond=52 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F p2), (F (NOT p1))]
Knowledge based reduction with 15 factoid took 504 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 518 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) p0), (NOT p2), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 488 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) p0), (NOT p2), (AND (NOT p2) p0)]
[2025-05-29 23:29:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 23:29:56] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 5 ms returned sat
[2025-05-29 23:29:57] [INFO ] [Real]Absence check using state equation in 1428 ms returned sat
[2025-05-29 23:29:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 23:29:58] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 5 ms returned sat
[2025-05-29 23:29:59] [INFO ] [Nat]Absence check using state equation in 1179 ms returned sat
[2025-05-29 23:29:59] [INFO ] Computed and/alt/rep : 1881/4715/1881 causal constraints (skipped 46 transitions) in 118 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-29 23:30:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 5 out of 1116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1116/1116 places, 1928/1928 transitions.
Applied a total of 0 rules in 46 ms. Remains 1116 /1116 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2025-05-29 23:30:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:30:13] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-05-29 23:30:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:30:14] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned [184, 192, 358, 366, 531, 539, 704, 712, 877, 886]
[2025-05-29 23:30:14] [INFO ] Actually due to overlaps returned [184]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1761 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1116 places, 1928/1928 transitions.
Applied a total of 0 rules in 29 ms. Remains 1115 /1115 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1839 ms. Remains : 1115/1116 places, 1928/1928 transitions.
Computed a total of 161 stabilizing places and 653 stable transitions
Graph (complete) has 3663 edges and 1115 vertex of which 1098 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.5 ms
Computed a total of 161 stabilizing places and 653 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 155 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) p0), (NOT p2), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (202 resets) in 246 ms. (161 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40003 steps (24 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (22 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (21 resets) in 41 ms. (952 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (23 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
// Phase 1: matrix 1928 rows 1115 cols
[2025-05-29 23:30:15] [INFO ] Computed 15 invariants in 7 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 167/213 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 896/1109 variables, 213/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 605/1714 variables, 245/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1714 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 543/2257 variables, 248/721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2257 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 509/2766 variables, 224/945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2766 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 217/2983 variables, 148/1093 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2983 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 42/3025 variables, 25/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3025 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 18/3043 variables, 12/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3043 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/3043 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3043/3043 variables, and 1130 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1303 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 1115/1115 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 167/213 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 896/1109 variables, 213/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 605/1714 variables, 245/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1714 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1714 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 543/2257 variables, 248/724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2257 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 509/2766 variables, 224/948 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2766 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 217/2983 variables, 148/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2983 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 42/3025 variables, 25/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3025 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 18/3043 variables, 12/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3043 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/3043 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3043/3043 variables, and 1133 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2759 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 1115/1115 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4096ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 9441 steps, including 63 resets, run visited all 1 properties in 22 ms. (steps per millisecond=429 )
Parikh walk visited 3 properties in 81 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F p2), (F (NOT p1))]
Knowledge based reduction with 15 factoid took 488 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) p0), (NOT p2), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 428 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) p0), (NOT p2), (AND (NOT p2) p0)]
[2025-05-29 23:30:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 23:30:21] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 5 ms returned sat
[2025-05-29 23:30:22] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2025-05-29 23:30:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 23:30:22] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 5 ms returned sat
[2025-05-29 23:30:23] [INFO ] [Nat]Absence check using state equation in 977 ms returned sat
[2025-05-29 23:30:23] [INFO ] Computed and/alt/rep : 1881/4715/1881 causal constraints (skipped 46 transitions) in 86 ms.
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 401 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) p0), (NOT p2), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 25000 reset in 326 ms.
Product exploration explored 100000 steps with 24925 reset in 318 ms.
Applying partial POR strategy [false, false, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 371 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) p0), (NOT p2), (AND (NOT p2) p0)]
Support contains 5 out of 1115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1115/1115 places, 1928/1928 transitions.
Graph (trivial) has 1156 edges and 1115 vertex of which 426 / 1115 are part of one of the 48 SCC in 1 ms
Free SCC test removed 378 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Graph (complete) has 3153 edges and 737 vertex of which 720 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 293 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 293 rules applied. Total rules applied 295 place count 720 transition count 1494
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 295 place count 720 transition count 1530
Deduced a syphon composed of 336 places in 1 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 338 place count 720 transition count 1530
Discarding 154 places :
Symmetric choice reduction at 1 with 154 rule applications. Total rules 492 place count 566 transition count 1376
Deduced a syphon composed of 182 places in 1 ms
Iterating global reduction 1 with 154 rules applied. Total rules applied 646 place count 566 transition count 1376
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 302 places in 1 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 766 place count 566 transition count 1376
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 855 place count 477 transition count 1287
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 944 place count 477 transition count 1287
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -252
Deduced a syphon composed of 249 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 980 place count 477 transition count 1539
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 986 place count 477 transition count 1533
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1028 place count 435 transition count 1395
Deduced a syphon composed of 207 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 1070 place count 435 transition count 1395
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 1076 place count 435 transition count 1467
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1082 place count 429 transition count 1455
Deduced a syphon composed of 207 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 1088 place count 429 transition count 1455
Deduced a syphon composed of 207 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 2 with 90 rules applied. Total rules applied 1178 place count 429 transition count 1365
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1190 place count 417 transition count 1353
Deduced a syphon composed of 195 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1202 place count 417 transition count 1353
Deduced a syphon composed of 195 places in 0 ms
Applied a total of 1202 rules in 171 ms. Remains 417 /1115 variables (removed 698) and now considering 1353/1928 (removed 575) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:30:40] [INFO ] Redundant transitions in 1442 ms returned []
Running 1352 sub problems to find dead transitions.
[2025-05-29 23:30:40] [INFO ] Flow matrix only has 1126 transitions (discarded 227 similar events)
// Phase 1: matrix 1126 rows 417 cols
[2025-05-29 23:30:40] [INFO ] Computed 6 invariants in 3 ms
[2025-05-29 23:30:40] [INFO ] State equation strengthened by 343 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 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 TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 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 TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
At refinement iteration 2 (OVERLAPS) 1125/1541 variables, 416/422 constraints. Problems are: Problem set: 255 solved, 1097 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1541 variables, 342/764 constraints. Problems are: Problem set: 255 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1541/1543 variables, and 764 constraints, problems are : Problem set: 255 solved, 1097 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 416/417 constraints, ReadFeed: 342/343 constraints, PredecessorRefiner: 1352/883 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 255 solved, 1097 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 255 solved, 1097 unsolved
At refinement iteration 1 (OVERLAPS) 14/235 variables, 6/6 constraints. Problems are: Problem set: 255 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/6 constraints. Problems are: Problem set: 255 solved, 1097 unsolved
At refinement iteration 3 (OVERLAPS) 1107/1342 variables, 235/241 constraints. Problems are: Problem set: 255 solved, 1097 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1342 variables, 342/583 constraints. Problems are: Problem set: 255 solved, 1097 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1342 variables, 628/1211 constraints. Problems are: Problem set: 255 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1342/1543 variables, and 1211 constraints, problems are : Problem set: 255 solved, 1097 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/417 constraints, ReadFeed: 342/343 constraints, PredecessorRefiner: 1097/883 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61558ms problems are : Problem set: 255 solved, 1097 unsolved
Search for dead transitions found 255 dead transitions in 61562ms
Found 255 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 255 transitions
Dead transitions reduction (with SMT) removed 255 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 417/1115 places, 1098/1928 transitions.
Graph (complete) has 2386 edges and 417 vertex of which 222 are kept as prefixes of interest. Removing 195 places using SCC suffix rule.2 ms
Discarding 195 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 44 ms. Remains 222 /417 variables (removed 195) and now considering 1098/1098 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 222/1115 places, 1098/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63244 ms. Remains : 222/1115 places, 1098/1928 transitions.
Built C files in :
/tmp/ltsmin17297111612290600170
[2025-05-29 23:31:41] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17297111612290600170
Running compilation step : cd /tmp/ltsmin17297111612290600170;'/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/ltsmin17297111612290600170;'/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/ltsmin17297111612290600170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 1115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1115/1115 places, 1928/1928 transitions.
Applied a total of 0 rules in 31 ms. Remains 1115 /1115 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1115 cols
[2025-05-29 23:31:44] [INFO ] Computed 15 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:31:45] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-05-29 23:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:31:47] [INFO ] Implicit Places using invariants and state equation in 2086 ms returned [191, 357, 365, 530, 538, 703, 711, 876, 885]
[2025-05-29 23:31:47] [INFO ] Actually due to overlaps returned [191]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1114/1115 places, 1928/1928 transitions.
Applied a total of 0 rules in 36 ms. Remains 1114 /1114 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2395 ms. Remains : 1114/1115 places, 1928/1928 transitions.
Built C files in :
/tmp/ltsmin5326122166331038870
[2025-05-29 23:31:47] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5326122166331038870
Running compilation step : cd /tmp/ltsmin5326122166331038870;'/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/ltsmin5326122166331038870;'/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/ltsmin5326122166331038870;'/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-29 23:31:50] [INFO ] Flatten gal took : 67 ms
[2025-05-29 23:31:50] [INFO ] Flatten gal took : 66 ms
[2025-05-29 23:31:50] [INFO ] Time to serialize gal into /tmp/LTL13237980545637957990.gal : 11 ms
[2025-05-29 23:31:50] [INFO ] Time to serialize properties into /tmp/LTL11665246789158211490.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/LTL13237980545637957990.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6820811591745628298.hoa' '-atoms' '/tmp/LTL11665246789158211490.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/LTL11665246789158211490.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6820811591745628298.hoa
Detected timeout of ITS tools.
[2025-05-29 23:32:05] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:32:05] [INFO ] Flatten gal took : 61 ms
[2025-05-29 23:32:05] [INFO ] Time to serialize gal into /tmp/LTL12564844853712506488.gal : 10 ms
[2025-05-29 23:32:05] [INFO ] Time to serialize properties into /tmp/LTL8148060087174392608.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/LTL12564844853712506488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8148060087174392608.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((((G(!("((p370==0)||(p1524==1))")))U(X("((p1184==0)||(p1635==1))")))||(G(F("(p1388==1)"))))U("(p1388==1)"))))
Formula 0 simplified : X(((F"((p370==0)||(p1524==1))" R X!"((p1184==0)||(p1635==1))") & FG!"(p1388==1)") R !"(p1388==1)")
Detected timeout of ITS tools.
[2025-05-29 23:32:20] [INFO ] Flatten gal took : 63 ms
[2025-05-29 23:32:20] [INFO ] Applying decomposition
[2025-05-29 23:32:21] [INFO ] Flatten gal took : 57 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/graph3678647081296116347.txt' '-o' '/tmp/graph3678647081296116347.bin' '-w' '/tmp/graph3678647081296116347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3678647081296116347.bin' '-l' '-1' '-v' '-w' '/tmp/graph3678647081296116347.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:32:21] [INFO ] Decomposing Gal with order
[2025-05-29 23:32:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:32:21] [INFO ] Removed a total of 2592 redundant transitions.
[2025-05-29 23:32:21] [INFO ] Flatten gal took : 121 ms
[2025-05-29 23:32:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 23 ms.
[2025-05-29 23:32:21] [INFO ] Time to serialize gal into /tmp/LTL3300337020638145639.gal : 12 ms
[2025-05-29 23:32:21] [INFO ] Time to serialize properties into /tmp/LTL9646215006781682060.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/LTL3300337020638145639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9646215006781682060.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((((G(!("((i8.i0.i0.u72.p370==0)||(i24.i0.i0.u331.p1524==1))")))U(X("((i16.i1.i3.u260.p1184==0)||(i21.u345.p1635==1))")))||(G(F("(...205
Formula 0 simplified : X(((F"((i8.i0.i0.u72.p370==0)||(i24.i0.i0.u331.p1524==1))" R X!"((i16.i1.i3.u260.p1184==0)||(i21.u345.p1635==1))") & FG!"(i19.u298.p...191
Detected timeout of ITS tools.
Treatment of property CloudDeployment-PT-6b-LTLCardinality-02 finished in 170301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||X(p1)))))'
Support contains 6 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1951/1951 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1122 transition count 1935
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1122 transition count 1935
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1122 transition count 1933
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 1119 transition count 1930
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 1119 transition count 1930
Applied a total of 40 rules in 95 ms. Remains 1119 /1138 variables (removed 19) and now considering 1930/1951 (removed 21) transitions.
// Phase 1: matrix 1930 rows 1119 cols
[2025-05-29 23:32:36] [INFO ] Computed 17 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:37] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-05-29 23:32:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:38] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned [19, 185, 194, 359, 367, 533, 541, 706, 714, 880, 888]
[2025-05-29 23:32:38] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1852 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1118/1138 places, 1930/1951 transitions.
Applied a total of 0 rules in 29 ms. Remains 1118 /1118 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1978 ms. Remains : 1118/1138 places, 1930/1951 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6b-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 387 ms.
Product exploration explored 100000 steps with 33333 reset in 387 ms.
Computed a total of 162 stabilizing places and 654 stable transitions
Graph (complete) has 3684 edges and 1118 vertex of which 1100 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Computed a total of 162 stabilizing places and 654 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 12 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6b-LTLCardinality-05 finished in 2910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((F(p0) U X(X(X(p1)))))) U G(p2)))'
Support contains 6 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1951/1951 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1121 transition count 1934
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1121 transition count 1934
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 1121 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 1119 transition count 1930
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 1119 transition count 1930
Applied a total of 40 rules in 131 ms. Remains 1119 /1138 variables (removed 19) and now considering 1930/1951 (removed 21) transitions.
// Phase 1: matrix 1930 rows 1119 cols
[2025-05-29 23:32:39] [INFO ] Computed 17 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:39] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-05-29 23:32:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:41] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned [19, 185, 193, 359, 367, 533, 541, 707, 715, 881, 889]
[2025-05-29 23:32:41] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1899 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1118/1138 places, 1930/1951 transitions.
Applied a total of 0 rules in 38 ms. Remains 1118 /1118 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2069 ms. Remains : 1118/1138 places, 1930/1951 transitions.
Stuttering acceptance computed with spot in 693 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : CloudDeployment-PT-6b-LTLCardinality-07
Product exploration explored 100000 steps with 20040 reset in 326 ms.
Product exploration explored 100000 steps with 19897 reset in 314 ms.
Computed a total of 163 stabilizing places and 655 stable transitions
Graph (complete) has 3685 edges and 1118 vertex of which 1100 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Computed a total of 163 stabilizing places and 655 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 147 ms. Reduced automaton from 20 states, 39 edges and 3 AP (stutter sensitive) to 20 states, 39 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 697 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (212 resets) in 217 ms. (183 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (21 resets) in 35 ms. (1111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (22 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (21 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (20 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (23 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (22 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (22 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (21 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (22 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
// Phase 1: matrix 1930 rows 1118 cols
[2025-05-29 23:32:44] [INFO ] Computed 16 invariants in 6 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 92/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 123/221 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 910/1131 variables, 221/237 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1131 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 599/1730 variables, 244/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1730 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 552/2282 variables, 250/731 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2282 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 508/2790 variables, 228/959 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2790 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 206/2996 variables, 142/1101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2996 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 40/3036 variables, 25/1126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3036 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 12/3048 variables, 8/1134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3048 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/3048 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3048/3048 variables, and 1134 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3125 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 1118/1118 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 92/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 123/221 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 910/1131 variables, 221/237 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1131 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 599/1730 variables, 244/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1730 variables, 9/490 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1730 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 552/2282 variables, 250/740 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2282 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 508/2790 variables, 228/968 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2790 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 206/2996 variables, 142/1110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2996 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 40/3036 variables, 25/1135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3036 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 12/3048 variables, 8/1143 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3048/3048 variables, and 1143 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 1118/1118 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8174ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1118/1118 places, 1930/1930 transitions.
Graph (trivial) has 1159 edges and 1118 vertex of which 424 / 1118 are part of one of the 48 SCC in 0 ms
Free SCC test removed 376 places
Drop transitions (Empty/Sink Transition effects.) removed 481 transitions
Reduce isomorphic transitions removed 481 transitions.
Graph (complete) has 3028 edges and 742 vertex of which 724 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 0 with 325 rules applied. Total rules applied 327 place count 724 transition count 1124
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 1 with 303 rules applied. Total rules applied 630 place count 421 transition count 1124
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 630 place count 421 transition count 1057
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 764 place count 354 transition count 1057
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 770 place count 348 transition count 1051
Iterating global reduction 2 with 6 rules applied. Total rules applied 776 place count 348 transition count 1051
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 776 place count 348 transition count 1045
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 788 place count 342 transition count 1045
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 978 place count 247 transition count 950
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -223
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 1050 place count 211 transition count 1173
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 1093 place count 211 transition count 1130
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1105 place count 205 transition count 1190
Drop transitions (Redundant composition of simpler transitions.) removed 196 transitions
Redundant transition composition rules discarded 196 transitions
Iterating global reduction 3 with 196 rules applied. Total rules applied 1301 place count 205 transition count 994
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1303 place count 204 transition count 1007
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1304 place count 204 transition count 1006
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 1316 place count 204 transition count 994
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1376 place count 204 transition count 904
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 136 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 208 transitions.
Graph (complete) has 1224 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 269 rules applied. Total rules applied 1645 place count 143 transition count 696
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1646 place count 143 transition count 695
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1651 place count 138 transition count 660
Iterating global reduction 6 with 5 rules applied. Total rules applied 1656 place count 138 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 6 with 108 rules applied. Total rules applied 1764 place count 138 transition count 552
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1765 place count 138 transition count 552
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1766 place count 137 transition count 551
Applied a total of 1766 rules in 150 ms. Remains 137 /1118 variables (removed 981) and now considering 551/1930 (removed 1379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 137/1118 places, 551/1930 transitions.
RANDOM walk for 40000 steps (8 resets) in 333 ms. (119 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 198 ms. (201 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
[2025-05-29 23:32:53] [INFO ] Flow matrix only has 268 transitions (discarded 283 similar events)
// Phase 1: matrix 268 rows 137 cols
[2025-05-29 23:32:53] [INFO ] Computed 23 invariants in 0 ms
[2025-05-29 23:32:53] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/100 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/110 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 230/340 variables, 110/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 31/371 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 18/389 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 16/405 variables, 18/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/405 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 137/137 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/100 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/110 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 230/340 variables, 110/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 31/371 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 18/389 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 16/405 variables, 18/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/405 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 137/137 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 807ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 56 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=14 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p2 p0)))]
Knowledge based reduction with 9 factoid took 549 ms. Reduced automaton from 20 states, 39 edges and 3 AP (stutter sensitive) to 20 states, 39 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 930 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 946 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Support contains 6 out of 1118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1118/1118 places, 1930/1930 transitions.
Applied a total of 0 rules in 36 ms. Remains 1118 /1118 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
// Phase 1: matrix 1930 rows 1118 cols
[2025-05-29 23:32:56] [INFO ] Computed 16 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:56] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-05-29 23:32:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:58] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned [184, 192, 358, 366, 532, 540, 706, 714, 880, 888]
[2025-05-29 23:32:58] [INFO ] Actually due to overlaps returned [184]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1876 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1117/1118 places, 1930/1930 transitions.
Applied a total of 0 rules in 37 ms. Remains 1117 /1117 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1949 ms. Remains : 1117/1118 places, 1930/1930 transitions.
Computed a total of 163 stabilizing places and 655 stable transitions
Graph (complete) has 3665 edges and 1117 vertex of which 1100 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.3 ms
Computed a total of 163 stabilizing places and 655 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 178 ms. Reduced automaton from 20 states, 39 edges and 3 AP (stutter sensitive) to 20 states, 39 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 922 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (202 resets) in 233 ms. (170 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (23 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (22 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (22 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (23 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (24 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (21 resets) in 40 ms. (975 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (23 resets) in 44 ms. (888 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (22 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (20 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
// Phase 1: matrix 1930 rows 1117 cols
[2025-05-29 23:32:59] [INFO ] Computed 15 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 92/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 115/213 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 896/1109 variables, 213/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 610/1719 variables, 245/473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1719 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 558/2277 variables, 254/727 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2277 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 510/2787 variables, 228/955 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2787 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 208/2995 variables, 144/1099 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2995 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 40/3035 variables, 25/1124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3035 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 12/3047 variables, 8/1132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3047 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/3047 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3047/3047 variables, and 1132 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2794 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 1117/1117 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 92/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 115/213 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 896/1109 variables, 213/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 610/1719 variables, 245/473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1719 variables, 9/482 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1719 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 558/2277 variables, 254/736 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2277 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 510/2787 variables, 228/964 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2787 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 208/2995 variables, 144/1108 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2995 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 40/3035 variables, 25/1133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3035 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 12/3047 variables, 8/1141 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3047/3047 variables, and 1141 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 1117/1117 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7844ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1117/1117 places, 1930/1930 transitions.
Graph (trivial) has 1158 edges and 1117 vertex of which 424 / 1117 are part of one of the 48 SCC in 0 ms
Free SCC test removed 376 places
Drop transitions (Empty/Sink Transition effects.) removed 482 transitions
Reduce isomorphic transitions removed 482 transitions.
Graph (complete) has 3008 edges and 741 vertex of which 724 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 0 with 324 rules applied. Total rules applied 326 place count 724 transition count 1124
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 1 with 303 rules applied. Total rules applied 629 place count 421 transition count 1124
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 629 place count 421 transition count 1057
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 763 place count 354 transition count 1057
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 769 place count 348 transition count 1051
Iterating global reduction 2 with 6 rules applied. Total rules applied 775 place count 348 transition count 1051
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 775 place count 348 transition count 1045
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 787 place count 342 transition count 1045
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 977 place count 247 transition count 950
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -223
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 1049 place count 211 transition count 1173
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 1092 place count 211 transition count 1130
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1104 place count 205 transition count 1190
Drop transitions (Redundant composition of simpler transitions.) removed 196 transitions
Redundant transition composition rules discarded 196 transitions
Iterating global reduction 3 with 196 rules applied. Total rules applied 1300 place count 205 transition count 994
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1302 place count 204 transition count 1007
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1303 place count 204 transition count 1006
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 1315 place count 204 transition count 994
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1375 place count 204 transition count 904
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 136 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 208 transitions.
Graph (complete) has 1224 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 269 rules applied. Total rules applied 1644 place count 143 transition count 696
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1645 place count 143 transition count 695
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1650 place count 138 transition count 660
Iterating global reduction 6 with 5 rules applied. Total rules applied 1655 place count 138 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 6 with 108 rules applied. Total rules applied 1763 place count 138 transition count 552
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1764 place count 138 transition count 552
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1765 place count 137 transition count 551
Applied a total of 1765 rules in 150 ms. Remains 137 /1117 variables (removed 980) and now considering 551/1930 (removed 1379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 137/1117 places, 551/1930 transitions.
RANDOM walk for 40000 steps (8 resets) in 302 ms. (132 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 28449 steps (6 resets) in 77 ms. (364 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p2 p0)))]
Knowledge based reduction with 9 factoid took 588 ms. Reduced automaton from 20 states, 39 edges and 3 AP (stutter sensitive) to 20 states, 39 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 919 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 899 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 915 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 19975 reset in 372 ms.
Product exploration explored 100000 steps with 19974 reset in 317 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 899 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Support contains 6 out of 1117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1117/1117 places, 1930/1930 transitions.
Graph (trivial) has 1158 edges and 1117 vertex of which 424 / 1117 are part of one of the 48 SCC in 1 ms
Free SCC test removed 376 places
Ensure Unique test removed 429 transitions
Reduce isomorphic transitions removed 429 transitions.
Graph (complete) has 3158 edges and 741 vertex of which 724 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 297 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 297 rules applied. Total rules applied 299 place count 724 transition count 1499
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 299 place count 724 transition count 1535
Deduced a syphon composed of 339 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 341 place count 724 transition count 1535
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 499 place count 566 transition count 1377
Deduced a syphon composed of 181 places in 1 ms
Iterating global reduction 1 with 158 rules applied. Total rules applied 657 place count 566 transition count 1377
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 301 places in 1 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 777 place count 566 transition count 1377
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 865 place count 478 transition count 1289
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 953 place count 478 transition count 1289
Performed 38 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 251 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 991 place count 478 transition count 1574
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1009 place count 478 transition count 1556
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1055 place count 432 transition count 1401
Deduced a syphon composed of 205 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 1101 place count 432 transition count 1401
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 1107 place count 432 transition count 1473
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1113 place count 426 transition count 1461
Deduced a syphon composed of 205 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 1119 place count 426 transition count 1461
Deduced a syphon composed of 205 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 1218 place count 426 transition count 1362
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1230 place count 414 transition count 1349
Deduced a syphon composed of 193 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1242 place count 414 transition count 1349
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 194 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1243 place count 414 transition count 1367
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1245 place count 412 transition count 1361
Deduced a syphon composed of 192 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1247 place count 412 transition count 1361
Deduced a syphon composed of 192 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 1262 place count 412 transition count 1346
Deduced a syphon composed of 192 places in 0 ms
Applied a total of 1262 rules in 189 ms. Remains 412 /1117 variables (removed 705) and now considering 1346/1930 (removed 584) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:33:13] [INFO ] Redundant transitions in 793 ms returned []
Running 1345 sub problems to find dead transitions.
[2025-05-29 23:33:13] [INFO ] Flow matrix only has 1113 transitions (discarded 233 similar events)
// Phase 1: matrix 1113 rows 412 cols
[2025-05-29 23:33:13] [INFO ] Computed 6 invariants in 2 ms
[2025-05-29 23:33:13] [INFO ] State equation strengthened by 340 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1345 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 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 TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
At refinement iteration 2 (OVERLAPS) 1112/1523 variables, 411/417 constraints. Problems are: Problem set: 250 solved, 1095 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1523 variables, 339/756 constraints. Problems are: Problem set: 250 solved, 1095 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1523/1525 variables, and 756 constraints, problems are : Problem set: 250 solved, 1095 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 411/412 constraints, ReadFeed: 339/340 constraints, PredecessorRefiner: 1345/876 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 250 solved, 1095 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 250 solved, 1095 unsolved
At refinement iteration 1 (OVERLAPS) 14/233 variables, 6/6 constraints. Problems are: Problem set: 250 solved, 1095 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/6 constraints. Problems are: Problem set: 250 solved, 1095 unsolved
At refinement iteration 3 (OVERLAPS) 1096/1329 variables, 233/239 constraints. Problems are: Problem set: 250 solved, 1095 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1329 variables, 339/578 constraints. Problems are: Problem set: 250 solved, 1095 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1329 variables, 626/1204 constraints. Problems are: Problem set: 250 solved, 1095 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1329/1525 variables, and 1204 constraints, problems are : Problem set: 250 solved, 1095 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 233/412 constraints, ReadFeed: 339/340 constraints, PredecessorRefiner: 1095/876 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61480ms problems are : Problem set: 250 solved, 1095 unsolved
Search for dead transitions found 250 dead transitions in 61484ms
Found 250 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 250 transitions
Dead transitions reduction (with SMT) removed 250 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 412/1117 places, 1096/1930 transitions.
Graph (complete) has 2384 edges and 412 vertex of which 220 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 220 /412 variables (removed 192) and now considering 1096/1096 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 220/1117 places, 1096/1930 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62500 ms. Remains : 220/1117 places, 1096/1930 transitions.
Built C files in :
/tmp/ltsmin14183104826215589632
[2025-05-29 23:34:15] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14183104826215589632
Running compilation step : cd /tmp/ltsmin14183104826215589632;'/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/ltsmin14183104826215589632;'/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/ltsmin14183104826215589632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 1117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1117/1117 places, 1930/1930 transitions.
Applied a total of 0 rules in 29 ms. Remains 1117 /1117 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
// Phase 1: matrix 1930 rows 1117 cols
[2025-05-29 23:34:18] [INFO ] Computed 15 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:34:18] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-29 23:34:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:34:20] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned [191, 357, 365, 531, 539, 705, 713, 879, 887]
[2025-05-29 23:34:20] [INFO ] Actually due to overlaps returned [191]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2045 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1116/1117 places, 1930/1930 transitions.
Applied a total of 0 rules in 29 ms. Remains 1116 /1116 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2105 ms. Remains : 1116/1117 places, 1930/1930 transitions.
Built C files in :
/tmp/ltsmin5131323635442438284
[2025-05-29 23:34:20] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5131323635442438284
Running compilation step : cd /tmp/ltsmin5131323635442438284;'/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/ltsmin5131323635442438284;'/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/ltsmin5131323635442438284;'/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-29 23:34:23] [INFO ] Flatten gal took : 54 ms
[2025-05-29 23:34:23] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:34:23] [INFO ] Time to serialize gal into /tmp/LTL4832077476983283297.gal : 9 ms
[2025-05-29 23:34:23] [INFO ] Time to serialize properties into /tmp/LTL3349246437541908333.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/LTL4832077476983283297.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8376776570691120221.hoa' '-atoms' '/tmp/LTL3349246437541908333.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3349246437541908333.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8376776570691120221.hoa
Detected timeout of ITS tools.
[2025-05-29 23:34:39] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:34:39] [INFO ] Flatten gal took : 56 ms
[2025-05-29 23:34:39] [INFO ] Time to serialize gal into /tmp/LTL2607752020891036674.gal : 10 ms
[2025-05-29 23:34:39] [INFO ] Time to serialize properties into /tmp/LTL17229068746578095365.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/LTL2607752020891036674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17229068746578095365.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(G((F("((p1805==0)||(p246==1))"))U(X(X(X("((p1272==0)||(p552==1))")))))))U(G("((p746==0)||(p1109==1))"))))
Formula 0 simplified : XF(G!"((p1805==0)||(p246==1))" R XXX!"((p1272==0)||(p552==1))") R F!"((p746==0)||(p1109==1))"
Detected timeout of ITS tools.
[2025-05-29 23:34:54] [INFO ] Flatten gal took : 56 ms
[2025-05-29 23:34:54] [INFO ] Applying decomposition
[2025-05-29 23:34:54] [INFO ] Flatten gal took : 57 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/graph7274608130313812505.txt' '-o' '/tmp/graph7274608130313812505.bin' '-w' '/tmp/graph7274608130313812505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7274608130313812505.bin' '-l' '-1' '-v' '-w' '/tmp/graph7274608130313812505.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:34:54] [INFO ] Decomposing Gal with order
[2025-05-29 23:34:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:34:54] [INFO ] Removed a total of 2589 redundant transitions.
[2025-05-29 23:34:54] [INFO ] Flatten gal took : 104 ms
[2025-05-29 23:34:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 22 ms.
[2025-05-29 23:34:54] [INFO ] Time to serialize gal into /tmp/LTL138461540673923982.gal : 14 ms
[2025-05-29 23:34:54] [INFO ] Time to serialize properties into /tmp/LTL8889960999524773310.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/LTL138461540673923982.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8889960999524773310.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((X(G((F("((i28.u395.p1805==0)||(i4.i0.i0.u48.p246==1))"))U(X(X(X("((i18.u269.p1272==0)||(i7.i1.i0.u117.p552==1))")))))))U(G("((i8.u...194
Formula 0 simplified : XF(G!"((i28.u395.p1805==0)||(i4.i0.i0.u48.p246==1))" R XXX!"((i18.u269.p1272==0)||(i7.i1.i0.u117.p552==1))") R F!"((i8.u150.p746==0)...178
Detected timeout of ITS tools.
Treatment of property CloudDeployment-PT-6b-LTLCardinality-07 finished in 150164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F((!p1||G(F(!p1))))))))'
Support contains 4 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1951/1951 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1121 transition count 1934
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1121 transition count 1934
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 1121 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 1119 transition count 1930
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 1119 transition count 1930
Applied a total of 40 rules in 99 ms. Remains 1119 /1138 variables (removed 19) and now considering 1930/1951 (removed 21) transitions.
// Phase 1: matrix 1930 rows 1119 cols
[2025-05-29 23:35:09] [INFO ] Computed 17 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:10] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-05-29 23:35:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:12] [INFO ] Implicit Places using invariants and state equation in 2298 ms returned [19, 185, 193, 360, 368, 533, 541, 706, 714, 880, 888]
[2025-05-29 23:35:12] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2551 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1118/1138 places, 1930/1951 transitions.
Applied a total of 0 rules in 32 ms. Remains 1118 /1118 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2682 ms. Remains : 1118/1138 places, 1930/1951 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : CloudDeployment-PT-6b-LTLCardinality-09
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-6b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLCardinality-09 finished in 2903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1951/1951 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1120 transition count 1933
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1120 transition count 1933
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 1120 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1118 transition count 1930
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1118 transition count 1930
Applied a total of 41 rules in 136 ms. Remains 1118 /1138 variables (removed 20) and now considering 1930/1951 (removed 21) transitions.
// Phase 1: matrix 1930 rows 1118 cols
[2025-05-29 23:35:12] [INFO ] Computed 17 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:12] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-05-29 23:35:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:14] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned [19, 185, 193, 358, 367, 532, 540, 707, 715, 880, 888]
[2025-05-29 23:35:14] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2244 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1117/1138 places, 1930/1951 transitions.
Applied a total of 0 rules in 36 ms. Remains 1117 /1117 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2416 ms. Remains : 1117/1138 places, 1930/1951 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6b-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6b-LTLCardinality-14 finished in 2544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1951/1951 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1119 transition count 1932
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1119 transition count 1932
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 1119 transition count 1930
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 1116 transition count 1927
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 1116 transition count 1927
Applied a total of 46 rules in 99 ms. Remains 1116 /1138 variables (removed 22) and now considering 1927/1951 (removed 24) transitions.
// Phase 1: matrix 1927 rows 1116 cols
[2025-05-29 23:35:15] [INFO ] Computed 17 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:15] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-05-29 23:35:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:17] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned [19, 185, 193, 358, 366, 531, 539, 705, 713, 878, 886]
[2025-05-29 23:35:17] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2065 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1138 places, 1927/1951 transitions.
Applied a total of 0 rules in 36 ms. Remains 1115 /1115 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2200 ms. Remains : 1115/1138 places, 1927/1951 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6b-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 548 ms.
Product exploration explored 100000 steps with 50000 reset in 506 ms.
Computed a total of 161 stabilizing places and 653 stable transitions
Graph (complete) has 3679 edges and 1115 vertex of which 1097 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Computed a total of 161 stabilizing places and 653 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6b-LTLCardinality-15 finished in 3394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||X(p1)) U ((X(p2)||F(!p3)) U (G((X(p2)||F(!p3)))||(!p2&&(X(p2)||F(!p3)))))))'
Found a Lengthening insensitive property : CloudDeployment-PT-6b-LTLCardinality-00
Stuttering acceptance computed with spot in 545 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3), (AND p3 (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p2) (NOT p0) (NOT p1) p3), p3, (AND p3 (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2)), (AND p3 (NOT p0) (NOT p2) p1), (AND p3 (NOT p0) (NOT p2) p1)]
Support contains 6 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1138/1138 places, 1951/1951 transitions.
Graph (trivial) has 1176 edges and 1138 vertex of which 428 / 1138 are part of one of the 48 SCC in 1 ms
Free SCC test removed 380 places
Ensure Unique test removed 434 transitions
Reduce isomorphic transitions removed 434 transitions.
Graph (complete) has 3230 edges and 758 vertex of which 739 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.3 ms
Discarding 19 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 303 place count 738 transition count 1213
Reduce places removed 301 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 302 rules applied. Total rules applied 605 place count 437 transition count 1212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 606 place count 436 transition count 1212
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 606 place count 436 transition count 1151
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 728 place count 375 transition count 1151
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 735 place count 368 transition count 1144
Iterating global reduction 3 with 7 rules applied. Total rules applied 742 place count 368 transition count 1144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 744 place count 368 transition count 1142
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 970 place count 255 transition count 1029
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1018 place count 231 transition count 1083
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1024 place count 231 transition count 1077
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1036 place count 225 transition count 1137
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1040 place count 225 transition count 1137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1041 place count 224 transition count 1136
Applied a total of 1041 rules in 88 ms. Remains 224 /1138 variables (removed 914) and now considering 1136/1951 (removed 815) transitions.
[2025-05-29 23:35:19] [INFO ] Flow matrix only has 909 transitions (discarded 227 similar events)
// Phase 1: matrix 909 rows 224 cols
[2025-05-29 23:35:19] [INFO ] Computed 6 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:19] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-29 23:35:19] [INFO ] Flow matrix only has 909 transitions (discarded 227 similar events)
[2025-05-29 23:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:19] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-29 23:35:19] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Running 1086 sub problems to find dead transitions.
[2025-05-29 23:35:19] [INFO ] Flow matrix only has 909 transitions (discarded 227 similar events)
[2025-05-29 23:35:19] [INFO ] Invariant cache hit.
[2025-05-29 23:35:19] [INFO ] State equation strengthened by 48 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1086 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1086 unsolved
At refinement iteration 2 (OVERLAPS) 908/1125 variables, 217/223 constraints. Problems are: Problem set: 0 solved, 1086 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1125 variables, 48/271 constraints. Problems are: Problem set: 0 solved, 1086 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1133 variables, and 271 constraints, problems are : Problem set: 0 solved, 1086 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 217/224 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1086/617 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1086 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1086 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1086 unsolved
At refinement iteration 2 (OVERLAPS) 908/1125 variables, 217/223 constraints. Problems are: Problem set: 0 solved, 1086 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1125 variables, 48/271 constraints. Problems are: Problem set: 0 solved, 1086 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1125 variables, 40/311 constraints. Problems are: Problem set: 0 solved, 1086 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 1125/1133 variables, and 311 constraints, problems are : Problem set: 0 solved, 1086 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 217/224 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 509/617 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61261ms problems are : Problem set: 0 solved, 1086 unsolved
Search for dead transitions found 0 dead transitions in 61265ms
Starting structural reductions in LI_LTL mode, iteration 1 : 224/1138 places, 1136/1951 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62008 ms. Remains : 224/1138 places, 1136/1951 transitions.
Running random walk in product with property : CloudDeployment-PT-6b-LTLCardinality-00
Stuttering criterion allowed to conclude after 48 steps with 19 reset in 1 ms.
Treatment of property CloudDeployment-PT-6b-LTLCardinality-00 finished in 62693 ms.
FORMULA CloudDeployment-PT-6b-LTLCardinality-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((G(!p0) U X(p1))||G(F(p2))) U p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((F(p0) U X(X(X(p1)))))) U G(p2)))'
Found a Lengthening insensitive property : CloudDeployment-PT-6b-LTLCardinality-07
Stuttering acceptance computed with spot in 936 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Support contains 6 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1138/1138 places, 1951/1951 transitions.
Graph (trivial) has 1179 edges and 1138 vertex of which 426 / 1138 are part of one of the 48 SCC in 0 ms
Free SCC test removed 378 places
Ensure Unique test removed 431 transitions
Reduce isomorphic transitions removed 431 transitions.
Graph (complete) has 3233 edges and 760 vertex of which 741 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.3 ms
Discarding 19 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 305 transitions
Trivial Post-agglo rules discarded 305 transitions
Performed 305 trivial Post agglomeration. Transition count delta: 305
Iterating post reduction 0 with 305 rules applied. Total rules applied 307 place count 740 transition count 1212
Reduce places removed 305 places and 0 transitions.
Iterating post reduction 1 with 305 rules applied. Total rules applied 612 place count 435 transition count 1212
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 612 place count 435 transition count 1152
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 732 place count 375 transition count 1152
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 739 place count 368 transition count 1145
Iterating global reduction 2 with 7 rules applied. Total rules applied 746 place count 368 transition count 1145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 748 place count 368 transition count 1143
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 978 place count 253 transition count 1028
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 1030 place count 227 transition count 1092
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1042 place count 227 transition count 1080
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1054 place count 221 transition count 1140
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1055 place count 221 transition count 1139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1056 place count 220 transition count 1138
Applied a total of 1056 rules in 74 ms. Remains 220 /1138 variables (removed 918) and now considering 1138/1951 (removed 813) transitions.
[2025-05-29 23:36:22] [INFO ] Flow matrix only has 911 transitions (discarded 227 similar events)
// Phase 1: matrix 911 rows 220 cols
[2025-05-29 23:36:22] [INFO ] Computed 6 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:36:22] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-29 23:36:22] [INFO ] Flow matrix only has 911 transitions (discarded 227 similar events)
[2025-05-29 23:36:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:36:22] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-29 23:36:23] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Running 1089 sub problems to find dead transitions.
[2025-05-29 23:36:23] [INFO ] Flow matrix only has 911 transitions (discarded 227 similar events)
[2025-05-29 23:36:23] [INFO ] Invariant cache hit.
[2025-05-29 23:36:23] [INFO ] State equation strengthened by 48 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 2 (OVERLAPS) 910/1124 variables, 214/220 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1124 variables, 48/268 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1124/1131 variables, and 268 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 214/220 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1089/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1089 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 2 (OVERLAPS) 910/1124 variables, 214/220 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1124 variables, 48/268 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 36/304 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1131 variables, and 304 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 214/220 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 505/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61230ms problems are : Problem set: 0 solved, 1089 unsolved
Search for dead transitions found 0 dead transitions in 61234ms
Starting structural reductions in LI_LTL mode, iteration 1 : 220/1138 places, 1138/1951 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62000 ms. Remains : 220/1138 places, 1138/1951 transitions.
Running random walk in product with property : CloudDeployment-PT-6b-LTLCardinality-07
Product exploration explored 100000 steps with 19987 reset in 417 ms.
Product exploration explored 100000 steps with 20000 reset in 439 ms.
Computed a total of 61 stabilizing places and 733 stable transitions
Computed a total of 61 stabilizing places and 733 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 160 ms. Reduced automaton from 20 states, 39 edges and 3 AP (stutter sensitive) to 20 states, 39 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 910 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (1025 resets) in 902 ms. (44 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (55 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (51 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (54 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (56 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (50 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (52 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (56 resets) in 44 ms. (888 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
[2025-05-29 23:37:26] [INFO ] Flow matrix only has 911 transitions (discarded 227 similar events)
[2025-05-29 23:37:26] [INFO ] Invariant cache hit.
[2025-05-29 23:37:26] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 40/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 469/515 variables, 46/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 559/1074 variables, 129/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1074 variables, 48/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1074 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 56/1130 variables, 45/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1130 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1130 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1130/1131 variables, and 274 constraints, problems are : Problem set: 0 solved, 9 unsolved in 631 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/220 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 40/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 469/515 variables, 46/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 559/1074 variables, 129/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1074 variables, 48/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1074 variables, 9/238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1074 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 56/1130 variables, 45/283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1130 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1130 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1130/1131 variables, and 283 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2911 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/220 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3550ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 1 properties in 1312 ms.
Support contains 6 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 1138/1138 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 220 transition count 1055
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -174
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 115 place count 204 transition count 1229
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 147 place count 204 transition count 1197
Drop transitions (Redundant composition of simpler transitions.) removed 196 transitions
Redundant transition composition rules discarded 196 transitions
Iterating global reduction 2 with 196 rules applied. Total rules applied 343 place count 204 transition count 1001
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 345 place count 203 transition count 1014
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 346 place count 203 transition count 1013
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 358 place count 203 transition count 1001
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 418 place count 203 transition count 911
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 136 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 208 transitions.
Graph (complete) has 1199 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 269 rules applied. Total rules applied 687 place count 142 transition count 703
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 688 place count 142 transition count 702
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 693 place count 137 transition count 667
Iterating global reduction 5 with 5 rules applied. Total rules applied 698 place count 137 transition count 667
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 5 with 108 rules applied. Total rules applied 806 place count 137 transition count 559
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 807 place count 137 transition count 559
Applied a total of 807 rules in 95 ms. Remains 137 /220 variables (removed 83) and now considering 559/1138 (removed 579) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 137/220 places, 559/1138 transitions.
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2025-05-29 23:37:32] [INFO ] Flow matrix only has 276 transitions (discarded 283 similar events)
// Phase 1: matrix 276 rows 137 cols
[2025-05-29 23:37:32] [INFO ] Computed 17 invariants in 1 ms
[2025-05-29 23:37:32] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/56 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/214 variables, 56/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 116/330 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 73/403 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/413 variables, 10/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/413 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 137/137 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/56 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/214 variables, 56/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 116/330 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 73/403 variables, 37/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/403 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/413 variables, 10/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 137/137 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 388ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 438 steps, including 15 resets, run visited all 1 properties in 2 ms. (steps per millisecond=219 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p2 p0)))]
Knowledge based reduction with 9 factoid took 586 ms. Reduced automaton from 20 states, 39 edges and 3 AP (stutter sensitive) to 20 states, 39 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 914 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 926 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Support contains 6 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 1138/1138 transitions.
Applied a total of 0 rules in 7 ms. Remains 220 /220 variables (removed 0) and now considering 1138/1138 (removed 0) transitions.
[2025-05-29 23:37:34] [INFO ] Flow matrix only has 911 transitions (discarded 227 similar events)
// Phase 1: matrix 911 rows 220 cols
[2025-05-29 23:37:34] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:34] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-29 23:37:34] [INFO ] Flow matrix only has 911 transitions (discarded 227 similar events)
[2025-05-29 23:37:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:35] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-29 23:37:35] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Running 1089 sub problems to find dead transitions.
[2025-05-29 23:37:35] [INFO ] Flow matrix only has 911 transitions (discarded 227 similar events)
[2025-05-29 23:37:35] [INFO ] Invariant cache hit.
[2025-05-29 23:37:35] [INFO ] State equation strengthened by 48 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 2 (OVERLAPS) 910/1124 variables, 214/220 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1124 variables, 48/268 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1124/1131 variables, and 268 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 214/220 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1089/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1089 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 2 (OVERLAPS) 910/1124 variables, 214/220 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1124 variables, 48/268 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 36/304 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1131 variables, and 304 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 214/220 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 505/620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61273ms problems are : Problem set: 0 solved, 1089 unsolved
Search for dead transitions found 0 dead transitions in 61278ms
Finished structural reductions in LTL mode , in 1 iterations and 61958 ms. Remains : 220/220 places, 1138/1138 transitions.
Computed a total of 61 stabilizing places and 733 stable transitions
Computed a total of 61 stabilizing places and 733 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 160 ms. Reduced automaton from 20 states, 39 edges and 3 AP (stutter sensitive) to 20 states, 39 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 777 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (1021 resets) in 430 ms. (92 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (52 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (55 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (52 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (54 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 39 ms. (1000 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (55 resets) in 40 ms. (975 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (53 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
[2025-05-29 23:38:38] [INFO ] Flow matrix only has 911 transitions (discarded 227 similar events)
[2025-05-29 23:38:38] [INFO ] Invariant cache hit.
[2025-05-29 23:38:38] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 40/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 469/515 variables, 46/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 559/1074 variables, 129/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1074 variables, 48/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1074 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 56/1130 variables, 45/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1130 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1130 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1130/1131 variables, and 274 constraints, problems are : Problem set: 0 solved, 9 unsolved in 587 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/220 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 40/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 469/515 variables, 46/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 559/1074 variables, 129/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1074 variables, 48/229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1074 variables, 9/238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1074 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 56/1130 variables, 45/283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1130 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1130 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1130/1131 variables, and 283 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2695 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 220/220 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3320ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 1 properties in 976 ms.
Support contains 6 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 1138/1138 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 220 transition count 1055
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -174
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 115 place count 204 transition count 1229
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 147 place count 204 transition count 1197
Drop transitions (Redundant composition of simpler transitions.) removed 196 transitions
Redundant transition composition rules discarded 196 transitions
Iterating global reduction 2 with 196 rules applied. Total rules applied 343 place count 204 transition count 1001
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 345 place count 203 transition count 1014
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 346 place count 203 transition count 1013
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 358 place count 203 transition count 1001
Free-agglomeration rule applied 60 times with reduction of 30 identical transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 418 place count 203 transition count 911
Reduce places removed 60 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 136 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 208 transitions.
Graph (complete) has 1199 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 269 rules applied. Total rules applied 687 place count 142 transition count 703
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 688 place count 142 transition count 702
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 693 place count 137 transition count 667
Iterating global reduction 5 with 5 rules applied. Total rules applied 698 place count 137 transition count 667
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 5 with 108 rules applied. Total rules applied 806 place count 137 transition count 559
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 807 place count 137 transition count 559
Applied a total of 807 rules in 91 ms. Remains 137 /220 variables (removed 83) and now considering 559/1138 (removed 579) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 137/220 places, 559/1138 transitions.
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/3 properties
BEST_FIRST walk for 30462 steps (6 resets) in 66 ms. (454 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p2 p0)))]
Knowledge based reduction with 9 factoid took 540 ms. Reduced automaton from 20 states, 39 edges and 3 AP (stutter sensitive) to 20 states, 39 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 885 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 885 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 902 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 20035 reset in 375 ms.
Product exploration explored 100000 steps with 19964 reset in 385 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 892 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Support contains 6 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 1138/1138 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 49 place count 220 transition count 1089
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 220 transition count 1105
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 63 place count 220 transition count 1092
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 63 rules in 59 ms. Remains 220 /220 variables (removed 0) and now considering 1092/1138 (removed 46) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:38:48] [INFO ] Redundant transitions in 625 ms returned []
Running 1043 sub problems to find dead transitions.
[2025-05-29 23:38:48] [INFO ] Flow matrix only has 859 transitions (discarded 233 similar events)
// Phase 1: matrix 859 rows 220 cols
[2025-05-29 23:38:48] [INFO ] Computed 6 invariants in 5 ms
[2025-05-29 23:38:48] [INFO ] State equation strengthened by 42 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
Problem TDEAD219 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
At refinement iteration 2 (OVERLAPS) 858/1072 variables, 214/220 constraints. Problems are: Problem set: 3 solved, 1040 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1072 variables, 42/262 constraints. Problems are: Problem set: 3 solved, 1040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1072/1079 variables, and 262 constraints, problems are : Problem set: 3 solved, 1040 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 214/220 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1043/574 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1040 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 1040 unsolved
At refinement iteration 2 (OVERLAPS) 858/1071 variables, 213/219 constraints. Problems are: Problem set: 3 solved, 1040 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1071 variables, 42/261 constraints. Problems are: Problem set: 3 solved, 1040 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1071 variables, 22/283 constraints. Problems are: Problem set: 3 solved, 1040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1071/1079 variables, and 283 constraints, problems are : Problem set: 3 solved, 1040 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 213/220 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 491/574 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61309ms problems are : Problem set: 3 solved, 1040 unsolved
Search for dead transitions found 3 dead transitions in 61313ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 220/220 places, 1089/1138 transitions.
Graph (complete) has 2351 edges and 220 vertex of which 219 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 219 /220 variables (removed 1) and now considering 1089/1089 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 219/220 places, 1089/1138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62027 ms. Remains : 219/220 places, 1089/1138 transitions.
Built C files in :
/tmp/ltsmin18132438481550117913
[2025-05-29 23:39:49] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18132438481550117913
Running compilation step : cd /tmp/ltsmin18132438481550117913;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2286 ms.
Running link step : cd /tmp/ltsmin18132438481550117913;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin18132438481550117913;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11964878967585295083.hoa' '--buchi-type=spotba'
LTSmin run took 3280 ms.
Treatment of property CloudDeployment-PT-6b-LTLCardinality-07 finished in 214093 ms.
FORMULA CloudDeployment-PT-6b-LTLCardinality-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-05-29 23:39:55] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin428512107133012057
[2025-05-29 23:39:55] [INFO ] Too many transitions (1951) to apply POR reductions. Disabling POR matrices.
[2025-05-29 23:39:55] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin428512107133012057
Running compilation step : cd /tmp/ltsmin428512107133012057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-29 23:39:55] [INFO ] Applying decomposition
[2025-05-29 23:39:55] [INFO ] Flatten gal took : 54 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/graph8250486746880322243.txt' '-o' '/tmp/graph8250486746880322243.bin' '-w' '/tmp/graph8250486746880322243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8250486746880322243.bin' '-l' '-1' '-v' '-w' '/tmp/graph8250486746880322243.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:39:55] [INFO ] Decomposing Gal with order
[2025-05-29 23:39:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:39:56] [INFO ] Removed a total of 2448 redundant transitions.
[2025-05-29 23:39:56] [INFO ] Flatten gal took : 215 ms
[2025-05-29 23:39:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 60 ms.
[2025-05-29 23:39:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality13590806381988431013.gal : 30 ms
[2025-05-29 23:39:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality8712365068581636268.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/LTLCardinality13590806381988431013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8712365068581636268.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...277
Read 1 LTL properties
Checking formula 0 : !((X((((G(!("((i8.i1.i0.u68.p370==0)||(i14.u331.p1524==1))")))U(X("((i18.i1.i3.u257.p1184==0)||(i24.u345.p1635==1))")))||(G(F("(i21.u2...199
Formula 0 simplified : X(((F"((i8.i1.i0.u68.p370==0)||(i14.u331.p1524==1))" R X!"((i18.i1.i3.u257.p1184==0)||(i24.u345.p1635==1))") & FG!"(i21.u296.p1388==...185
Compilation finished in 4764 ms.
Running link step : cd /tmp/ltsmin428512107133012057;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin428512107133012057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((([](!(LTLAPp4==true)) U X((LTLAPp5==true)))||[](<>((LTLAPp6==true)))) U (LTLAPp6==true)))' '--buchi-type=spotba'
LTSmin run took 2140 ms.
FORMULA CloudDeployment-PT-6b-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 802757 ms.

BK_STOP 1748562002648

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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