Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.9K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 253K Jun 5 20:08 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 MedleyB-PT-B02-LTLFireability-00
FORMULA_NAME MedleyB-PT-B02-LTLFireability-01
FORMULA_NAME MedleyB-PT-B02-LTLFireability-02
FORMULA_NAME MedleyB-PT-B02-LTLFireability-03
FORMULA_NAME MedleyB-PT-B02-LTLFireability-04
FORMULA_NAME MedleyB-PT-B02-LTLFireability-05
FORMULA_NAME MedleyB-PT-B02-LTLFireability-06
FORMULA_NAME MedleyB-PT-B02-LTLFireability-07
FORMULA_NAME MedleyB-PT-B02-LTLFireability-08
FORMULA_NAME MedleyB-PT-B02-LTLFireability-09
FORMULA_NAME MedleyB-PT-B02-LTLFireability-10
FORMULA_NAME MedleyB-PT-B02-LTLFireability-11
FORMULA_NAME MedleyB-PT-B02-LTLFireability-12
FORMULA_NAME MedleyB-PT-B02-LTLFireability-13
FORMULA_NAME MedleyB-PT-B02-LTLFireability-14
FORMULA_NAME MedleyB-PT-B02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749386912222

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-08 12:48:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 12:48:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 12:48:33] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2025-06-08 12:48:33] [INFO ] Transformed 1227 places.
[2025-06-08 12:48:33] [INFO ] Transformed 1472 transitions.
[2025-06-08 12:48:33] [INFO ] Found NUPN structural information;
[2025-06-08 12:48:33] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyB-PT-B02-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 94 place count 1133 transition count 1378
Iterating global reduction 0 with 94 rules applied. Total rules applied 188 place count 1133 transition count 1378
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 243 place count 1078 transition count 1323
Iterating global reduction 0 with 55 rules applied. Total rules applied 298 place count 1078 transition count 1323
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 330 place count 1046 transition count 1291
Iterating global reduction 0 with 32 rules applied. Total rules applied 362 place count 1046 transition count 1291
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 390 place count 1018 transition count 1263
Iterating global reduction 0 with 28 rules applied. Total rules applied 418 place count 1018 transition count 1263
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 440 place count 996 transition count 1241
Iterating global reduction 0 with 22 rules applied. Total rules applied 462 place count 996 transition count 1241
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 484 place count 974 transition count 1219
Iterating global reduction 0 with 22 rules applied. Total rules applied 506 place count 974 transition count 1219
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 528 place count 952 transition count 1197
Iterating global reduction 0 with 22 rules applied. Total rules applied 550 place count 952 transition count 1197
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 572 place count 930 transition count 1175
Iterating global reduction 0 with 22 rules applied. Total rules applied 594 place count 930 transition count 1175
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 611 place count 913 transition count 1158
Iterating global reduction 0 with 17 rules applied. Total rules applied 628 place count 913 transition count 1158
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 639 place count 902 transition count 1147
Iterating global reduction 0 with 11 rules applied. Total rules applied 650 place count 902 transition count 1147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 651 place count 902 transition count 1146
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 655 place count 898 transition count 1142
Iterating global reduction 1 with 4 rules applied. Total rules applied 659 place count 898 transition count 1142
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 663 place count 894 transition count 1138
Iterating global reduction 1 with 4 rules applied. Total rules applied 667 place count 894 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 668 place count 893 transition count 1137
Iterating global reduction 1 with 1 rules applied. Total rules applied 669 place count 893 transition count 1137
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 670 place count 892 transition count 1136
Iterating global reduction 1 with 1 rules applied. Total rules applied 671 place count 892 transition count 1136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 672 place count 891 transition count 1135
Iterating global reduction 1 with 1 rules applied. Total rules applied 673 place count 891 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 674 place count 890 transition count 1134
Iterating global reduction 1 with 1 rules applied. Total rules applied 675 place count 890 transition count 1134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 676 place count 889 transition count 1133
Iterating global reduction 1 with 1 rules applied. Total rules applied 677 place count 889 transition count 1133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 678 place count 888 transition count 1132
Iterating global reduction 1 with 1 rules applied. Total rules applied 679 place count 888 transition count 1132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 680 place count 887 transition count 1131
Iterating global reduction 1 with 1 rules applied. Total rules applied 681 place count 887 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 682 place count 886 transition count 1130
Iterating global reduction 1 with 1 rules applied. Total rules applied 683 place count 886 transition count 1130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 684 place count 885 transition count 1129
Iterating global reduction 1 with 1 rules applied. Total rules applied 685 place count 885 transition count 1129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 686 place count 884 transition count 1128
Iterating global reduction 1 with 1 rules applied. Total rules applied 687 place count 884 transition count 1128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 688 place count 884 transition count 1127
Applied a total of 688 rules in 1047 ms. Remains 884 /1227 variables (removed 343) and now considering 1127/1472 (removed 345) transitions.
// Phase 1: matrix 1127 rows 884 cols
[2025-06-08 12:48:34] [INFO ] Computed 5 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:48:35] [INFO ] Implicit Places using invariants in 600 ms returned []
[2025-06-08 12:48:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:48:36] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
Running 1126 sub problems to find dead transitions.
[2025-06-08 12:48:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/883 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1126 unsolved
SMT process timed out in 30463ms, After SMT, problems are : Problem set: 0 solved, 1126 unsolved
Search for dead transitions found 0 dead transitions in 30478ms
Starting structural reductions in LTL mode, iteration 1 : 884/1227 places, 1127/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32989 ms. Remains : 884/1227 places, 1127/1472 transitions.
Support contains 46 out of 884 places after structural reductions.
[2025-06-08 12:49:07] [INFO ] Flatten gal took : 95 ms
[2025-06-08 12:49:07] [INFO ] Flatten gal took : 55 ms
[2025-06-08 12:49:07] [INFO ] Input system was already deterministic with 1127 transitions.
Support contains 45 out of 884 places (down from 46) after GAL structural reductions.
RANDOM walk for 40000 steps (508 resets) in 1328 ms. (30 steps per ms) remains 23/33 properties
BEST_FIRST walk for 4003 steps (9 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (11 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 80 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (11 resets) in 85 ms. (46 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (9 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (11 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (11 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (10 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
[2025-06-08 12:49:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 837/870 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:08] [INFO ] Deduced a trap composed of 324 places in 215 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:08] [INFO ] Deduced a trap composed of 315 places in 211 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:09] [INFO ] Deduced a trap composed of 313 places in 274 ms of which 96 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/870 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 14/884 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 1127/2011 variables, 884/892 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:12] [INFO ] Deduced a trap composed of 318 places in 220 ms of which 32 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2011 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2011/2011 variables, and 893 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 884/884 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 837/870 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:13] [INFO ] Deduced a trap composed of 316 places in 303 ms of which 102 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/870 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 14/884 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 1127/2011 variables, 884/894 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2011 variables, 22/916 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2011/2011 variables, and 916 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 884/884 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10045ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Graph (trivial) has 816 edges and 884 vertex of which 49 / 884 are part of one of the 10 SCC in 6 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Graph (complete) has 1321 edges and 845 vertex of which 841 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 591 rules applied. Total rules applied 593 place count 841 transition count 483
Reduce places removed 587 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 599 rules applied. Total rules applied 1192 place count 254 transition count 471
Reduce places removed 5 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 19 rules applied. Total rules applied 1211 place count 249 transition count 457
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 16 rules applied. Total rules applied 1227 place count 235 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1228 place count 234 transition count 455
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 49 Pre rules applied. Total rules applied 1228 place count 234 transition count 406
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 1326 place count 185 transition count 406
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 1386 place count 155 transition count 376
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1391 place count 155 transition count 371
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1406 place count 140 transition count 306
Iterating global reduction 6 with 15 rules applied. Total rules applied 1421 place count 140 transition count 306
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1428 place count 140 transition count 299
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1434 place count 134 transition count 293
Iterating global reduction 7 with 6 rules applied. Total rules applied 1440 place count 134 transition count 293
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1445 place count 129 transition count 288
Iterating global reduction 7 with 5 rules applied. Total rules applied 1450 place count 129 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1452 place count 129 transition count 286
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1466 place count 122 transition count 279
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1476 place count 117 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1478 place count 117 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1481 place count 117 transition count 297
Free-agglomeration rule applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 1500 place count 117 transition count 278
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1519 place count 98 transition count 278
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1521 place count 96 transition count 276
Iterating global reduction 10 with 2 rules applied. Total rules applied 1523 place count 96 transition count 276
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 1530 place count 96 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1533 place count 96 transition count 273
Applied a total of 1533 rules in 168 ms. Remains 96 /884 variables (removed 788) and now considering 273/1127 (removed 854) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 96/884 places, 273/1127 transitions.
RANDOM walk for 40000 steps (2110 resets) in 1110 ms. (36 steps per ms) remains 3/22 properties
BEST_FIRST walk for 40003 steps (383 resets) in 79 ms. (500 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (380 resets) in 64 ms. (615 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (388 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
// Phase 1: matrix 273 rows 96 cols
[2025-06-08 12:49:18] [INFO ] Computed 5 invariants in 3 ms
[2025-06-08 12:49:18] [INFO ] State equation strengthened by 110 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) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/96 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/369 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 110/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/369 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/96 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/369 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 110/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 39 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 6 ms.
FORMULA MedleyB-PT-B02-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA MedleyB-PT-B02-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 167 stabilizing places and 175 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))||(F(p0)&&F(p1))) U X(X(G(p2)))))'
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 871 transition count 1114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 871 transition count 1114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 871 transition count 1113
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 861 transition count 1103
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 861 transition count 1103
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 854 transition count 1096
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 854 transition count 1096
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 847 transition count 1089
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 847 transition count 1089
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 81 place count 841 transition count 1083
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 841 transition count 1083
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 93 place count 835 transition count 1077
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 835 transition count 1077
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 830 transition count 1072
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 830 transition count 1072
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 114 place count 825 transition count 1067
Iterating global reduction 1 with 5 rules applied. Total rules applied 119 place count 825 transition count 1067
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 124 place count 820 transition count 1062
Iterating global reduction 1 with 5 rules applied. Total rules applied 129 place count 820 transition count 1062
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 133 place count 816 transition count 1058
Iterating global reduction 1 with 4 rules applied. Total rules applied 137 place count 816 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 138 place count 816 transition count 1057
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 813 transition count 1054
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 813 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 147 place count 810 transition count 1051
Iterating global reduction 2 with 3 rules applied. Total rules applied 150 place count 810 transition count 1051
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 810 transition count 1050
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 808 transition count 1048
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 808 transition count 1048
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 806 transition count 1046
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 806 transition count 1046
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 161 place count 804 transition count 1044
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 804 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 165 place count 802 transition count 1042
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 802 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 169 place count 800 transition count 1040
Iterating global reduction 3 with 2 rules applied. Total rules applied 171 place count 800 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 798 transition count 1038
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 798 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 796 transition count 1036
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 796 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 181 place count 794 transition count 1034
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 794 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 792 transition count 1032
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 792 transition count 1032
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 792 transition count 1030
Applied a total of 189 rules in 734 ms. Remains 792 /884 variables (removed 92) and now considering 1030/1127 (removed 97) transitions.
// Phase 1: matrix 1030 rows 792 cols
[2025-06-08 12:49:20] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:49:20] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-06-08 12:49:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:49:21] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
Running 1029 sub problems to find dead transitions.
[2025-06-08 12:49:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/791 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 30225ms
Starting structural reductions in LTL mode, iteration 1 : 792/884 places, 1030/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32201 ms. Remains : 792/884 places, 1030/1127 transitions.
Stuttering acceptance computed with spot in 490 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-00
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 3 ms.
FORMULA MedleyB-PT-B02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-00 finished in 32776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Graph (trivial) has 878 edges and 884 vertex of which 66 / 884 are part of one of the 12 SCC in 3 ms
Free SCC test removed 54 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 620 transitions
Trivial Post-agglo rules discarded 620 transitions
Performed 620 trivial Post agglomeration. Transition count delta: 620
Iterating post reduction 0 with 620 rules applied. Total rules applied 621 place count 829 transition count 445
Reduce places removed 620 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 633 rules applied. Total rules applied 1254 place count 209 transition count 432
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1260 place count 204 transition count 431
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1260 place count 204 transition count 386
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1350 place count 159 transition count 386
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1357 place count 152 transition count 379
Iterating global reduction 3 with 7 rules applied. Total rules applied 1364 place count 152 transition count 379
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1368 place count 148 transition count 375
Iterating global reduction 3 with 4 rules applied. Total rules applied 1372 place count 148 transition count 375
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1375 place count 145 transition count 372
Iterating global reduction 3 with 3 rules applied. Total rules applied 1378 place count 145 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1379 place count 145 transition count 371
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1381 place count 143 transition count 369
Iterating global reduction 4 with 2 rules applied. Total rules applied 1383 place count 143 transition count 369
Performed 32 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 1447 place count 111 transition count 335
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 1470 place count 88 transition count 187
Iterating global reduction 4 with 23 rules applied. Total rules applied 1493 place count 88 transition count 187
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1505 place count 88 transition count 175
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1516 place count 77 transition count 161
Iterating global reduction 5 with 11 rules applied. Total rules applied 1527 place count 77 transition count 161
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1538 place count 66 transition count 147
Iterating global reduction 5 with 11 rules applied. Total rules applied 1549 place count 66 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1555 place count 66 transition count 141
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1573 place count 57 transition count 148
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1574 place count 56 transition count 138
Iterating global reduction 6 with 1 rules applied. Total rules applied 1575 place count 56 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1576 place count 56 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 1581 place count 56 transition count 132
Applied a total of 1581 rules in 73 ms. Remains 56 /884 variables (removed 828) and now considering 132/1127 (removed 995) transitions.
[2025-06-08 12:49:52] [INFO ] Flow matrix only has 126 transitions (discarded 6 similar events)
// Phase 1: matrix 126 rows 56 cols
[2025-06-08 12:49:52] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:49:52] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-08 12:49:52] [INFO ] Flow matrix only has 126 transitions (discarded 6 similar events)
[2025-06-08 12:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:49:52] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 12:49:52] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:49:52] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2025-06-08 12:49:52] [INFO ] Flow matrix only has 126 transitions (discarded 6 similar events)
[2025-06-08 12:49:52] [INFO ] Invariant cache hit.
[2025-06-08 12:49:52] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:52] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:52] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:53] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:53] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:53] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:53] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:53] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:53] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:53] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 125/181 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:54] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:49:54] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 1/182 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 85 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 125/181 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 115/199 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 1/182 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/182 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 200 constraints, problems are : Problem set: 0 solved, 115 unsolved in 14173 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20488ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 20488ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/884 places, 132/1127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20710 ms. Remains : 56/884 places, 132/1127 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-01
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-01 finished in 20777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(!p0)||(p1&&X((p1 U (!p2||G(p1)))))))||((G(!p0)||(p1&&X((p1 U (!p2||G(p1))))))&&(G(p1)||(p1&&F((G(F(p3))||(!p0&&F(p3)))))))))'
Support contains 10 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 870 transition count 1113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 870 transition count 1113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 870 transition count 1112
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 859 transition count 1101
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 859 transition count 1101
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 851 transition count 1093
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 851 transition count 1093
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 843 transition count 1085
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 843 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 836 transition count 1078
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 836 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 829 transition count 1071
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 829 transition count 1071
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 829 transition count 1070
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 824 transition count 1065
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 824 transition count 1065
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 127 place count 819 transition count 1060
Iterating global reduction 2 with 5 rules applied. Total rules applied 132 place count 819 transition count 1060
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 137 place count 814 transition count 1055
Iterating global reduction 2 with 5 rules applied. Total rules applied 142 place count 814 transition count 1055
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 146 place count 810 transition count 1051
Iterating global reduction 2 with 4 rules applied. Total rules applied 150 place count 810 transition count 1051
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 810 transition count 1050
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 154 place count 807 transition count 1047
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 807 transition count 1047
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 804 transition count 1044
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 804 transition count 1044
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 804 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 166 place count 802 transition count 1041
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 802 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 170 place count 800 transition count 1039
Iterating global reduction 4 with 2 rules applied. Total rules applied 172 place count 800 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 798 transition count 1037
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 798 transition count 1037
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 178 place count 796 transition count 1035
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 796 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 794 transition count 1033
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 794 transition count 1033
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 186 place count 792 transition count 1031
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 792 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 190 place count 790 transition count 1029
Iterating global reduction 4 with 2 rules applied. Total rules applied 192 place count 790 transition count 1029
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 788 transition count 1027
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 788 transition count 1027
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 198 place count 786 transition count 1025
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 786 transition count 1025
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 202 place count 786 transition count 1023
Applied a total of 202 rules in 533 ms. Remains 786 /884 variables (removed 98) and now considering 1023/1127 (removed 104) transitions.
// Phase 1: matrix 1023 rows 786 cols
[2025-06-08 12:50:13] [INFO ] Computed 5 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:13] [INFO ] Implicit Places using invariants in 343 ms returned []
[2025-06-08 12:50:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:14] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2025-06-08 12:50:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1022 unsolved
SMT process timed out in 30268ms, After SMT, problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 30274ms
Starting structural reductions in LTL mode, iteration 1 : 786/884 places, 1023/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31920 ms. Remains : 786/884 places, 1023/1127 transitions.
Stuttering acceptance computed with spot in 484 ms :[(AND p0 (NOT p1)), true, p0, (AND (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p3) p0), (NOT p3), (AND (NOT p3) (NOT p0) (NOT p1) p2), (NOT p3)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 345 ms.
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Detected a total of 164/786 stabilizing places and 172/1023 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 40 factoid took 24 ms. Reduced automaton from 11 states, 32 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyB-PT-B02-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B02-LTLFireability-05 finished in 33134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!(G(X(p1))||G(p2))&&X(p2))))'
Support contains 7 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 870 transition count 1113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 870 transition count 1113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 870 transition count 1112
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 859 transition count 1101
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 859 transition count 1101
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 851 transition count 1093
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 851 transition count 1093
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 843 transition count 1085
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 843 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 836 transition count 1078
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 836 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 829 transition count 1071
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 829 transition count 1071
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 829 transition count 1070
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 824 transition count 1065
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 824 transition count 1065
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 127 place count 819 transition count 1060
Iterating global reduction 2 with 5 rules applied. Total rules applied 132 place count 819 transition count 1060
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 137 place count 814 transition count 1055
Iterating global reduction 2 with 5 rules applied. Total rules applied 142 place count 814 transition count 1055
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 146 place count 810 transition count 1051
Iterating global reduction 2 with 4 rules applied. Total rules applied 150 place count 810 transition count 1051
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 810 transition count 1050
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 154 place count 807 transition count 1047
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 807 transition count 1047
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 804 transition count 1044
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 804 transition count 1044
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 804 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 166 place count 802 transition count 1041
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 802 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 170 place count 800 transition count 1039
Iterating global reduction 4 with 2 rules applied. Total rules applied 172 place count 800 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 798 transition count 1037
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 798 transition count 1037
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 178 place count 796 transition count 1035
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 796 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 794 transition count 1033
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 794 transition count 1033
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 186 place count 792 transition count 1031
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 792 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 190 place count 790 transition count 1029
Iterating global reduction 4 with 2 rules applied. Total rules applied 192 place count 790 transition count 1029
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 788 transition count 1027
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 788 transition count 1027
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 198 place count 786 transition count 1025
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 786 transition count 1025
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 202 place count 786 transition count 1023
Applied a total of 202 rules in 519 ms. Remains 786 /884 variables (removed 98) and now considering 1023/1127 (removed 104) transitions.
[2025-06-08 12:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:46] [INFO ] Implicit Places using invariants in 356 ms returned []
[2025-06-08 12:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:50:47] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2025-06-08 12:50:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1022 unsolved
SMT process timed out in 30238ms, After SMT, problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 30243ms
Starting structural reductions in LTL mode, iteration 1 : 786/884 places, 1023/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31890 ms. Remains : 786/884 places, 1023/1127 transitions.
Stuttering acceptance computed with spot in 335 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), p2, (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-07
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-07 finished in 32255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((F(p1) U p2)))))'
Support contains 6 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 871 transition count 1114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 871 transition count 1114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 871 transition count 1113
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 861 transition count 1103
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 861 transition count 1103
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 854 transition count 1096
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 854 transition count 1096
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 847 transition count 1089
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 847 transition count 1089
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 81 place count 841 transition count 1083
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 841 transition count 1083
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 93 place count 835 transition count 1077
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 835 transition count 1077
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 835 transition count 1076
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 831 transition count 1072
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 831 transition count 1072
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 827 transition count 1068
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 827 transition count 1068
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 823 transition count 1064
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 823 transition count 1064
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 127 place count 820 transition count 1061
Iterating global reduction 2 with 3 rules applied. Total rules applied 130 place count 820 transition count 1061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 131 place count 820 transition count 1060
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 818 transition count 1058
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 818 transition count 1058
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 137 place count 816 transition count 1056
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 816 transition count 1056
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 814 transition count 1054
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 814 transition count 1054
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 812 transition count 1052
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 812 transition count 1052
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 810 transition count 1050
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 810 transition count 1050
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 808 transition count 1048
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 808 transition count 1048
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 806 transition count 1046
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 806 transition count 1046
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 161 place count 804 transition count 1044
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 804 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 165 place count 802 transition count 1042
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 802 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 169 place count 800 transition count 1040
Iterating global reduction 3 with 2 rules applied. Total rules applied 171 place count 800 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 798 transition count 1038
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 798 transition count 1038
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 177 place count 798 transition count 1036
Applied a total of 177 rules in 534 ms. Remains 798 /884 variables (removed 86) and now considering 1036/1127 (removed 91) transitions.
// Phase 1: matrix 1036 rows 798 cols
[2025-06-08 12:51:18] [INFO ] Computed 5 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:51:19] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-06-08 12:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:51:19] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Running 1035 sub problems to find dead transitions.
[2025-06-08 12:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/797 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
SMT process timed out in 30240ms, After SMT, problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 30245ms
Starting structural reductions in LTL mode, iteration 1 : 798/884 places, 1036/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31927 ms. Remains : 798/884 places, 1036/1127 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-08 finished in 32146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&G(p2))))))'
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Graph (trivial) has 874 edges and 884 vertex of which 65 / 884 are part of one of the 12 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 618 transitions
Trivial Post-agglo rules discarded 618 transitions
Performed 618 trivial Post agglomeration. Transition count delta: 618
Iterating post reduction 0 with 618 rules applied. Total rules applied 619 place count 830 transition count 448
Reduce places removed 618 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 631 rules applied. Total rules applied 1250 place count 212 transition count 435
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1255 place count 207 transition count 435
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1255 place count 207 transition count 390
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1345 place count 162 transition count 390
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1352 place count 155 transition count 383
Iterating global reduction 3 with 7 rules applied. Total rules applied 1359 place count 155 transition count 383
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1363 place count 151 transition count 379
Iterating global reduction 3 with 4 rules applied. Total rules applied 1367 place count 151 transition count 379
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1370 place count 148 transition count 376
Iterating global reduction 3 with 3 rules applied. Total rules applied 1373 place count 148 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1374 place count 148 transition count 375
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1376 place count 146 transition count 373
Iterating global reduction 4 with 2 rules applied. Total rules applied 1378 place count 146 transition count 373
Performed 31 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1440 place count 115 transition count 340
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 1463 place count 92 transition count 192
Iterating global reduction 4 with 23 rules applied. Total rules applied 1486 place count 92 transition count 192
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1498 place count 92 transition count 180
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1508 place count 82 transition count 167
Iterating global reduction 5 with 10 rules applied. Total rules applied 1518 place count 82 transition count 167
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1528 place count 72 transition count 154
Iterating global reduction 5 with 10 rules applied. Total rules applied 1538 place count 72 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1543 place count 72 transition count 149
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1563 place count 62 transition count 169
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1564 place count 61 transition count 159
Iterating global reduction 6 with 1 rules applied. Total rules applied 1565 place count 61 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1566 place count 61 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 1571 place count 61 transition count 153
Applied a total of 1571 rules in 44 ms. Remains 61 /884 variables (removed 823) and now considering 153/1127 (removed 974) transitions.
[2025-06-08 12:51:50] [INFO ] Flow matrix only has 147 transitions (discarded 6 similar events)
// Phase 1: matrix 147 rows 61 cols
[2025-06-08 12:51:50] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:51:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-08 12:51:50] [INFO ] Flow matrix only has 147 transitions (discarded 6 similar events)
[2025-06-08 12:51:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:51:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 12:51:50] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:51:50] [INFO ] Redundant transitions in 6 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-08 12:51:50] [INFO ] Flow matrix only has 147 transitions (discarded 6 similar events)
[2025-06-08 12:51:50] [INFO ] Invariant cache hit.
[2025-06-08 12:51:50] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:51] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:52] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 146/207 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 21/98 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 99 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8072 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:59] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:51:59] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 146/207 variables, 61/79 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 21/100 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 128/228 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:52:01] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 1/208 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 14 (OVERLAPS) 0/208 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 230 constraints, problems are : Problem set: 0 solved, 128 unsolved in 27546 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35646ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 35647ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/884 places, 153/1127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35844 ms. Remains : 61/884 places, 153/1127 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-09 finished in 35996 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((!p1||G(p2)))))'
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 872 transition count 1115
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 872 transition count 1115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 872 transition count 1114
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 863 transition count 1105
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 863 transition count 1105
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 857 transition count 1099
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 857 transition count 1099
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 61 place count 851 transition count 1093
Iterating global reduction 1 with 6 rules applied. Total rules applied 67 place count 851 transition count 1093
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 846 transition count 1088
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 846 transition count 1088
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 841 transition count 1083
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 841 transition count 1083
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 837 transition count 1079
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 837 transition count 1079
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 99 place count 833 transition count 1075
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 833 transition count 1075
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 107 place count 829 transition count 1071
Iterating global reduction 1 with 4 rules applied. Total rules applied 111 place count 829 transition count 1071
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 826 transition count 1068
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 826 transition count 1068
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 118 place count 826 transition count 1067
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 824 transition count 1065
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 824 transition count 1065
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 822 transition count 1063
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 822 transition count 1063
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 822 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 821 transition count 1061
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 821 transition count 1061
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 820 transition count 1060
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 820 transition count 1060
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 819 transition count 1059
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 819 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 818 transition count 1058
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 818 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 817 transition count 1057
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 817 transition count 1057
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 816 transition count 1056
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 816 transition count 1056
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 815 transition count 1055
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 815 transition count 1055
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 814 transition count 1054
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 814 transition count 1054
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 813 transition count 1053
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 813 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 813 transition count 1052
Applied a total of 146 rules in 507 ms. Remains 813 /884 variables (removed 71) and now considering 1052/1127 (removed 75) transitions.
// Phase 1: matrix 1052 rows 813 cols
[2025-06-08 12:52:26] [INFO ] Computed 5 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:52:27] [INFO ] Implicit Places using invariants in 413 ms returned []
[2025-06-08 12:52:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:52:28] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
Running 1051 sub problems to find dead transitions.
[2025-06-08 12:52:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/812 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1051 unsolved
SMT process timed out in 30221ms, After SMT, problems are : Problem set: 0 solved, 1051 unsolved
Search for dead transitions found 0 dead transitions in 30226ms
Starting structural reductions in LTL mode, iteration 1 : 813/884 places, 1052/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31965 ms. Remains : 813/884 places, 1052/1127 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-10
Product exploration explored 100000 steps with 1299 reset in 146 ms.
Product exploration explored 100000 steps with 1294 reset in 161 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 120 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), true, (NOT p2)]
RANDOM walk for 40000 steps (507 resets) in 327 ms. (121 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40002 steps (109 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (108 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (106 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (108 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (109 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (107 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (110 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (109 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
[2025-06-08 12:52:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf5 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 412/415 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 398/813 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:53:00] [INFO ] Deduced a trap composed of 291 places in 325 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:53:00] [INFO ] Deduced a trap composed of 297 places in 341 ms of which 124 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1052/1865 variables, 813/820 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1865 variables, 0/820 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1865 variables, 0/820 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1865/1865 variables, and 820 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2288 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 813/813 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 413/415 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 398/813 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:53:02] [INFO ] Deduced a trap composed of 297 places in 329 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:53:02] [INFO ] Deduced a trap composed of 291 places in 249 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:53:03] [INFO ] Deduced a trap composed of 298 places in 186 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 3/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:53:03] [INFO ] Deduced a trap composed of 289 places in 246 ms of which 79 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/813 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1052/1865 variables, 813/824 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1865 variables, 6/830 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:53:04] [INFO ] Deduced a trap composed of 298 places in 265 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:53:04] [INFO ] Deduced a trap composed of 319 places in 205 ms of which 23 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1865 variables, 2/832 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1865 variables, 0/832 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1865 variables, 0/832 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1865/1865 variables, and 832 constraints, problems are : Problem set: 2 solved, 6 unsolved in 3845 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 813/813 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6147ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 413 ms.
Support contains 2 out of 813 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 813/813 places, 1052/1052 transitions.
Graph (trivial) has 807 edges and 813 vertex of which 64 / 813 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1215 edges and 761 vertex of which 757 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 570 transitions
Trivial Post-agglo rules discarded 570 transitions
Performed 570 trivial Post agglomeration. Transition count delta: 570
Iterating post reduction 0 with 574 rules applied. Total rules applied 576 place count 757 transition count 406
Reduce places removed 570 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 582 rules applied. Total rules applied 1158 place count 187 transition count 394
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1162 place count 183 transition count 394
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1162 place count 183 transition count 346
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1258 place count 135 transition count 346
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 1259 place count 135 transition count 345
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1317 place count 106 transition count 316
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1325 place count 106 transition count 308
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1350 place count 81 transition count 154
Iterating global reduction 5 with 25 rules applied. Total rules applied 1375 place count 81 transition count 154
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1388 place count 81 transition count 141
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1400 place count 69 transition count 129
Iterating global reduction 6 with 12 rules applied. Total rules applied 1412 place count 69 transition count 129
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1420 place count 61 transition count 121
Iterating global reduction 6 with 8 rules applied. Total rules applied 1428 place count 61 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1432 place count 61 transition count 117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1440 place count 57 transition count 113
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1448 place count 53 transition count 134
Free-agglomeration rule applied 23 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 1471 place count 53 transition count 105
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 1513 place count 30 transition count 86
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1517 place count 26 transition count 82
Iterating global reduction 8 with 4 rules applied. Total rules applied 1521 place count 26 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1522 place count 26 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 1549 place count 26 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1551 place count 25 transition count 57
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1555 place count 25 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1557 place count 25 transition count 55
Applied a total of 1557 rules in 33 ms. Remains 25 /813 variables (removed 788) and now considering 55/1052 (removed 997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 25/813 places, 55/1052 transitions.
RANDOM walk for 2333 steps (0 resets) in 8 ms. (259 steps per ms) remains 0/6 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (OR (NOT p2) p0)), (G (OR (NOT p1) (NOT p2) p0))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 21 factoid took 355 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 187 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), true]
[2025-06-08 12:53:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-08 12:53:07] [INFO ] [Real]Absence check using 5 positive place invariants in 56 ms returned sat
[2025-06-08 12:53:11] [INFO ] [Real]Absence check using state equation in 4214 ms returned sat
[2025-06-08 12:53:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-08 12:53:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 26 ms returned sat
[2025-06-08 12:53:14] [INFO ] [Nat]Absence check using state equation in 2550 ms returned sat
[2025-06-08 12:53:14] [INFO ] Computed and/alt/rep : 1026/1732/1026 causal constraints (skipped 25 transitions) in 50 ms.
[2025-06-08 12:53:26] [INFO ] Added : 585 causal constraints over 117 iterations in 12088 ms. Result :unknown
Could not prove EG (AND p1 (NOT p2))
Support contains 3 out of 813 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 813/813 places, 1052/1052 transitions.
Applied a total of 0 rules in 21 ms. Remains 813 /813 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
[2025-06-08 12:53:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:53:27] [INFO ] Implicit Places using invariants in 406 ms returned []
[2025-06-08 12:53:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:53:27] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
Running 1051 sub problems to find dead transitions.
[2025-06-08 12:53:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 timeout
1.0)
(s58 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/812 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1051 unsolved
SMT process timed out in 30339ms, After SMT, problems are : Problem set: 0 solved, 1051 unsolved
Search for dead transitions found 0 dead transitions in 30344ms
Finished structural reductions in LTL mode , in 1 iterations and 31600 ms. Remains : 813/813 places, 1052/1052 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 146 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (510 resets) in 165 ms. (240 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (111 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (110 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (107 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (105 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
[2025-06-08 12:53:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 413/415 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 398/813 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:53:59] [INFO ] Deduced a trap composed of 291 places in 336 ms of which 132 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1052/1865 variables, 813/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1865 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1865 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1865/1865 variables, and 819 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1519 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 813/813 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 413/415 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 398/813 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/813 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-06-08 12:54:00] [INFO ] Deduced a trap composed of 297 places in 341 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:01] [INFO ] Deduced a trap composed of 298 places in 277 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:01] [INFO ] Deduced a trap composed of 292 places in 285 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:01] [INFO ] Deduced a trap composed of 312 places in 327 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:02] [INFO ] Deduced a trap composed of 312 places in 304 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:02] [INFO ] Deduced a trap composed of 311 places in 293 ms of which 110 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1052/1865 variables, 813/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1865 variables, 4/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1865 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1865 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1865/1865 variables, and 829 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3260 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 813/813 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4787ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 285 ms.
Support contains 2 out of 813 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 813/813 places, 1052/1052 transitions.
Graph (trivial) has 807 edges and 813 vertex of which 64 / 813 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1215 edges and 761 vertex of which 757 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 570 transitions
Trivial Post-agglo rules discarded 570 transitions
Performed 570 trivial Post agglomeration. Transition count delta: 570
Iterating post reduction 0 with 574 rules applied. Total rules applied 576 place count 757 transition count 406
Reduce places removed 570 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 582 rules applied. Total rules applied 1158 place count 187 transition count 394
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1162 place count 183 transition count 394
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1162 place count 183 transition count 346
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1258 place count 135 transition count 346
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 1259 place count 135 transition count 345
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1317 place count 106 transition count 316
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1325 place count 106 transition count 308
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1350 place count 81 transition count 154
Iterating global reduction 5 with 25 rules applied. Total rules applied 1375 place count 81 transition count 154
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1388 place count 81 transition count 141
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1400 place count 69 transition count 129
Iterating global reduction 6 with 12 rules applied. Total rules applied 1412 place count 69 transition count 129
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1420 place count 61 transition count 121
Iterating global reduction 6 with 8 rules applied. Total rules applied 1428 place count 61 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1432 place count 61 transition count 117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1440 place count 57 transition count 113
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1448 place count 53 transition count 134
Free-agglomeration rule applied 23 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 1471 place count 53 transition count 105
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 1513 place count 30 transition count 86
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1517 place count 26 transition count 82
Iterating global reduction 8 with 4 rules applied. Total rules applied 1521 place count 26 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1522 place count 26 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 1549 place count 26 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1551 place count 25 transition count 57
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1555 place count 25 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1557 place count 25 transition count 55
Applied a total of 1557 rules in 31 ms. Remains 25 /813 variables (removed 788) and now considering 55/1052 (removed 997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 25/813 places, 55/1052 transitions.
RANDOM walk for 141 steps (0 resets) in 4 ms. (28 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 13 factoid took 417 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 169 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), true]
[2025-06-08 12:54:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-08 12:54:04] [INFO ] [Real]Absence check using 5 positive place invariants in 55 ms returned sat
[2025-06-08 12:54:09] [INFO ] [Real]Absence check using state equation in 4289 ms returned sat
[2025-06-08 12:54:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-08 12:54:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 26 ms returned sat
[2025-06-08 12:54:12] [INFO ] [Nat]Absence check using state equation in 2544 ms returned sat
[2025-06-08 12:54:12] [INFO ] Computed and/alt/rep : 1026/1732/1026 causal constraints (skipped 25 transitions) in 53 ms.
[2025-06-08 12:54:24] [INFO ] Added : 595 causal constraints over 119 iterations in 12125 ms. Result :unknown
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 147 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 1282 reset in 113 ms.
Product exploration explored 100000 steps with 1302 reset in 243 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 170 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Support contains 3 out of 813 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 813/813 places, 1052/1052 transitions.
Graph (trivial) has 805 edges and 813 vertex of which 64 / 813 are part of one of the 12 SCC in 3 ms
Free SCC test removed 52 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Performed 560 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 560 rules applied. Total rules applied 561 place count 761 transition count 992
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 569 place count 761 transition count 984
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 569 place count 761 transition count 988
Deduced a syphon composed of 595 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 604 place count 761 transition count 988
Discarding 502 places :
Symmetric choice reduction at 2 with 502 rule applications. Total rules 1106 place count 259 transition count 486
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 2 with 502 rules applied. Total rules applied 1608 place count 259 transition count 486
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1653 place count 259 transition count 500
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 1727 place count 185 transition count 293
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 2 with 74 rules applied. Total rules applied 1801 place count 185 transition count 293
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 1817 place count 185 transition count 277
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1850 place count 152 transition count 240
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 3 with 33 rules applied. Total rules applied 1883 place count 152 transition count 240
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1895 place count 140 transition count 228
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1907 place count 140 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1911 place count 140 transition count 224
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1919 place count 132 transition count 216
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1927 place count 132 transition count 216
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1934 place count 132 transition count 251
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1945 place count 121 transition count 229
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1956 place count 121 transition count 229
Deduced a syphon composed of 59 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1964 place count 121 transition count 221
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 1964 rules in 82 ms. Remains 121 /813 variables (removed 692) and now considering 221/1052 (removed 831) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:54:25] [INFO ] Redundant transitions in 7 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-08 12:54:25] [INFO ] Flow matrix only has 216 transitions (discarded 5 similar events)
// Phase 1: matrix 216 rows 121 cols
[2025-06-08 12:54:25] [INFO ] Computed 2 invariants in 2 ms
[2025-06-08 12:54:25] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:26] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:26] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:26] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:27] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:27] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:27] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:27] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:27] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 3 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 8/10 constraints. Problems are: Problem set: 10 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 203 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD219 is UNSAT
At refinement iteration 4 (OVERLAPS) 215/336 variables, 121/131 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 39/170 constraints. Problems are: Problem set: 89 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:29] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 1/171 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/171 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/172 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/172 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 0/172 constraints. Problems are: Problem set: 89 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 172 constraints, problems are : Problem set: 89 solved, 124 unsolved in 21496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 89 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 60/121 variables, 2/2 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 9/11 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 215/336 variables, 121/132 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 39/171 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 124/295 constraints. Problems are: Problem set: 89 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:50] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:51] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:51] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 3/298 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/298 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 1/337 variables, 1/299 constraints. Problems are: Problem set: 89 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:57] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:54:59] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 2/301 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/301 constraints. Problems are: Problem set: 89 solved, 124 unsolved
At refinement iteration 12 (OVERLAPS) 0/337 variables, 0/301 constraints. Problems are: Problem set: 89 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 301 constraints, problems are : Problem set: 89 solved, 124 unsolved in 25482 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 124/213 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47010ms problems are : Problem set: 89 solved, 124 unsolved
Search for dead transitions found 89 dead transitions in 47012ms
Found 89 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 89 transitions
Dead transitions reduction (with SMT) removed 89 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 121/813 places, 132/1052 transitions.
Graph (complete) has 292 edges and 121 vertex of which 62 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.1 ms
Discarding 59 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 13 ms. Remains 62 /121 variables (removed 59) and now considering 140/132 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/813 places, 140/1052 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47122 ms. Remains : 62/813 places, 140/1052 transitions.
Built C files in :
/tmp/ltsmin7400126955553625546
[2025-06-08 12:55:12] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7400126955553625546
Running compilation step : cd /tmp/ltsmin7400126955553625546;'/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 2096 ms.
Running link step : cd /tmp/ltsmin7400126955553625546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin7400126955553625546;'/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/stateBased17130527153576101618.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 813 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 813/813 places, 1052/1052 transitions.
Applied a total of 0 rules in 30 ms. Remains 813 /813 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
// Phase 1: matrix 1052 rows 813 cols
[2025-06-08 12:55:27] [INFO ] Computed 5 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:55:27] [INFO ] Implicit Places using invariants in 420 ms returned []
[2025-06-08 12:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:55:28] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
Running 1051 sub problems to find dead transitions.
[2025-06-08 12:55:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/812 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1051 unsolved
SMT process timed out in 30213ms, After SMT, problems are : Problem set: 0 solved, 1051 unsolved
Search for dead transitions found 0 dead transitions in 30215ms
Finished structural reductions in LTL mode , in 1 iterations and 31480 ms. Remains : 813/813 places, 1052/1052 transitions.
Built C files in :
/tmp/ltsmin18279125349944801927
[2025-06-08 12:55:58] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18279125349944801927
Running compilation step : cd /tmp/ltsmin18279125349944801927;'/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 1748 ms.
Running link step : cd /tmp/ltsmin18279125349944801927;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18279125349944801927;'/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/stateBased7456527975395036967.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 12:56:14] [INFO ] Flatten gal took : 39 ms
[2025-06-08 12:56:14] [INFO ] Flatten gal took : 43 ms
[2025-06-08 12:56:14] [INFO ] Time to serialize gal into /tmp/LTL2318443413239581139.gal : 10 ms
[2025-06-08 12:56:14] [INFO ] Time to serialize properties into /tmp/LTL4376423337960929834.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/LTL2318443413239581139.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17338267112843058873.hoa' '-atoms' '/tmp/LTL4376423337960929834.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4376423337960929834.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17338267112843058873.hoa
Detected timeout of ITS tools.
[2025-06-08 12:56:29] [INFO ] Flatten gal took : 33 ms
[2025-06-08 12:56:29] [INFO ] Flatten gal took : 31 ms
[2025-06-08 12:56:29] [INFO ] Time to serialize gal into /tmp/LTL3850174975784338824.gal : 7 ms
[2025-06-08 12:56:29] [INFO ] Time to serialize properties into /tmp/LTL1145617776970597209.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/LTL3850174975784338824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1145617776970597209.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(("(p65!=1)")||(X("(p788!=1)"))))U(X(("(p788==1)")||(G("(p243==1)"))))))
Formula 0 simplified : F(!"(p65!=1)" & X!"(p788!=1)") R X(!"(p788==1)" & F!"(p243==1)")
Detected timeout of ITS tools.
[2025-06-08 12:56:44] [INFO ] Flatten gal took : 28 ms
[2025-06-08 12:56:44] [INFO ] Applying decomposition
[2025-06-08 12:56:44] [INFO ] Flatten gal took : 26 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/graph12820613665566090891.txt' '-o' '/tmp/graph12820613665566090891.bin' '-w' '/tmp/graph12820613665566090891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12820613665566090891.bin' '-l' '-1' '-v' '-w' '/tmp/graph12820613665566090891.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:56:44] [INFO ] Decomposing Gal with order
[2025-06-08 12:56:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:56:44] [INFO ] Removed a total of 858 redundant transitions.
[2025-06-08 12:56:44] [INFO ] Flatten gal took : 94 ms
[2025-06-08 12:56:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 23 ms.
[2025-06-08 12:56:44] [INFO ] Time to serialize gal into /tmp/LTL5655911094744535155.gal : 13 ms
[2025-06-08 12:56:44] [INFO ] Time to serialize properties into /tmp/LTL12095213363928883062.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/LTL5655911094744535155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12095213363928883062.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(("(i2.i1.i1.u26.p65!=1)")||(X("(i25.u223.p788!=1)"))))U(X(("(i25.u223.p788==1)")||(G("(i5.i0.i1.u66.p243==1)"))))))
Formula 0 simplified : F(!"(i2.i1.i1.u26.p65!=1)" & X!"(i25.u223.p788!=1)") R X(!"(i25.u223.p788==1)" & F!"(i5.i0.i1.u66.p243==1)")
Reverse transition relation is NOT exact ! Due to transitions t26, t81, t116, t227, t262, t364, t455, t552, t642, t747, t748, t804, t824, t825, t828, t831,...626
Computing Next relation with stutter on 89262 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B02-LTLFireability-10 finished in 273485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))||X(p2)))'
Support contains 6 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 871 transition count 1114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 871 transition count 1114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 871 transition count 1113
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 861 transition count 1103
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 861 transition count 1103
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 854 transition count 1096
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 854 transition count 1096
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 847 transition count 1089
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 847 transition count 1089
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 840 transition count 1082
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 840 transition count 1082
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 833 transition count 1075
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 833 transition count 1075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 833 transition count 1074
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 828 transition count 1069
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 828 transition count 1069
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 823 transition count 1064
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 823 transition count 1064
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 129 place count 818 transition count 1059
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 818 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 138 place count 814 transition count 1055
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 814 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 814 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 811 transition count 1051
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 811 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 809 transition count 1049
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 809 transition count 1049
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 809 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 808 transition count 1047
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 808 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 807 transition count 1046
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 807 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 806 transition count 1045
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 806 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 161 place count 805 transition count 1044
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 805 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 163 place count 804 transition count 1043
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 804 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 803 transition count 1042
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 803 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 167 place count 802 transition count 1041
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 802 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 801 transition count 1040
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 801 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 171 place count 800 transition count 1039
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 800 transition count 1039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 800 transition count 1038
Applied a total of 173 rules in 429 ms. Remains 800 /884 variables (removed 84) and now considering 1038/1127 (removed 89) transitions.
// Phase 1: matrix 1038 rows 800 cols
[2025-06-08 12:57:00] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:57:00] [INFO ] Implicit Places using invariants in 398 ms returned []
[2025-06-08 12:57:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:57:01] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
Running 1037 sub problems to find dead transitions.
[2025-06-08 12:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/799 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
SMT process timed out in 30227ms, After SMT, problems are : Problem set: 0 solved, 1037 unsolved
Search for dead transitions found 0 dead transitions in 30231ms
Starting structural reductions in LTL mode, iteration 1 : 800/884 places, 1038/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31908 ms. Remains : 800/884 places, 1038/1127 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-11
Product exploration explored 100000 steps with 1287 reset in 131 ms.
Product exploration explored 100000 steps with 1280 reset in 229 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 103 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (518 resets) in 388 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (104 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (109 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (103 resets) in 27 ms. (1428 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (109 resets) in 28 ms. (1379 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 595239 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 4
Probabilistic random walk after 595239 steps, saw 114239 distinct states, run finished after 3007 ms. (steps per millisecond=197 ) properties seen :0
[2025-06-08 12:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 781/786 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/786 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/800 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/800 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1038/1838 variables, 800/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1838 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1838 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1838/1838 variables, and 805 constraints, problems are : Problem set: 0 solved, 4 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 800/800 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 781/786 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/786 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/800 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/800 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1038/1838 variables, 800/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1838 variables, 4/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1838 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1838/1838 variables, and 809 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1571 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 800/800 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2371ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 378 ms.
Support contains 1 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 1038/1038 transitions.
Graph (trivial) has 796 edges and 800 vertex of which 64 / 800 are part of one of the 12 SCC in 0 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1201 edges and 748 vertex of which 744 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 565 rules applied. Total rules applied 567 place count 744 transition count 401
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 573 rules applied. Total rules applied 1140 place count 183 transition count 389
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1144 place count 179 transition count 389
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1144 place count 179 transition count 342
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1238 place count 132 transition count 342
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 1239 place count 132 transition count 341
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1297 place count 103 transition count 312
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1305 place count 103 transition count 304
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1330 place count 78 transition count 150
Iterating global reduction 5 with 25 rules applied. Total rules applied 1355 place count 78 transition count 150
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1368 place count 78 transition count 137
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1380 place count 66 transition count 125
Iterating global reduction 6 with 12 rules applied. Total rules applied 1392 place count 66 transition count 125
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1400 place count 58 transition count 117
Iterating global reduction 6 with 8 rules applied. Total rules applied 1408 place count 58 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1412 place count 58 transition count 113
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1420 place count 54 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1428 place count 50 transition count 130
Free-agglomeration rule applied 22 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1450 place count 50 transition count 101
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 1490 place count 28 transition count 83
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1494 place count 24 transition count 79
Iterating global reduction 8 with 4 rules applied. Total rules applied 1498 place count 24 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1499 place count 24 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 1525 place count 24 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1529 place count 22 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1537 place count 22 transition count 62
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1539 place count 22 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1540 place count 22 transition count 61
Applied a total of 1540 rules in 29 ms. Remains 22 /800 variables (removed 778) and now considering 61/1038 (removed 977) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 22/800 places, 61/1038 transitions.
RANDOM walk for 158 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p0))), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 8 factoid took 225 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 800 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1038/1038 transitions.
Applied a total of 0 rules in 26 ms. Remains 800 /800 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2025-06-08 12:57:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:57:39] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-06-08 12:57:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:57:40] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
Running 1037 sub problems to find dead transitions.
[2025-06-08 12:57:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/799 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
SMT process timed out in 30210ms, After SMT, problems are : Problem set: 0 solved, 1037 unsolved
Search for dead transitions found 0 dead transitions in 30213ms
Finished structural reductions in LTL mode , in 1 iterations and 31491 ms. Remains : 800/800 places, 1038/1038 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (508 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (111 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (107 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (107 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (109 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 603838 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 4
Probabilistic random walk after 603838 steps, saw 115695 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
[2025-06-08 12:58:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 781/786 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/786 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/800 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/800 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1038/1838 variables, 800/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1838 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1838 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1838/1838 variables, and 805 constraints, problems are : Problem set: 0 solved, 4 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 800/800 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 781/786 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/786 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/800 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/800 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1038/1838 variables, 800/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1838 variables, 4/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1838 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1838/1838 variables, and 809 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1535 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 800/800 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2192ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 94 ms.
Support contains 1 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 1038/1038 transitions.
Graph (trivial) has 796 edges and 800 vertex of which 64 / 800 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1201 edges and 748 vertex of which 744 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 565 rules applied. Total rules applied 567 place count 744 transition count 401
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 573 rules applied. Total rules applied 1140 place count 183 transition count 389
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1144 place count 179 transition count 389
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1144 place count 179 transition count 342
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1238 place count 132 transition count 342
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 1239 place count 132 transition count 341
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1297 place count 103 transition count 312
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1305 place count 103 transition count 304
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1330 place count 78 transition count 150
Iterating global reduction 5 with 25 rules applied. Total rules applied 1355 place count 78 transition count 150
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1368 place count 78 transition count 137
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1380 place count 66 transition count 125
Iterating global reduction 6 with 12 rules applied. Total rules applied 1392 place count 66 transition count 125
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1400 place count 58 transition count 117
Iterating global reduction 6 with 8 rules applied. Total rules applied 1408 place count 58 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1412 place count 58 transition count 113
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1420 place count 54 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1428 place count 50 transition count 130
Free-agglomeration rule applied 22 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1450 place count 50 transition count 101
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 1490 place count 28 transition count 83
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1494 place count 24 transition count 79
Iterating global reduction 8 with 4 rules applied. Total rules applied 1498 place count 24 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1499 place count 24 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 1525 place count 24 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1529 place count 22 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1537 place count 22 transition count 62
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1539 place count 22 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1540 place count 22 transition count 61
Applied a total of 1540 rules in 26 ms. Remains 22 /800 variables (removed 778) and now considering 61/1038 (removed 977) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 22/800 places, 61/1038 transitions.
RANDOM walk for 66 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1277 reset in 154 ms.
Product exploration explored 100000 steps with 1290 reset in 165 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 1038/1038 transitions.
Graph (trivial) has 792 edges and 800 vertex of which 64 / 800 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Performed 549 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 549 rules applied. Total rules applied 550 place count 748 transition count 978
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 558 place count 748 transition count 970
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 558 place count 748 transition count 974
Deduced a syphon composed of 583 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 592 place count 748 transition count 974
Discarding 493 places :
Symmetric choice reduction at 2 with 493 rule applications. Total rules 1085 place count 255 transition count 481
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 2 with 493 rules applied. Total rules applied 1578 place count 255 transition count 481
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1623 place count 255 transition count 494
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 1693 place count 185 transition count 352
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 1763 place count 185 transition count 352
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1776 place count 185 transition count 339
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1805 place count 156 transition count 306
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 3 with 29 rules applied. Total rules applied 1834 place count 156 transition count 306
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1846 place count 144 transition count 294
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1858 place count 144 transition count 294
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1862 place count 144 transition count 290
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1870 place count 136 transition count 282
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1878 place count 136 transition count 282
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1885 place count 136 transition count 317
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1896 place count 125 transition count 295
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1907 place count 125 transition count 295
Deduced a syphon composed of 60 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1915 place count 125 transition count 287
Deduced a syphon composed of 60 places in 0 ms
Applied a total of 1915 rules in 58 ms. Remains 125 /800 variables (removed 675) and now considering 287/1038 (removed 751) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:58:17] [INFO ] Redundant transitions in 3 ms returned []
Running 279 sub problems to find dead transitions.
[2025-06-08 12:58:17] [INFO ] Flow matrix only has 282 transitions (discarded 5 similar events)
// Phase 1: matrix 282 rows 125 cols
[2025-06-08 12:58:17] [INFO ] Computed 2 invariants in 1 ms
[2025-06-08 12:58:17] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:19] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:19] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:19] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:19] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:20] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 4 ms to minimize.
Problem TDEAD219 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:20] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 4 ms to minimize.
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 7/9 constraints. Problems are: Problem set: 10 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:20] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:21] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:21] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 3/12 constraints. Problems are: Problem set: 10 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 10 solved, 269 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD285 is UNSAT
At refinement iteration 5 (OVERLAPS) 281/406 variables, 125/137 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 39/176 constraints. Problems are: Problem set: 89 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:25] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:58:25] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 2/178 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/178 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 1/407 variables, 1/179 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/179 constraints. Problems are: Problem set: 89 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/407 variables, and 179 constraints, problems are : Problem set: 89 solved, 190 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 89 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 61/125 variables, 2/2 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 12/14 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 281/406 variables, 125/139 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 39/178 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 190/368 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/368 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 1/407 variables, 1/369 constraints. Problems are: Problem set: 89 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/369 constraints. Problems are: Problem set: 89 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 369 constraints, problems are : Problem set: 89 solved, 190 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 190/279 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 89 solved, 190 unsolved
Search for dead transitions found 89 dead transitions in 60121ms
Found 89 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 89 transitions
Dead transitions reduction (with SMT) removed 89 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 125/800 places, 198/1038 transitions.
Graph (complete) has 321 edges and 125 vertex of which 65 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 206
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 65 /125 variables (removed 60) and now considering 206/198 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/800 places, 206/1038 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60200 ms. Remains : 65/800 places, 206/1038 transitions.
Built C files in :
/tmp/ltsmin3760407615949628411
[2025-06-08 12:59:17] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3760407615949628411
Running compilation step : cd /tmp/ltsmin3760407615949628411;'/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 1697 ms.
Running link step : cd /tmp/ltsmin3760407615949628411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3760407615949628411;'/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/stateBased1202592660217908733.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1038/1038 transitions.
Applied a total of 0 rules in 26 ms. Remains 800 /800 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
// Phase 1: matrix 1038 rows 800 cols
[2025-06-08 12:59:32] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:59:33] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-06-08 12:59:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:59:33] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Running 1037 sub problems to find dead transitions.
[2025-06-08 12:59:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/799 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
SMT process timed out in 30218ms, After SMT, problems are : Problem set: 0 solved, 1037 unsolved
Search for dead transitions found 0 dead transitions in 30222ms
Finished structural reductions in LTL mode , in 1 iterations and 31396 ms. Remains : 800/800 places, 1038/1038 transitions.
Built C files in :
/tmp/ltsmin5649967098145938162
[2025-06-08 13:00:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5649967098145938162
Running compilation step : cd /tmp/ltsmin5649967098145938162;'/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 1650 ms.
Running link step : cd /tmp/ltsmin5649967098145938162;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5649967098145938162;'/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/stateBased17310638242573430968.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 13:00:19] [INFO ] Flatten gal took : 24 ms
[2025-06-08 13:00:19] [INFO ] Flatten gal took : 23 ms
[2025-06-08 13:00:19] [INFO ] Time to serialize gal into /tmp/LTL2967493931575226769.gal : 6 ms
[2025-06-08 13:00:19] [INFO ] Time to serialize properties into /tmp/LTL2253306596539282932.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/LTL2967493931575226769.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5971973450079249219.hoa' '-atoms' '/tmp/LTL2253306596539282932.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/LTL2253306596539282932.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5971973450079249219.hoa
Detected timeout of ITS tools.
[2025-06-08 13:00:34] [INFO ] Flatten gal took : 21 ms
[2025-06-08 13:00:34] [INFO ] Flatten gal took : 22 ms
[2025-06-08 13:00:34] [INFO ] Time to serialize gal into /tmp/LTL14248652934539183957.gal : 5 ms
[2025-06-08 13:00:34] [INFO ] Time to serialize properties into /tmp/LTL4374993851109869037.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/LTL14248652934539183957.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4374993851109869037.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(("(p827==1)")||(G("(((p116==0)||(p417==0))||((p741==0)||(p1042==0)))"))))||(X("(p325==1)"))))
Formula 0 simplified : G(!"(p827==1)" & F!"(((p116==0)||(p417==0))||((p741==0)||(p1042==0)))") & X!"(p325==1)"
Detected timeout of ITS tools.
[2025-06-08 13:00:49] [INFO ] Flatten gal took : 24 ms
[2025-06-08 13:00:49] [INFO ] Applying decomposition
[2025-06-08 13:00:49] [INFO ] Flatten gal took : 22 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/graph10244883872964202273.txt' '-o' '/tmp/graph10244883872964202273.bin' '-w' '/tmp/graph10244883872964202273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10244883872964202273.bin' '-l' '-1' '-v' '-w' '/tmp/graph10244883872964202273.weights' '-q' '0' '-e' '0.001'
[2025-06-08 13:00:49] [INFO ] Decomposing Gal with order
[2025-06-08 13:00:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 13:00:49] [INFO ] Removed a total of 862 redundant transitions.
[2025-06-08 13:00:49] [INFO ] Flatten gal took : 47 ms
[2025-06-08 13:00:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 12 ms.
[2025-06-08 13:00:49] [INFO ] Time to serialize gal into /tmp/LTL11703816051092305444.gal : 9 ms
[2025-06-08 13:00:49] [INFO ] Time to serialize properties into /tmp/LTL7235690537995501078.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/LTL11703816051092305444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7235690537995501078.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(("(i24.u214.p827==1)")||(G("(((i10.u16.p116==0)||(i10.u98.p417==0))||((i10.u187.p741==0)||(i10.u294.p1042==0)))"))))||(X("(i12.i...177
Formula 0 simplified : G(!"(i24.u214.p827==1)" & F!"(((i10.u16.p116==0)||(i10.u98.p417==0))||((i10.u187.p741==0)||(i10.u294.p1042==0)))") & X!"(i12.i0.i1.u...167
Reverse transition relation is NOT exact ! Due to transitions t81, t171, t262, t364, t421, t455, t552, t608, t642, t747, t748, t804, t824, t825, t828, t831...640
Computing Next relation with stutter on 89262 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B02-LTLFireability-11 finished in 245075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p1) U p2))))'
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 872 transition count 1115
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 872 transition count 1115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 872 transition count 1114
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 862 transition count 1104
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 862 transition count 1104
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 854 transition count 1096
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 854 transition count 1096
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 846 transition count 1088
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 846 transition count 1088
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 84 place count 839 transition count 1081
Iterating global reduction 1 with 7 rules applied. Total rules applied 91 place count 839 transition count 1081
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 98 place count 832 transition count 1074
Iterating global reduction 1 with 7 rules applied. Total rules applied 105 place count 832 transition count 1074
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 832 transition count 1073
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 827 transition count 1068
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 827 transition count 1068
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 822 transition count 1063
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 822 transition count 1063
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 131 place count 817 transition count 1058
Iterating global reduction 2 with 5 rules applied. Total rules applied 136 place count 817 transition count 1058
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 140 place count 813 transition count 1054
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 813 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 145 place count 813 transition count 1053
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 810 transition count 1050
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 810 transition count 1050
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 154 place count 807 transition count 1047
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 807 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 807 transition count 1046
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 160 place count 805 transition count 1044
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 805 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 164 place count 803 transition count 1042
Iterating global reduction 4 with 2 rules applied. Total rules applied 166 place count 803 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 801 transition count 1040
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 799 transition count 1038
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 176 place count 797 transition count 1036
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 180 place count 795 transition count 1034
Iterating global reduction 4 with 2 rules applied. Total rules applied 182 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 184 place count 793 transition count 1032
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 188 place count 791 transition count 1030
Iterating global reduction 4 with 2 rules applied. Total rules applied 190 place count 791 transition count 1030
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 192 place count 789 transition count 1028
Iterating global reduction 4 with 2 rules applied. Total rules applied 194 place count 789 transition count 1028
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 196 place count 789 transition count 1026
Applied a total of 196 rules in 435 ms. Remains 789 /884 variables (removed 95) and now considering 1026/1127 (removed 101) transitions.
// Phase 1: matrix 1026 rows 789 cols
[2025-06-08 13:01:05] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:01:05] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-06-08 13:01:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:01:06] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
Running 1025 sub problems to find dead transitions.
[2025-06-08 13:01:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1025 unsolved
SMT process timed out in 30213ms, After SMT, problems are : Problem set: 0 solved, 1025 unsolved
Search for dead transitions found 0 dead transitions in 30215ms
Starting structural reductions in LTL mode, iteration 1 : 789/884 places, 1026/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31772 ms. Remains : 789/884 places, 1026/1127 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Computed a total of 165 stabilizing places and 173 stable transitions
Computed a total of 165 stabilizing places and 173 stable transitions
Detected a total of 165/789 stabilizing places and 173/1026 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 20 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyB-PT-B02-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B02-LTLFireability-12 finished in 32425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&((p1 U p2)||G(p0)||(!p2 U (p3||G(!p2)))))))'
Support contains 4 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 871 transition count 1114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 871 transition count 1114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 871 transition count 1113
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 38 place count 860 transition count 1102
Iterating global reduction 1 with 11 rules applied. Total rules applied 49 place count 860 transition count 1102
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 852 transition count 1094
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 852 transition count 1094
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 844 transition count 1086
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 844 transition count 1086
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 88 place count 837 transition count 1079
Iterating global reduction 1 with 7 rules applied. Total rules applied 95 place count 837 transition count 1079
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 102 place count 830 transition count 1072
Iterating global reduction 1 with 7 rules applied. Total rules applied 109 place count 830 transition count 1072
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 830 transition count 1071
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 825 transition count 1066
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 825 transition count 1066
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 125 place count 820 transition count 1061
Iterating global reduction 2 with 5 rules applied. Total rules applied 130 place count 820 transition count 1061
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 815 transition count 1056
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 815 transition count 1056
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 811 transition count 1052
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 811 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 811 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 808 transition count 1048
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 808 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 805 transition count 1045
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 805 transition count 1045
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 805 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 164 place count 803 transition count 1042
Iterating global reduction 4 with 2 rules applied. Total rules applied 166 place count 803 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 168 place count 801 transition count 1040
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 799 transition count 1038
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 176 place count 797 transition count 1036
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 180 place count 795 transition count 1034
Iterating global reduction 4 with 2 rules applied. Total rules applied 182 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 184 place count 793 transition count 1032
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 188 place count 791 transition count 1030
Iterating global reduction 4 with 2 rules applied. Total rules applied 190 place count 791 transition count 1030
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 192 place count 789 transition count 1028
Iterating global reduction 4 with 2 rules applied. Total rules applied 194 place count 789 transition count 1028
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 196 place count 787 transition count 1026
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 787 transition count 1026
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 200 place count 787 transition count 1024
Applied a total of 200 rules in 420 ms. Remains 787 /884 variables (removed 97) and now considering 1024/1127 (removed 103) transitions.
// Phase 1: matrix 1024 rows 787 cols
[2025-06-08 13:01:37] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:01:38] [INFO ] Implicit Places using invariants in 371 ms returned []
[2025-06-08 13:01:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:01:38] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
Running 1023 sub problems to find dead transitions.
[2025-06-08 13:01:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/786 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
SMT process timed out in 30206ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 30209ms
Starting structural reductions in LTL mode, iteration 1 : 787/884 places, 1024/1127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31713 ms. Remains : 787/884 places, 1024/1127 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p3)), false, (AND p2 (NOT p3) (NOT p0)), false, true, (NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-13 finished in 32069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 884/884 places, 1127/1127 transitions.
Graph (trivial) has 878 edges and 884 vertex of which 68 / 884 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 618 transitions
Trivial Post-agglo rules discarded 618 transitions
Performed 618 trivial Post agglomeration. Transition count delta: 618
Iterating post reduction 0 with 618 rules applied. Total rules applied 619 place count 827 transition count 444
Reduce places removed 618 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 631 rules applied. Total rules applied 1250 place count 209 transition count 431
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1256 place count 204 transition count 430
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1256 place count 204 transition count 385
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1346 place count 159 transition count 385
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1353 place count 152 transition count 378
Iterating global reduction 3 with 7 rules applied. Total rules applied 1360 place count 152 transition count 378
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1364 place count 148 transition count 374
Iterating global reduction 3 with 4 rules applied. Total rules applied 1368 place count 148 transition count 374
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1371 place count 145 transition count 371
Iterating global reduction 3 with 3 rules applied. Total rules applied 1374 place count 145 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1375 place count 145 transition count 370
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1377 place count 143 transition count 368
Iterating global reduction 4 with 2 rules applied. Total rules applied 1379 place count 143 transition count 368
Performed 32 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 1443 place count 111 transition count 335
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1467 place count 87 transition count 185
Iterating global reduction 4 with 24 rules applied. Total rules applied 1491 place count 87 transition count 185
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1503 place count 87 transition count 173
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1515 place count 75 transition count 157
Iterating global reduction 5 with 12 rules applied. Total rules applied 1527 place count 75 transition count 157
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1539 place count 63 transition count 141
Iterating global reduction 5 with 12 rules applied. Total rules applied 1551 place count 63 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1557 place count 63 transition count 135
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1573 place count 55 transition count 142
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1574 place count 54 transition count 134
Iterating global reduction 6 with 1 rules applied. Total rules applied 1575 place count 54 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1576 place count 54 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1580 place count 54 transition count 129
Applied a total of 1580 rules in 25 ms. Remains 54 /884 variables (removed 830) and now considering 129/1127 (removed 998) transitions.
[2025-06-08 13:02:09] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
// Phase 1: matrix 124 rows 54 cols
[2025-06-08 13:02:09] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:02:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-08 13:02:09] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2025-06-08 13:02:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:02:09] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-08 13:02:09] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 13:02:09] [INFO ] Redundant transitions in 1 ms returned []
Running 112 sub problems to find dead transitions.
[2025-06-08 13:02:09] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2025-06-08 13:02:09] [INFO ] Invariant cache hit.
[2025-06-08 13:02:09] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:10] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:10] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:10] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:10] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:10] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:10] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:10] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:10] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:10] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 123/177 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 1/178 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:14] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:14] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/178 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 82 constraints, problems are : Problem set: 0 solved, 112 unsolved in 7223 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 123/177 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 112/193 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:18] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:23] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:02:24] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/178 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 197 constraints, problems are : Problem set: 0 solved, 112 unsolved in 14397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21643ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 21643ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/884 places, 129/1127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21793 ms. Remains : 54/884 places, 129/1127 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-14
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-14 finished in 21872 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((!p1||G(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' '!((F((p0||G(p1)))||X(p2)))'
[2025-06-08 13:02:31] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2624380530606155996
[2025-06-08 13:02:31] [INFO ] Applying decomposition
[2025-06-08 13:02:31] [INFO ] Computing symmetric may disable matrix : 1127 transitions.
[2025-06-08 13:02:31] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 13:02:31] [INFO ] Flatten gal took : 22 ms
[2025-06-08 13:02:31] [INFO ] Computing symmetric may enable matrix : 1127 transitions.
[2025-06-08 13:02:31] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph6387574626503025946.txt' '-o' '/tmp/graph6387574626503025946.bin' '-w' '/tmp/graph6387574626503025946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6387574626503025946.bin' '-l' '-1' '-v' '-w' '/tmp/graph6387574626503025946.weights' '-q' '0' '-e' '0.001'
[2025-06-08 13:02:31] [INFO ] Decomposing Gal with order
[2025-06-08 13:02:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 13:02:31] [INFO ] Removed a total of 876 redundant transitions.
[2025-06-08 13:02:31] [INFO ] Flatten gal took : 57 ms
[2025-06-08 13:02:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 51 ms.
[2025-06-08 13:02:31] [INFO ] Time to serialize gal into /tmp/LTLFireability15316317647599913959.gal : 33 ms
[2025-06-08 13:02:31] [INFO ] Time to serialize properties into /tmp/LTLFireability10127763674457932900.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/LTLFireability15316317647599913959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10127763674457932900.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
[2025-06-08 13:02:32] [INFO ] Computing Do-Not-Accords matrix : 1127 transitions.
Checking formula 0 : !(((G(("(i1.u24.p65!=1)")||(X("(i26.u247.p788!=1)"))))U(X(("(i26.u247.p788==1)")||(G("(i5.i1.i4.u74.p243==1)"))))))
Formula 0 simplified : F(!"(i1.u24.p65!=1)" & X!"(i26.u247.p788!=1)") R X(!"(i26.u247.p788==1)" & F!"(i5.i1.i4.u74.p243==1)")
[2025-06-08 13:02:32] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 13:02:32] [INFO ] Built C files in 468ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2624380530606155996
Running compilation step : cd /tmp/ltsmin2624380530606155996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 3639 ms.
Running link step : cd /tmp/ltsmin2624380530606155996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin2624380530606155996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)||X((LTLAPp1==true)))) U X((!(LTLAPp1==true)||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t8, t17, t26, t36, t92, t116, t171, t262, t307, t364, t455, t552, t608, t642, t748, t824, t82...677
Computing Next relation with stutter on 112054 deadlock states
167 unique states visited
167 strongly connected components in search stack
168 transitions explored
167 items max in DFS search stack
17668 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,176.791,3578440,1,0,5.17115e+06,1423,5210,2.7783e+07,137,8461,113163
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyB-PT-B02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F(("(i25.u240.p827==1)")||(G("(((i2.u2.p116==0)||(i2.u97.p417==0))||((i2.u188.p741==0)||(i2.u276.p1042==0)))"))))||(X("(i10.u96.p3...166
Formula 1 simplified : G(!"(i25.u240.p827==1)" & F!"(((i2.u2.p116==0)||(i2.u97.p417==0))||((i2.u188.p741==0)||(i2.u276.p1042==0)))") & X!"(i10.u96.p325==1)...156
Computing Next relation with stutter on 112054 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2624380530606155996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)||X((LTLAPp1==true)))) U X((!(LTLAPp1==true)||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2624380530606155996;'/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' '(<>(((LTLAPp3==true)||[]((LTLAPp4==true))))||X((LTLAPp5==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-08 13:27:11] [INFO ] Applying decomposition
[2025-06-08 13:27:11] [INFO ] Flatten gal took : 61 ms
[2025-06-08 13:27:11] [INFO ] Decomposing Gal with order
[2025-06-08 13:27:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 13:27:11] [INFO ] Removed a total of 750 redundant transitions.
[2025-06-08 13:27:11] [INFO ] Flatten gal took : 162 ms
[2025-06-08 13:27:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 9 ms.
[2025-06-08 13:27:11] [INFO ] Time to serialize gal into /tmp/LTLFireability12144166217664741487.gal : 11 ms
[2025-06-08 13:27:11] [INFO ] Time to serialize properties into /tmp/LTLFireability14323966266127111118.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/LTLFireability12144166217664741487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14323966266127111118.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((F(("(i0.i0.u6.p827==1)")||(G("(((i0.i0.i0.u4.p116==0)||(i0.i0.i0.u5.p417==0))||((i0.i0.u6.p741==0)||(i0.u7.p1042==0)))"))))||(X("(...180
Formula 0 simplified : G(!"(i0.i0.u6.p827==1)" & F!"(((i0.i0.i0.u4.p116==0)||(i0.i0.i0.u5.p417==0))||((i0.i0.u6.p741==0)||(i0.u7.p1042==0)))") & X!"(i0.i0....170
Reverse transition relation is NOT exact ! Due to transitions t871, i0.u7.t36, i0.u7.t84, i0.u7.t92, i0.u7.t107, i0.u7.t116, i0.u7.t169, i0.u7.t170, i0.u7....839
Computing Next relation with stutter on 112054 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2624380530606155996;'/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' '(<>(((LTLAPp3==true)||[]((LTLAPp4==true))))||X((LTLAPp5==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin2624380530606155996;'/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' '(<>(((LTLAPp3==true)||[]((LTLAPp4==true))))||X((LTLAPp5==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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