About the Execution of ITS-Tools for PolyORBLF-PT-S06J04T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 610888.00 | 0.00 | 0.00 | FTF?????F?T????? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446800316.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S06J04T04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446800316
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.8M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716919702507
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 18:08:23] [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]
[2024-05-28 18:08:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:08:24] [INFO ] Load time of PNML (sax parser for PT used): 455 ms
[2024-05-28 18:08:24] [INFO ] Transformed 454 places.
[2024-05-28 18:08:24] [INFO ] Transformed 6994 transitions.
[2024-05-28 18:08:24] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 629 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 169 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 452 transition count 1612
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 452 transition count 1612
Applied a total of 4 rules in 98 ms. Remains 452 /454 variables (removed 2) and now considering 1612/1614 (removed 2) transitions.
Running 1606 sub problems to find dead transitions.
[2024-05-28 18:08:24] [INFO ] Flow matrix only has 1588 transitions (discarded 24 similar events)
// Phase 1: matrix 1588 rows 452 cols
[2024-05-28 18:08:25] [INFO ] Computed 50 invariants in 103 ms
[2024-05-28 18:08:25] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
[2024-05-28 18:08:51] [INFO ] Deduced a trap composed of 82 places in 190 ms of which 29 ms to minimize.
[2024-05-28 18:08:52] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-05-28 18:08:59] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/2040 variables, and 36 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 20087 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 20/32 constraints, State Equation: 0/452 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
[2024-05-28 18:09:05] [INFO ] Deduced a trap composed of 183 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/2040 variables, and 37 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 20/32 constraints, State Equation: 0/452 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 4/4 constraints]
After SMT, in 55179ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 55225ms
[2024-05-28 18:09:20] [INFO ] Flow matrix only has 1588 transitions (discarded 24 similar events)
[2024-05-28 18:09:20] [INFO ] Invariant cache hit.
[2024-05-28 18:09:20] [INFO ] Implicit Places using invariants in 336 ms returned [42, 288, 351, 412]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 349 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 448/454 places, 1612/1614 transitions.
Applied a total of 0 rules in 18 ms. Remains 448 /448 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55746 ms. Remains : 448/454 places, 1612/1614 transitions.
Support contains 169 out of 448 places after structural reductions.
[2024-05-28 18:09:20] [INFO ] Flatten gal took : 225 ms
[2024-05-28 18:09:21] [INFO ] Flatten gal took : 125 ms
[2024-05-28 18:09:21] [INFO ] Input system was already deterministic with 1612 transitions.
RANDOM walk for 26769 steps (147 resets) in 1560 ms. (17 steps per ms) remains 0/23 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(!p1))))'
Support contains 30 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1612/1612 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 442 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 438 transition count 1608
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 438 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 436 transition count 1606
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 436 transition count 1606
Applied a total of 18 rules in 54 ms. Remains 436 /448 variables (removed 12) and now considering 1606/1612 (removed 6) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 18:09:22] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 436 cols
[2024-05-28 18:09:22] [INFO ] Computed 40 invariants in 106 ms
[2024-05-28 18:09:22] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:09:48] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 4 ms to minimize.
[2024-05-28 18:09:49] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 2.0)
(s10 0.0)
(s11 0.0)
(s12 4.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 2.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 4.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 4.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 4.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 2.0)
(s147 0.0)
(s148 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 4.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 2.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 2.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 9.0)
(s184 0.0)
(s185 0.0)
(s186 3.0)
(s187 0.0)
(s188 0.0)
(s189 4.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 3.0)
(s231 2.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 10.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 4.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 4.0)
(s304 0.0)
(s305 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 4.0)
(s324 1.0)
(s325 10.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 1.0)
(s347 3.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 3.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 31 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:10:01] [INFO ] Deduced a trap composed of 31 places in 392 ms of which 3 ms to minimize.
[2024-05-28 18:10:01] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-05-28 18:10:01] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2024-05-28 18:10:01] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 0 ms to minimize.
[2024-05-28 18:10:04] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-05-28 18:10:04] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:10:15] [INFO ] Deduced a trap composed of 178 places in 127 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 38 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 9/9 constraints]
After SMT, in 55816ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 55837ms
[2024-05-28 18:10:18] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 18:10:18] [INFO ] Invariant cache hit.
[2024-05-28 18:10:18] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-28 18:10:18] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 18:10:18] [INFO ] Invariant cache hit.
[2024-05-28 18:10:19] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:10:29] [INFO ] Implicit Places using invariants and state equation in 10624 ms returned []
Implicit Place search using SMT with State Equation took 11089 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-05-28 18:10:29] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 18:10:29] [INFO ] Invariant cache hit.
[2024-05-28 18:10:29] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:10:55] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-05-28 18:10:56] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-28 18:10:56] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:11:12] [INFO ] Deduced a trap composed of 178 places in 195 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 33 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1604 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/433 variables, 3/36 constraints. Problems are: Problem set: 324 solved, 1276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/36 constraints. Problems are: Problem set: 324 solved, 1276 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1605 is UNSAT
At refinement iteration 6 (OVERLAPS) 3/436 variables, 8/44 constraints. Problems are: Problem set: 612 solved, 988 unsolved
[2024-05-28 18:11:43] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:11:43] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 0 ms to minimize.
[2024-05-28 18:11:43] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 1 ms to minimize.
[2024-05-28 18:11:44] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:11:44] [INFO ] Deduced a trap composed of 217 places in 287 ms of which 3 ms to minimize.
[2024-05-28 18:11:44] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 2 ms to minimize.
[2024-05-28 18:11:45] [INFO ] Deduced a trap composed of 198 places in 277 ms of which 2 ms to minimize.
SMT process timed out in 76233ms, After SMT, problems are : Problem set: 612 solved, 988 unsolved
Search for dead transitions found 612 dead transitions in 76250ms
Found 612 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 612 transitions
Dead transitions reduction (with SMT) removed 612 transitions
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 994/1612 transitions.
Applied a total of 0 rules in 17 ms. Remains 436 /436 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143258 ms. Remains : 436/448 places, 994/1612 transitions.
Stuttering acceptance computed with spot in 425 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T04-LTLFireability-00
Product exploration explored 100000 steps with 40100 reset in 644 ms.
Product exploration explored 100000 steps with 40154 reset in 581 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 131 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 638 steps (7 resets) in 26 ms. (23 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 994/994 transitions.
Applied a total of 0 rules in 11 ms. Remains 436 /436 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Running 988 sub problems to find dead transitions.
[2024-05-28 18:11:48] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
// Phase 1: matrix 970 rows 436 cols
[2024-05-28 18:11:48] [INFO ] Computed 40 invariants in 23 ms
[2024-05-28 18:11:48] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 988 unsolved
[2024-05-28 18:11:55] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-28 18:11:56] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 2 ms to minimize.
[2024-05-28 18:12:01] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 988 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1406 variables, and 32 constraints, problems are : Problem set: 0 solved, 988 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 988/988 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 988 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 988 unsolved
[2024-05-28 18:12:11] [INFO ] Deduced a trap composed of 84 places in 255 ms of which 3 ms to minimize.
[2024-05-28 18:12:12] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 2 ms to minimize.
[2024-05-28 18:12:12] [INFO ] Deduced a trap composed of 107 places in 216 ms of which 3 ms to minimize.
[2024-05-28 18:12:12] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:12:12] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-28 18:12:17] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-28 18:12:17] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 8 ms to minimize.
[2024-05-28 18:12:17] [INFO ] Deduced a trap composed of 95 places in 206 ms of which 3 ms to minimize.
[2024-05-28 18:12:17] [INFO ] Deduced a trap composed of 103 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 988 unsolved
[2024-05-28 18:12:23] [INFO ] Deduced a trap composed of 103 places in 371 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 988 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1406 variables, and 42 constraints, problems are : Problem set: 0 solved, 988 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/988 constraints, Known Traps: 13/13 constraints]
After SMT, in 42093ms problems are : Problem set: 0 solved, 988 unsolved
Search for dead transitions found 0 dead transitions in 42109ms
[2024-05-28 18:12:30] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2024-05-28 18:12:30] [INFO ] Invariant cache hit.
[2024-05-28 18:12:30] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-28 18:12:30] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2024-05-28 18:12:30] [INFO ] Invariant cache hit.
[2024-05-28 18:12:31] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:12:44] [INFO ] Implicit Places using invariants and state equation in 13868 ms returned []
Implicit Place search using SMT with State Equation took 14324 ms to find 0 implicit places.
Running 988 sub problems to find dead transitions.
[2024-05-28 18:12:44] [INFO ] Flow matrix only has 970 transitions (discarded 24 similar events)
[2024-05-28 18:12:44] [INFO ] Invariant cache hit.
[2024-05-28 18:12:44] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 988 unsolved
[2024-05-28 18:12:52] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 4 ms to minimize.
[2024-05-28 18:12:52] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:12:54] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 4 (OVERLAPS) 3/433 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 988 unsolved
[2024-05-28 18:13:14] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:13:14] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 11 ms to minimize.
[2024-05-28 18:13:15] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 9 ms to minimize.
[2024-05-28 18:13:15] [INFO ] Deduced a trap composed of 178 places in 275 ms of which 7 ms to minimize.
[2024-05-28 18:13:15] [INFO ] Deduced a trap composed of 210 places in 234 ms of which 3 ms to minimize.
[2024-05-28 18:13:15] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:13:16] [INFO ] Deduced a trap composed of 167 places in 188 ms of which 2 ms to minimize.
[2024-05-28 18:13:16] [INFO ] Deduced a trap composed of 197 places in 213 ms of which 2 ms to minimize.
[2024-05-28 18:13:16] [INFO ] Deduced a trap composed of 102 places in 215 ms of which 2 ms to minimize.
SMT process timed out in 32130ms, After SMT, problems are : Problem set: 0 solved, 988 unsolved
Search for dead transitions found 0 dead transitions in 32160ms
Finished structural reductions in LTL mode , in 1 iterations and 88614 ms. Remains : 436/436 places, 994/994 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 434 steps (1 resets) in 7 ms. (54 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 191 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 39931 reset in 489 ms.
Product exploration explored 100000 steps with 40094 reset in 495 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 163 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 994/994 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 436 transition count 994
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 26 place count 436 transition count 1042
Deduced a syphon composed of 56 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 56 place count 436 transition count 1042
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 428 transition count 1034
Deduced a syphon composed of 48 places in 3 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 428 transition count 1034
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 2 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 120 place count 428 transition count 1034
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 136 place count 412 transition count 1018
Deduced a syphon composed of 84 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 152 place count 412 transition count 1018
Deduced a syphon composed of 84 places in 2 ms
Applied a total of 152 rules in 240 ms. Remains 412 /436 variables (removed 24) and now considering 1018/994 (removed -24) transitions.
Running 1012 sub problems to find dead transitions.
[2024-05-28 18:13:19] [INFO ] Flow matrix only has 994 transitions (discarded 24 similar events)
// Phase 1: matrix 994 rows 412 cols
[2024-05-28 18:13:19] [INFO ] Computed 40 invariants in 18 ms
[2024-05-28 18:13:19] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
[2024-05-28 18:13:26] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 5 ms to minimize.
[2024-05-28 18:13:26] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2024-05-28 18:13:32] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
SMT process timed out in 22084ms, After SMT, problems are : Problem set: 0 solved, 1012 unsolved
Search for dead transitions found 0 dead transitions in 22095ms
[2024-05-28 18:13:41] [INFO ] Redundant transitions in 52 ms returned []
Running 1012 sub problems to find dead transitions.
[2024-05-28 18:13:41] [INFO ] Flow matrix only has 994 transitions (discarded 24 similar events)
[2024-05-28 18:13:41] [INFO ] Invariant cache hit.
[2024-05-28 18:13:41] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
[2024-05-28 18:13:48] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:13:49] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2024-05-28 18:13:54] [INFO ] Deduced a trap composed of 90 places in 170 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 4 (OVERLAPS) 3/409 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
[2024-05-28 18:14:06] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
[2024-05-28 18:14:07] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 12 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-28 18:14:07] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD1005 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/1406 variables, and 38 constraints, problems are : Problem set: 48 solved, 964 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 15/23 constraints, State Equation: 0/412 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1012/1012 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 48 solved, 964 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 14/14 constraints. Problems are: Problem set: 48 solved, 964 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 14/28 constraints. Problems are: Problem set: 48 solved, 964 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 3/31 constraints. Problems are: Problem set: 48 solved, 964 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/31 constraints. Problems are: Problem set: 48 solved, 964 unsolved
At refinement iteration 4 (OVERLAPS) 27/409 variables, 3/34 constraints. Problems are: Problem set: 48 solved, 964 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 1/35 constraints. Problems are: Problem set: 48 solved, 964 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 3/38 constraints. Problems are: Problem set: 48 solved, 964 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/38 constraints. Problems are: Problem set: 48 solved, 964 unsolved
At refinement iteration 8 (OVERLAPS) 3/412 variables, 8/46 constraints. Problems are: Problem set: 48 solved, 964 unsolved
[2024-05-28 18:14:30] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-05-28 18:14:30] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-05-28 18:14:30] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:14:30] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
[2024-05-28 18:14:30] [INFO ] Deduced a trap composed of 136 places in 206 ms of which 2 ms to minimize.
[2024-05-28 18:14:30] [INFO ] Deduced a trap composed of 147 places in 209 ms of which 16 ms to minimize.
[2024-05-28 18:14:31] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 3 ms to minimize.
[2024-05-28 18:14:31] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 2 ms to minimize.
[2024-05-28 18:14:31] [INFO ] Deduced a trap composed of 140 places in 192 ms of which 2 ms to minimize.
[2024-05-28 18:14:31] [INFO ] Deduced a trap composed of 169 places in 188 ms of which 3 ms to minimize.
[2024-05-28 18:14:32] [INFO ] Deduced a trap composed of 146 places in 186 ms of which 2 ms to minimize.
[2024-05-28 18:14:32] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 2 ms to minimize.
[2024-05-28 18:14:32] [INFO ] Deduced a trap composed of 169 places in 200 ms of which 3 ms to minimize.
[2024-05-28 18:14:32] [INFO ] Deduced a trap composed of 152 places in 225 ms of which 3 ms to minimize.
[2024-05-28 18:14:32] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 3 ms to minimize.
[2024-05-28 18:14:33] [INFO ] Deduced a trap composed of 110 places in 199 ms of which 3 ms to minimize.
[2024-05-28 18:14:33] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 3 ms to minimize.
[2024-05-28 18:14:33] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
[2024-05-28 18:14:34] [INFO ] Deduced a trap composed of 148 places in 251 ms of which 3 ms to minimize.
[2024-05-28 18:14:35] [INFO ] Deduced a trap composed of 177 places in 288 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1015 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 20/66 constraints. Problems are: Problem set: 124 solved, 888 unsolved
[2024-05-28 18:14:41] [INFO ] Deduced a trap composed of 180 places in 243 ms of which 3 ms to minimize.
[2024-05-28 18:14:42] [INFO ] Deduced a trap composed of 191 places in 233 ms of which 2 ms to minimize.
[2024-05-28 18:14:42] [INFO ] Deduced a trap composed of 184 places in 245 ms of which 2 ms to minimize.
[2024-05-28 18:14:42] [INFO ] Deduced a trap composed of 191 places in 231 ms of which 3 ms to minimize.
[2024-05-28 18:14:42] [INFO ] Deduced a trap composed of 184 places in 248 ms of which 3 ms to minimize.
[2024-05-28 18:14:43] [INFO ] Deduced a trap composed of 191 places in 231 ms of which 3 ms to minimize.
[2024-05-28 18:14:43] [INFO ] Deduced a trap composed of 184 places in 231 ms of which 2 ms to minimize.
[2024-05-28 18:14:43] [INFO ] Deduced a trap composed of 183 places in 246 ms of which 2 ms to minimize.
SMT process timed out in 62039ms, After SMT, problems are : Problem set: 124 solved, 888 unsolved
Search for dead transitions found 124 dead transitions in 62049ms
Found 124 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 124 transitions
Dead transitions reduction (with SMT) removed 124 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 412/436 places, 894/994 transitions.
Graph (complete) has 2212 edges and 412 vertex of which 336 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.4 ms
Discarding 76 places :
Also discarding 0 output transitions
Deduced a syphon composed of 8 places in 1 ms
Applied a total of 1 rules in 61 ms. Remains 336 /412 variables (removed 76) and now considering 894/894 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 336/436 places, 894/994 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84515 ms. Remains : 336/436 places, 894/994 transitions.
Built C files in :
/tmp/ltsmin10478806110834126800
[2024-05-28 18:14:43] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10478806110834126800
Running compilation step : cd /tmp/ltsmin10478806110834126800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2376 ms.
Running link step : cd /tmp/ltsmin10478806110834126800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin10478806110834126800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12525317779687263362.hoa' '--buchi-type=spotba'
LTSmin run took 9561 ms.
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S06J04T04-LTLFireability-00 finished in 333633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(!p0))))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1612/1612 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 442 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 438 transition count 1608
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 438 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 436 transition count 1606
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 436 transition count 1606
Applied a total of 18 rules in 36 ms. Remains 436 /448 variables (removed 12) and now considering 1606/1612 (removed 6) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 18:14:55] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 436 cols
[2024-05-28 18:14:55] [INFO ] Computed 40 invariants in 39 ms
[2024-05-28 18:14:56] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:15:22] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:15:23] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 31 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:15:37] [INFO ] Deduced a trap composed of 31 places in 309 ms of which 2 ms to minimize.
[2024-05-28 18:15:37] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-28 18:15:37] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 1 ms to minimize.
[2024-05-28 18:15:37] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:15:39] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-28 18:15:40] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:15:51] [INFO ] Deduced a trap composed of 178 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 38 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 9/9 constraints]
After SMT, in 57566ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 57584ms
[2024-05-28 18:15:53] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 18:15:53] [INFO ] Invariant cache hit.
[2024-05-28 18:15:53] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-28 18:15:53] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 18:15:53] [INFO ] Invariant cache hit.
[2024-05-28 18:15:54] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:16:01] [INFO ] Implicit Places using invariants and state equation in 7173 ms returned []
Implicit Place search using SMT with State Equation took 7639 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-05-28 18:16:01] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 18:16:01] [INFO ] Invariant cache hit.
[2024-05-28 18:16:01] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:16:27] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-05-28 18:16:27] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-28 18:16:27] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:16:42] [INFO ] Deduced a trap composed of 178 places in 120 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 2.0)
(s10 0.0)
(s11 0.0)
(s12 4.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 2.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 4.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 33 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1604 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/433 variables, 3/36 constraints. Problems are: Problem set: 324 solved, 1276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/36 constraints. Problems are: Problem set: 324 solved, 1276 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1605 is UNSAT
At refinement iteration 6 (OVERLAPS) 3/436 variables, 8/44 constraints. Problems are: Problem set: 612 solved, 988 unsolved
[2024-05-28 18:17:14] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:17:14] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-05-28 18:17:15] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2024-05-28 18:17:15] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2024-05-28 18:17:15] [INFO ] Deduced a trap composed of 217 places in 292 ms of which 2 ms to minimize.
[2024-05-28 18:17:15] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 1 ms to minimize.
[2024-05-28 18:17:16] [INFO ] Deduced a trap composed of 198 places in 265 ms of which 2 ms to minimize.
[2024-05-28 18:17:16] [INFO ] Deduced a trap composed of 175 places in 301 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/2018 variables, and 52 constraints, problems are : Problem set: 612 solved, 988 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 12/12 constraints]
After SMT, in 76549ms problems are : Problem set: 612 solved, 988 unsolved
Search for dead transitions found 612 dead transitions in 76563ms
Found 612 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 612 transitions
Dead transitions reduction (with SMT) removed 612 transitions
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 994/1612 transitions.
Applied a total of 0 rules in 6 ms. Remains 436 /436 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141849 ms. Remains : 436/448 places, 994/1612 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), p0, false, false]
Running random walk in product with property : PolyORBLF-PT-S06J04T04-LTLFireability-02
Entered a terminal (fully accepting) state of product in 22 steps with 1 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T04-LTLFireability-02 finished in 142052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 10 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1612/1612 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 442 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 438 transition count 1608
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 438 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 436 transition count 1606
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 436 transition count 1606
Applied a total of 18 rules in 32 ms. Remains 436 /448 variables (removed 12) and now considering 1606/1612 (removed 6) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 18:17:17] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 18:17:17] [INFO ] Invariant cache hit.
[2024-05-28 18:17:17] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:17:46] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-05-28 18:17:47] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-28 18:17:47] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 32 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 18:18:02] [INFO ] Deduced a trap composed of 27 places in 424 ms of which 4 ms to minimize.
[2024-05-28 18:18:02] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 1 ms to minimize.
[2024-05-28 18:18:02] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 35 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 6/6 constraints]
After SMT, in 58398ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 58419ms
[2024-05-28 18:18:16] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 18:18:16] [INFO ] Invariant cache hit.
[2024-05-28 18:18:16] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-28 18:18:16] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 18:18:16] [INFO ] Invariant cache hit.
[2024-05-28 18:18:17] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:18:27] [INFO ] Implicit Places using invariants and state equation in 10929 ms returned []
Implicit Place search using SMT with State Equation took 11309 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-05-28 18:18:27] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 18:18:27] [INFO ] Invariant cache hit.
[2024-05-28 18:18:27] [INFO ] State equation strengthened by 112 read => feed constraints.
BK_STOP 1716920313395
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="PolyORBLF-PT-S06J04T04"
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-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S06J04T04, 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 r290-tajo-171654446800316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '
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 ;