Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447000388.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 ltsminxred
Input is PolyORBNT-COL-S05J60, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447000388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K 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 PolyORBNT-COL-S05J60-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717257917127

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:05:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:05:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:05:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:05:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:05:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 820 ms
[2024-06-01 16:05:19] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 16:05:19] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-06-01 16:05:19] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 40003 steps (3199 resets) in 1032 ms. (38 steps per ms) remains 6/17 properties
BEST_FIRST walk for 4355 steps (98 resets) in 38 ms. (111 steps per ms) remains 0/6 properties
[2024-06-01 16:05:20] [INFO ] Flatten gal took : 42 ms
[2024-06-01 16:05:20] [INFO ] Flatten gal took : 15 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:05:20] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 109 ms.
[2024-06-01 16:05:20] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 636 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1315
Applied a total of 5 rules in 78 ms. Remains 904 /909 variables (removed 5) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2024-06-01 16:05:20] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 904 cols
[2024-06-01 16:05:20] [INFO ] Computed 137 invariants in 120 ms
[2024-06-01 16:05:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.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 1.0)
(s52 (/ 1.0 3.0))
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.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 (/ 2.0 3.0))
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 (/ 2.0 3.0))
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.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 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.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)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 (/ 2.0 3.0))
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 4.0)
(s385 4.0)
(s386 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/903 variables, 5/136 constraints. Problems are: Problem set: 78 solved, 1231 unsolved
(s495 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 1)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 4)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s389 9)
(s390 1)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2215 variables, and 136 constraints, problems are : Problem set: 78 solved, 1231 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 43894ms problems are : Problem set: 78 solved, 1231 unsolved
Search for dead transitions found 78 dead transitions in 43985ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
[2024-06-01 16:06:04] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
// Phase 1: matrix 1233 rows 904 cols
[2024-06-01 16:06:04] [INFO ] Computed 137 invariants in 77 ms
[2024-06-01 16:06:05] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-06-01 16:06:05] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
[2024-06-01 16:06:05] [INFO ] Invariant cache hit.
[2024-06-01 16:06:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:06:13] [INFO ] Implicit Places using invariants and state equation in 8229 ms returned []
Implicit Place search using SMT with State Equation took 8958 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 904/909 places, 1237/1315 transitions.
Applied a total of 0 rules in 25 ms. Remains 904 /904 variables (removed 0) and now considering 1237/1237 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53096 ms. Remains : 904/909 places, 1237/1315 transitions.
Support contains 636 out of 904 places after structural reductions.
[2024-06-01 16:06:14] [INFO ] Flatten gal took : 254 ms
[2024-06-01 16:06:14] [INFO ] Flatten gal took : 234 ms
[2024-06-01 16:06:14] [INFO ] Input system was already deterministic with 1237 transitions.
Reduction of identical properties reduced properties to check from 21 to 17
RANDOM walk for 40000 steps (2773 resets) in 3007 ms. (13 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40004 steps (451 resets) in 417 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (562 resets) in 290 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 444 steps (0 resets) in 5 ms. (74 steps per ms) remains 0/3 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)))'
Support contains 63 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1171
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1105
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1103
Applied a total of 268 rules in 399 ms. Remains 770 /904 variables (removed 134) and now considering 1103/1237 (removed 134) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:06:17] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-06-01 16:06:17] [INFO ] Computed 137 invariants in 28 ms
[2024-06-01 16:06:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:06:30] [INFO ] Deduced a trap composed of 239 places in 319 ms of which 31 ms to minimize.
[2024-06-01 16:06:30] [INFO ] Deduced a trap composed of 233 places in 334 ms of which 9 ms to minimize.
[2024-06-01 16:06:30] [INFO ] Deduced a trap composed of 227 places in 273 ms of which 26 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 236 places in 516 ms of which 6 ms to minimize.
[2024-06-01 16:06:32] [INFO ] Deduced a trap composed of 196 places in 696 ms of which 39 ms to minimize.
[2024-06-01 16:06:32] [INFO ] Deduced a trap composed of 196 places in 578 ms of which 3 ms to minimize.
[2024-06-01 16:06:33] [INFO ] Deduced a trap composed of 196 places in 461 ms of which 19 ms to minimize.
[2024-06-01 16:06:33] [INFO ] Deduced a trap composed of 196 places in 393 ms of which 4 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 3 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:06:35] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:06:35] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:06:35] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:06:35] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:06:35] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:06:36] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:06:36] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:06:36] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:06:37] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:06:37] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:06:37] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:06:38] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:06:38] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:06:38] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:06:38] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:06:39] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:06:39] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:06:39] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:06:39] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 4 ms to minimize.
SMT process timed out in 22762ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22785ms
[2024-06-01 16:06:39] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:06:39] [INFO ] Invariant cache hit.
[2024-06-01 16:06:40] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-06-01 16:06:40] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:06:40] [INFO ] Invariant cache hit.
[2024-06-01 16:06:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:06:46] [INFO ] Implicit Places using invariants and state equation in 5763 ms returned []
Implicit Place search using SMT with State Equation took 6461 ms to find 0 implicit places.
[2024-06-01 16:06:46] [INFO ] Redundant transitions in 65 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:06:46] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:06:46] [INFO ] Invariant cache hit.
[2024-06-01 16:06:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 245 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:07:00] [INFO ] Deduced a trap composed of 233 places in 443 ms of which 4 ms to minimize.
[2024-06-01 16:07:00] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 7 ms to minimize.
[2024-06-01 16:07:00] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:07:01] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:07:01] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:07:01] [INFO ] Deduced a trap composed of 245 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:07:02] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:07:02] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:07:02] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:07:02] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:07:03] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:07:03] [INFO ] Deduced a trap composed of 254 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:07:03] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:07:03] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 242 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 242 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:07:05] [INFO ] Deduced a trap composed of 254 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:07:05] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:07:06] [INFO ] Deduced a trap composed of 248 places in 291 ms of which 5 ms to minimize.
[2024-06-01 16:07:06] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:07:06] [INFO ] Deduced a trap composed of 251 places in 243 ms of which 7 ms to minimize.
[2024-06-01 16:07:07] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:07:07] [INFO ] Deduced a trap composed of 233 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:07:07] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:07:08] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:07:08] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:07:08] [INFO ] Deduced a trap composed of 260 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:07:09] [INFO ] Deduced a trap composed of 236 places in 327 ms of which 4 ms to minimize.
[2024-06-01 16:07:09] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:07:09] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:07:09] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:07:10] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:07:10] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:07:10] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:07:11] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:07:11] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.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 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.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 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:07:24] [INFO ] Deduced a trap composed of 200 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:07:24] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:07:24] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:07:25] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 5 ms to minimize.
[2024-06-01 16:07:25] [INFO ] Deduced a trap composed of 200 places in 275 ms of which 5 ms to minimize.
[2024-06-01 16:07:25] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:07:25] [INFO ] Deduced a trap composed of 200 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:07:26] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 4 ms to minimize.
[2024-06-01 16:07:26] [INFO ] Deduced a trap composed of 200 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:07:26] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:07:27] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:07:27] [INFO ] Deduced a trap composed of 200 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:07:28] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:07:28] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 4 ms to minimize.
[2024-06-01 16:07:28] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 6 ms to minimize.
[2024-06-01 16:07:29] [INFO ] Deduced a trap composed of 196 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:07:29] [INFO ] Deduced a trap composed of 200 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:07:29] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:07:29] [INFO ] Deduced a trap composed of 200 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:07:30] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:07:32] [INFO ] Deduced a trap composed of 249 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:07:33] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:07:33] [INFO ] Deduced a trap composed of 237 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:07:33] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:07:34] [INFO ] Deduced a trap composed of 248 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:07:34] [INFO ] Deduced a trap composed of 255 places in 308 ms of which 4 ms to minimize.
[2024-06-01 16:07:34] [INFO ] Deduced a trap composed of 237 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:07:34] [INFO ] Deduced a trap composed of 248 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:07:35] [INFO ] Deduced a trap composed of 242 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:07:35] [INFO ] Deduced a trap composed of 236 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:07:35] [INFO ] Deduced a trap composed of 254 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:07:36] [INFO ] Deduced a trap composed of 245 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:07:36] [INFO ] Deduced a trap composed of 196 places in 370 ms of which 5 ms to minimize.
[2024-06-01 16:07:37] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:07:37] [INFO ] Deduced a trap composed of 216 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:07:37] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 5 ms to minimize.
[2024-06-01 16:07:38] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:07:38] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:07:38] [INFO ] Deduced a trap composed of 261 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:07:39] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 63022ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63039ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/904 places, 1103/1237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92768 ms. Remains : 770/904 places, 1103/1237 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-00
Product exploration explored 100000 steps with 5556 reset in 916 ms.
Product exploration explored 100000 steps with 5601 reset in 929 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 383 steps (21 resets) in 8 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 63 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 66 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:07:52] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:07:52] [INFO ] Invariant cache hit.
[2024-06-01 16:07:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:08:04] [INFO ] Deduced a trap composed of 245 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:08:05] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:08:05] [INFO ] Deduced a trap composed of 233 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:08:05] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:08:05] [INFO ] Deduced a trap composed of 230 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:08:06] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:08:06] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:08:06] [INFO ] Deduced a trap composed of 245 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:08:06] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:08:07] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:08:07] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:08:07] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:08:08] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:08:08] [INFO ] Deduced a trap composed of 254 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:08:08] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:08:08] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:08:09] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:08:09] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:08:09] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:08:09] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:08:10] [INFO ] Deduced a trap composed of 254 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:08:10] [INFO ] Deduced a trap composed of 245 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:08:10] [INFO ] Deduced a trap composed of 248 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:08:11] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:08:11] [INFO ] Deduced a trap composed of 251 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:08:11] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:08:12] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:08:12] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:08:12] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:08:13] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:08:13] [INFO ] Deduced a trap composed of 260 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:08:13] [INFO ] Deduced a trap composed of 236 places in 231 ms of which 5 ms to minimize.
[2024-06-01 16:08:13] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:08:14] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:08:14] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:08:14] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:08:14] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:08:15] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 3 ms to minimize.
SMT process timed out in 22766ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22785ms
[2024-06-01 16:08:15] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:08:15] [INFO ] Invariant cache hit.
[2024-06-01 16:08:15] [INFO ] Implicit Places using invariants in 675 ms returned []
[2024-06-01 16:08:15] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:08:15] [INFO ] Invariant cache hit.
[2024-06-01 16:08:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:08:21] [INFO ] Implicit Places using invariants and state equation in 5530 ms returned []
Implicit Place search using SMT with State Equation took 6233 ms to find 0 implicit places.
[2024-06-01 16:08:21] [INFO ] Redundant transitions in 11 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:08:21] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:08:21] [INFO ] Invariant cache hit.
[2024-06-01 16:08:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:08:33] [INFO ] Deduced a trap composed of 245 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:08:34] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:08:34] [INFO ] Deduced a trap composed of 233 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:08:34] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:08:34] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:08:35] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:08:35] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:08:35] [INFO ] Deduced a trap composed of 245 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:08:36] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:08:36] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:08:36] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:08:36] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:08:37] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:08:37] [INFO ] Deduced a trap composed of 254 places in 325 ms of which 3 ms to minimize.
[2024-06-01 16:08:37] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:08:37] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:08:38] [INFO ] Deduced a trap composed of 242 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:08:38] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:08:38] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:08:38] [INFO ] Deduced a trap composed of 242 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:08:39] [INFO ] Deduced a trap composed of 254 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:08:39] [INFO ] Deduced a trap composed of 245 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:08:40] [INFO ] Deduced a trap composed of 248 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:08:40] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:08:40] [INFO ] Deduced a trap composed of 251 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:08:41] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:08:41] [INFO ] Deduced a trap composed of 233 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:08:41] [INFO ] Deduced a trap composed of 236 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:08:41] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:08:42] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:08:42] [INFO ] Deduced a trap composed of 260 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:08:42] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:08:42] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:08:43] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:08:43] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:08:43] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:08:43] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:08:44] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:08:44] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:08:44] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:08:58] [INFO ] Deduced a trap composed of 200 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:08:58] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:08:58] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 200 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 200 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 200 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 200 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 200 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 200 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:09:06] [INFO ] Deduced a trap composed of 249 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:09:06] [INFO ] Deduced a trap composed of 248 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 237 places in 234 ms of which 5 ms to minimize.
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 248 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:09:08] [INFO ] Deduced a trap composed of 255 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:09:08] [INFO ] Deduced a trap composed of 237 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:09:08] [INFO ] Deduced a trap composed of 248 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:09:08] [INFO ] Deduced a trap composed of 242 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:09:09] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:09:09] [INFO ] Deduced a trap composed of 254 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:09:09] [INFO ] Deduced a trap composed of 245 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 216 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:09:12] [INFO ] Deduced a trap composed of 261 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:09:12] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:09:23] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 213 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 81/81 constraints]
After SMT, in 62819ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62829ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 91955 ms. Remains : 770/770 places, 1103/1103 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 267 steps (12 resets) in 7 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5607 reset in 797 ms.
Product exploration explored 100000 steps with 5620 reset in 774 ms.
Support contains 63 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 35 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:09:26] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:09:26] [INFO ] Invariant cache hit.
[2024-06-01 16:09:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:09:40] [INFO ] Deduced a trap composed of 245 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:09:40] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:09:40] [INFO ] Deduced a trap composed of 233 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:09:41] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:09:41] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:09:41] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:09:41] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:09:42] [INFO ] Deduced a trap composed of 245 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:09:42] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 6 ms to minimize.
[2024-06-01 16:09:42] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:09:43] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:09:43] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:09:43] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:09:44] [INFO ] Deduced a trap composed of 254 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:09:44] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:09:44] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:09:44] [INFO ] Deduced a trap composed of 242 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:09:45] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 6 ms to minimize.
[2024-06-01 16:09:45] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:09:45] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:09:46] [INFO ] Deduced a trap composed of 254 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:09:46] [INFO ] Deduced a trap composed of 245 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:09:46] [INFO ] Deduced a trap composed of 248 places in 236 ms of which 4 ms to minimize.
[2024-06-01 16:09:47] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:09:47] [INFO ] Deduced a trap composed of 251 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:09:47] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 6 ms to minimize.
[2024-06-01 16:09:48] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:09:48] [INFO ] Deduced a trap composed of 236 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:09:48] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:09:48] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 3 ms to minimize.
SMT process timed out in 22618ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22629ms
[2024-06-01 16:09:48] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:09:48] [INFO ] Invariant cache hit.
[2024-06-01 16:09:49] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-06-01 16:09:49] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:09:49] [INFO ] Invariant cache hit.
[2024-06-01 16:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:09:54] [INFO ] Implicit Places using invariants and state equation in 5383 ms returned []
Implicit Place search using SMT with State Equation took 6062 ms to find 0 implicit places.
[2024-06-01 16:09:54] [INFO ] Redundant transitions in 11 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:09:54] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:09:54] [INFO ] Invariant cache hit.
[2024-06-01 16:09:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:10:07] [INFO ] Deduced a trap composed of 245 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:10:07] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 5 ms to minimize.
[2024-06-01 16:10:08] [INFO ] Deduced a trap composed of 233 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:10:08] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-06-01 16:10:08] [INFO ] Deduced a trap composed of 230 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:10:09] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 6 ms to minimize.
[2024-06-01 16:10:09] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 5 ms to minimize.
[2024-06-01 16:10:09] [INFO ] Deduced a trap composed of 245 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:10:10] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 6 ms to minimize.
[2024-06-01 16:10:10] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:10:10] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:10:11] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 6 ms to minimize.
[2024-06-01 16:10:11] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:10:11] [INFO ] Deduced a trap composed of 254 places in 283 ms of which 5 ms to minimize.
[2024-06-01 16:10:12] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 6 ms to minimize.
[2024-06-01 16:10:12] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 5 ms to minimize.
[2024-06-01 16:10:12] [INFO ] Deduced a trap composed of 242 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:10:13] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-06-01 16:10:13] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:10:14] [INFO ] Deduced a trap composed of 242 places in 297 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:10:14] [INFO ] Deduced a trap composed of 254 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:10:15] [INFO ] Deduced a trap composed of 245 places in 314 ms of which 5 ms to minimize.
[2024-06-01 16:10:15] [INFO ] Deduced a trap composed of 248 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:10:16] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:10:16] [INFO ] Deduced a trap composed of 251 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:10:16] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 5 ms to minimize.
[2024-06-01 16:10:17] [INFO ] Deduced a trap composed of 233 places in 300 ms of which 5 ms to minimize.
[2024-06-01 16:10:17] [INFO ] Deduced a trap composed of 236 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:10:17] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-06-01 16:10:17] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:10:18] [INFO ] Deduced a trap composed of 260 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:10:18] [INFO ] Deduced a trap composed of 236 places in 349 ms of which 4 ms to minimize.
[2024-06-01 16:10:18] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:10:19] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:10:19] [INFO ] Deduced a trap composed of 196 places in 341 ms of which 5 ms to minimize.
[2024-06-01 16:10:20] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:10:20] [INFO ] Deduced a trap composed of 196 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:10:20] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:10:20] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:10:21] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:10:32] [INFO ] Deduced a trap composed of 200 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:10:32] [INFO ] Deduced a trap composed of 196 places in 356 ms of which 5 ms to minimize.
[2024-06-01 16:10:33] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 5 ms to minimize.
[2024-06-01 16:10:33] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:10:33] [INFO ] Deduced a trap composed of 200 places in 359 ms of which 5 ms to minimize.
[2024-06-01 16:10:34] [INFO ] Deduced a trap composed of 196 places in 352 ms of which 6 ms to minimize.
[2024-06-01 16:10:34] [INFO ] Deduced a trap composed of 200 places in 368 ms of which 5 ms to minimize.
[2024-06-01 16:10:34] [INFO ] Deduced a trap composed of 196 places in 371 ms of which 10 ms to minimize.
[2024-06-01 16:10:35] [INFO ] Deduced a trap composed of 200 places in 321 ms of which 5 ms to minimize.
[2024-06-01 16:10:35] [INFO ] Deduced a trap composed of 196 places in 366 ms of which 5 ms to minimize.
[2024-06-01 16:10:36] [INFO ] Deduced a trap composed of 196 places in 376 ms of which 6 ms to minimize.
[2024-06-01 16:10:36] [INFO ] Deduced a trap composed of 200 places in 381 ms of which 5 ms to minimize.
[2024-06-01 16:10:36] [INFO ] Deduced a trap composed of 196 places in 357 ms of which 5 ms to minimize.
[2024-06-01 16:10:37] [INFO ] Deduced a trap composed of 196 places in 359 ms of which 6 ms to minimize.
[2024-06-01 16:10:37] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 5 ms to minimize.
[2024-06-01 16:10:37] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 6 ms to minimize.
[2024-06-01 16:10:38] [INFO ] Deduced a trap composed of 200 places in 344 ms of which 5 ms to minimize.
[2024-06-01 16:10:38] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:10:39] [INFO ] Deduced a trap composed of 200 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:10:39] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:10:42] [INFO ] Deduced a trap composed of 249 places in 363 ms of which 5 ms to minimize.
[2024-06-01 16:10:42] [INFO ] Deduced a trap composed of 248 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:10:42] [INFO ] Deduced a trap composed of 237 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:10:43] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:10:43] [INFO ] Deduced a trap composed of 248 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:10:43] [INFO ] Deduced a trap composed of 255 places in 300 ms of which 3 ms to minimize.
[2024-06-01 16:10:44] [INFO ] Deduced a trap composed of 237 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:10:44] [INFO ] Deduced a trap composed of 248 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:10:44] [INFO ] Deduced a trap composed of 242 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:10:44] [INFO ] Deduced a trap composed of 236 places in 271 ms of which 5 ms to minimize.
[2024-06-01 16:10:45] [INFO ] Deduced a trap composed of 254 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:10:45] [INFO ] Deduced a trap composed of 245 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:10:46] [INFO ] Deduced a trap composed of 196 places in 369 ms of which 5 ms to minimize.
[2024-06-01 16:10:46] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:10:46] [INFO ] Deduced a trap composed of 216 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:10:47] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:10:47] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:10:47] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:10:48] [INFO ] Deduced a trap composed of 261 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:10:48] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62675ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62688ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 91443 ms. Remains : 770/770 places, 1103/1103 transitions.
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-00 finished in 281103 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((p0||(G(p1) U p2))))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 30 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:10:57] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-06-01 16:10:57] [INFO ] Computed 137 invariants in 34 ms
[2024-06-01 16:10:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 42754ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42765ms
[2024-06-01 16:11:40] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:11:40] [INFO ] Invariant cache hit.
[2024-06-01 16:11:41] [INFO ] Implicit Places using invariants in 924 ms returned []
[2024-06-01 16:11:41] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:11:41] [INFO ] Invariant cache hit.
[2024-06-01 16:11:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:11:49] [INFO ] Implicit Places using invariants and state equation in 8058 ms returned []
Implicit Place search using SMT with State Equation took 8997 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:11:49] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:11:49] [INFO ] Invariant cache hit.
[2024-06-01 16:11:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-06-01 16:12:44] [INFO ] Deduced a trap composed of 304 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:12:44] [INFO ] Deduced a trap composed of 12 places in 332 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62526ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62539ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114337 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-01 finished in 114566 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&&F((G(!p1)||G(p0)))))))'
Support contains 1 out of 904 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 28 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:12:52] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:12:52] [INFO ] Invariant cache hit.
[2024-06-01 16:12:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.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 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.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 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 (/ 2.0 3.0))
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 (/ 2.0 3.0))
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 (/ 2.0 3.0))
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 (/ 1.0 4.0))
(s384 4.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 (/ 2.0 3.0))
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 (/ 2.0 3.0))
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 (/ 2.0 3.0))
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 3.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 (/ 1.0 3.0))
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 (/ 1.0 3.0))
(s744 1.0)
(s745 (/ 1.0 3.0))
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s770 0.0)
(s771 0.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42052ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42071ms
[2024-06-01 16:13:34] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:13:34] [INFO ] Invariant cache hit.
[2024-06-01 16:13:35] [INFO ] Implicit Places using invariants in 1127 ms returned []
[2024-06-01 16:13:35] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:13:35] [INFO ] Invariant cache hit.
[2024-06-01 16:13:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:13:40] [INFO ] Implicit Places using invariants and state equation in 4845 ms returned []
Implicit Place search using SMT with State Equation took 5978 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:13:40] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:13:40] [INFO ] Invariant cache hit.
[2024-06-01 16:13:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 304 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 12 places in 306 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62413ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62439ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110525 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-03
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-03 finished in 110609 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((p0&&(X((F(p3)||p2))||p1))))'
Support contains 67 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Applied a total of 0 rules in 14 ms. Remains 904 /904 variables (removed 0) and now considering 1237/1237 (removed 0) transitions.
Running 1231 sub problems to find dead transitions.
[2024-06-01 16:14:42] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
// Phase 1: matrix 1233 rows 904 cols
[2024-06-01 16:14:42] [INFO ] Computed 137 invariants in 15 ms
[2024-06-01 16:14:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2137 variables, and 131 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1231/1231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
[2024-06-01 16:15:11] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2137 variables, and 132 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1231 constraints, Known Traps: 1/1 constraints]
After SMT, in 42084ms problems are : Problem set: 0 solved, 1231 unsolved
Search for dead transitions found 0 dead transitions in 42095ms
[2024-06-01 16:15:25] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
[2024-06-01 16:15:25] [INFO ] Invariant cache hit.
[2024-06-01 16:15:25] [INFO ] Implicit Places using invariants in 737 ms returned []
[2024-06-01 16:15:25] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
[2024-06-01 16:15:25] [INFO ] Invariant cache hit.
[2024-06-01 16:15:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:15:32] [INFO ] Implicit Places using invariants and state equation in 6444 ms returned []
Implicit Place search using SMT with State Equation took 7202 ms to find 0 implicit places.
Running 1231 sub problems to find dead transitions.
[2024-06-01 16:15:32] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
[2024-06-01 16:15:32] [INFO ] Invariant cache hit.
[2024-06-01 16:15:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
((s0 3.0timeout
^^^^^^^^^^
(error "Invalid token: 3.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 3.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/903 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2137 variables, and 136 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1231/1231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 3 (OVERLAPS) 5/903 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
[2024-06-01 16:16:30] [INFO ] Deduced a trap composed of 137 places in 410 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2137 variables, and 137 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1231 constraints, Known Traps: 1/1 constraints]
After SMT, in 63105ms problems are : Problem set: 0 solved, 1231 unsolved
Search for dead transitions found 0 dead transitions in 63123ms
Finished structural reductions in LTL mode , in 1 iterations and 112440 ms. Remains : 904/904 places, 1237/1237 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-04 finished in 112744 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' '!((G((X(X(p1))||G(!p2)||p0)) U p1))'
Support contains 72 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 55 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:16:35] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-06-01 16:16:35] [INFO ] Computed 137 invariants in 44 ms
[2024-06-01 16:16:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43289ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43317ms
[2024-06-01 16:17:19] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:17:19] [INFO ] Invariant cache hit.
[2024-06-01 16:17:20] [INFO ] Implicit Places using invariants in 933 ms returned []
[2024-06-01 16:17:20] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:17:20] [INFO ] Invariant cache hit.
[2024-06-01 16:17:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:17:25] [INFO ] Implicit Places using invariants and state equation in 5580 ms returned []
Implicit Place search using SMT with State Equation took 6515 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:17:25] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:17:25] [INFO ] Invariant cache hit.
[2024-06-01 16:17:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.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 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.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 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 (/ 1.0 3.0))
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.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 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 (/ 1.0 3.0))
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.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)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-06-01 16:18:21] [INFO ] Deduced a trap composed of 304 places in 404 ms of which 7 ms to minimize.
[2024-06-01 16:18:21] [INFO ] Deduced a trap composed of 12 places in 486 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62218ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62238ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112139 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), (NOT p1), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), true, (AND p2 (NOT p1)), p2]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-05
Entered a terminal (fully accepting) state of product in 4067 steps with 278 reset in 55 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-05 finished in 112575 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' '!((F(G(p0))||G((F(p2)&&p1))))'
Support contains 369 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 904 transition count 1233
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 900 transition count 1232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 899 transition count 1232
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 10 place count 899 transition count 1169
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 136 place count 836 transition count 1169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 835 transition count 1168
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 835 transition count 1168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 833 transition count 1166
Applied a total of 142 rules in 112 ms. Remains 833 /904 variables (removed 71) and now considering 1166/1237 (removed 71) transitions.
Running 1160 sub problems to find dead transitions.
[2024-06-01 16:18:28] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
// Phase 1: matrix 1162 rows 833 cols
[2024-06-01 16:18:28] [INFO ] Computed 137 invariants in 35 ms
[2024-06-01 16:18:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 16:18:44] [INFO ] Deduced a trap composed of 260 places in 358 ms of which 5 ms to minimize.
[2024-06-01 16:18:44] [INFO ] Deduced a trap composed of 260 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:18:44] [INFO ] Deduced a trap composed of 260 places in 388 ms of which 6 ms to minimize.
[2024-06-01 16:18:45] [INFO ] Deduced a trap composed of 260 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:18:45] [INFO ] Deduced a trap composed of 260 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:18:45] [INFO ] Deduced a trap composed of 260 places in 330 ms of which 6 ms to minimize.
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 260 places in 333 ms of which 6 ms to minimize.
[2024-06-01 16:18:46] [INFO ] Deduced a trap composed of 260 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:18:47] [INFO ] Deduced a trap composed of 260 places in 346 ms of which 6 ms to minimize.
[2024-06-01 16:18:47] [INFO ] Deduced a trap composed of 260 places in 360 ms of which 5 ms to minimize.
[2024-06-01 16:18:47] [INFO ] Deduced a trap composed of 260 places in 328 ms of which 6 ms to minimize.
[2024-06-01 16:18:48] [INFO ] Deduced a trap composed of 260 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:18:48] [INFO ] Deduced a trap composed of 260 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:18:48] [INFO ] Deduced a trap composed of 260 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 260 places in 262 ms of which 7 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 260 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 260 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:18:50] [INFO ] Deduced a trap composed of 260 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:18:50] [INFO ] Deduced a trap composed of 260 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:18:50] [INFO ] Deduced a trap composed of 260 places in 352 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 16:18:51] [INFO ] Deduced a trap composed of 296 places in 285 ms of which 4 ms to minimize.
SMT process timed out in 23245ms, After SMT, problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 23262ms
[2024-06-01 16:18:51] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-06-01 16:18:51] [INFO ] Invariant cache hit.
[2024-06-01 16:18:52] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-06-01 16:18:52] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-06-01 16:18:52] [INFO ] Invariant cache hit.
[2024-06-01 16:18:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:18:56] [INFO ] Implicit Places using invariants and state equation in 4465 ms returned []
Implicit Place search using SMT with State Equation took 5238 ms to find 0 implicit places.
[2024-06-01 16:18:56] [INFO ] Redundant transitions in 8 ms returned []
Running 1160 sub problems to find dead transitions.
[2024-06-01 16:18:56] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-06-01 16:18:56] [INFO ] Invariant cache hit.
[2024-06-01 16:18:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 16:19:13] [INFO ] Deduced a trap composed of 260 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:19:14] [INFO ] Deduced a trap composed of 260 places in 333 ms of which 4 ms to minimize.
[2024-06-01 16:19:14] [INFO ] Deduced a trap composed of 260 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:19:14] [INFO ] Deduced a trap composed of 260 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:19:15] [INFO ] Deduced a trap composed of 260 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:19:15] [INFO ] Deduced a trap composed of 260 places in 338 ms of which 6 ms to minimize.
[2024-06-01 16:19:15] [INFO ] Deduced a trap composed of 260 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:19:16] [INFO ] Deduced a trap composed of 260 places in 337 ms of which 6 ms to minimize.
[2024-06-01 16:19:16] [INFO ] Deduced a trap composed of 260 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:19:16] [INFO ] Deduced a trap composed of 260 places in 358 ms of which 5 ms to minimize.
[2024-06-01 16:19:17] [INFO ] Deduced a trap composed of 260 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:19:17] [INFO ] Deduced a trap composed of 260 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:19:17] [INFO ] Deduced a trap composed of 260 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:19:18] [INFO ] Deduced a trap composed of 260 places in 380 ms of which 5 ms to minimize.
[2024-06-01 16:19:18] [INFO ] Deduced a trap composed of 260 places in 368 ms of which 5 ms to minimize.
[2024-06-01 16:19:18] [INFO ] Deduced a trap composed of 260 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:19:19] [INFO ] Deduced a trap composed of 260 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:19:19] [INFO ] Deduced a trap composed of 260 places in 369 ms of which 6 ms to minimize.
[2024-06-01 16:19:19] [INFO ] Deduced a trap composed of 260 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:19:20] [INFO ] Deduced a trap composed of 293 places in 239 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 16:19:20] [INFO ] Deduced a trap composed of 296 places in 345 ms of which 5 ms to minimize.
[2024-06-01 16:19:21] [INFO ] Deduced a trap composed of 296 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:19:21] [INFO ] Deduced a trap composed of 290 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:19:22] [INFO ] Deduced a trap composed of 311 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:19:22] [INFO ] Deduced a trap composed of 296 places in 345 ms of which 6 ms to minimize.
[2024-06-01 16:19:22] [INFO ] Deduced a trap composed of 296 places in 348 ms of which 5 ms to minimize.
[2024-06-01 16:19:23] [INFO ] Deduced a trap composed of 287 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:19:23] [INFO ] Deduced a trap composed of 293 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:19:23] [INFO ] Deduced a trap composed of 293 places in 333 ms of which 6 ms to minimize.
[2024-06-01 16:19:24] [INFO ] Deduced a trap composed of 260 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:19:24] [INFO ] Deduced a trap composed of 260 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:19:24] [INFO ] Deduced a trap composed of 260 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:19:25] [INFO ] Deduced a trap composed of 260 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:19:25] [INFO ] Deduced a trap composed of 260 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:19:25] [INFO ] Deduced a trap composed of 260 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:19:25] [INFO ] Deduced a trap composed of 260 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:19:26] [INFO ] Deduced a trap composed of 260 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:19:26] [INFO ] Deduced a trap composed of 260 places in 310 ms of which 4 ms to minimize.
[2024-06-01 16:19:26] [INFO ] Deduced a trap composed of 260 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:19:27] [INFO ] Deduced a trap composed of 260 places in 254 ms of which 4 ms to minimize.
(s98 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.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 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1995 variables, and 172 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 16:19:32] [INFO ] Deduced a trap composed of 283 places in 407 ms of which 6 ms to minimize.
[2024-06-01 16:19:32] [INFO ] Deduced a trap composed of 286 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 284 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 284 places in 333 ms of which 4 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 285 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:19:34] [INFO ] Deduced a trap composed of 282 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:19:34] [INFO ] Deduced a trap composed of 288 places in 381 ms of which 6 ms to minimize.
[2024-06-01 16:19:34] [INFO ] Deduced a trap composed of 289 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:19:35] [INFO ] Deduced a trap composed of 292 places in 395 ms of which 6 ms to minimize.
[2024-06-01 16:19:35] [INFO ] Deduced a trap composed of 290 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:19:36] [INFO ] Deduced a trap composed of 286 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:19:36] [INFO ] Deduced a trap composed of 283 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:19:36] [INFO ] Deduced a trap composed of 285 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:19:36] [INFO ] Deduced a trap composed of 286 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:19:37] [INFO ] Deduced a trap composed of 290 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:19:37] [INFO ] Deduced a trap composed of 286 places in 367 ms of which 6 ms to minimize.
[2024-06-01 16:19:37] [INFO ] Deduced a trap composed of 287 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:19:38] [INFO ] Deduced a trap composed of 288 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:19:38] [INFO ] Deduced a trap composed of 284 places in 245 ms of which 5 ms to minimize.
[2024-06-01 16:19:38] [INFO ] Deduced a trap composed of 291 places in 265 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/1995 variables, and 192 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 60/60 constraints]
After SMT, in 62671ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 62683ms
Starting structural reductions in SI_LTL mode, iteration 1 : 833/904 places, 1166/1237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91320 ms. Remains : 833/904 places, 1166/1237 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-06
Product exploration explored 100000 steps with 4487 reset in 3111 ms.
Product exploration explored 100000 steps with 4420 reset in 2829 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 p1) p0 (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 171 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 148 steps (3 resets) in 9 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 13 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 366 out of 833 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 833/833 places, 1166/1166 transitions.
Applied a total of 0 rules in 80 ms. Remains 833 /833 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
Running 1160 sub problems to find dead transitions.
[2024-06-01 16:20:06] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-06-01 16:20:06] [INFO ] Invariant cache hit.
[2024-06-01 16:20:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 16:20:21] [INFO ] Deduced a trap composed of 260 places in 271 ms of which 5 ms to minimize.
[2024-06-01 16:20:22] [INFO ] Deduced a trap composed of 260 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:20:22] [INFO ] Deduced a trap composed of 260 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:20:22] [INFO ] Deduced a trap composed of 260 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:20:22] [INFO ] Deduced a trap composed of 260 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:20:23] [INFO ] Deduced a trap composed of 260 places in 291 ms of which 7 ms to minimize.
[2024-06-01 16:20:23] [INFO ] Deduced a trap composed of 260 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:20:23] [INFO ] Deduced a trap composed of 260 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:20:24] [INFO ] Deduced a trap composed of 260 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:20:24] [INFO ] Deduced a trap composed of 260 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:20:24] [INFO ] Deduced a trap composed of 260 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:20:25] [INFO ] Deduced a trap composed of 260 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:20:25] [INFO ] Deduced a trap composed of 260 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:20:25] [INFO ] Deduced a trap composed of 260 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:20:25] [INFO ] Deduced a trap composed of 260 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:20:26] [INFO ] Deduced a trap composed of 260 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:20:26] [INFO ] Deduced a trap composed of 260 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:20:26] [INFO ] Deduced a trap composed of 260 places in 314 ms of which 5 ms to minimize.
[2024-06-01 16:20:27] [INFO ] Deduced a trap composed of 260 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:20:27] [INFO ] Deduced a trap composed of 293 places in 311 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 16:20:28] [INFO ] Deduced a trap composed of 296 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:20:28] [INFO ] Deduced a trap composed of 296 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:20:29] [INFO ] Deduced a trap composed of 290 places in 261 ms of which 4 ms to minimize.
SMT process timed out in 22711ms, After SMT, problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 22727ms
[2024-06-01 16:20:29] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-06-01 16:20:29] [INFO ] Invariant cache hit.
[2024-06-01 16:20:29] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-06-01 16:20:29] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-06-01 16:20:29] [INFO ] Invariant cache hit.
[2024-06-01 16:20:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:20:33] [INFO ] Implicit Places using invariants and state equation in 4261 ms returned []
Implicit Place search using SMT with State Equation took 4923 ms to find 0 implicit places.
[2024-06-01 16:20:33] [INFO ] Redundant transitions in 8 ms returned []
Running 1160 sub problems to find dead transitions.
[2024-06-01 16:20:33] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-06-01 16:20:33] [INFO ] Invariant cache hit.
[2024-06-01 16:20:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 16:20:47] [INFO ] Deduced a trap composed of 260 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:20:48] [INFO ] Deduced a trap composed of 260 places in 334 ms of which 6 ms to minimize.
[2024-06-01 16:20:48] [INFO ] Deduced a trap composed of 260 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:20:48] [INFO ] Deduced a trap composed of 260 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:20:49] [INFO ] Deduced a trap composed of 260 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:20:49] [INFO ] Deduced a trap composed of 260 places in 352 ms of which 6 ms to minimize.
[2024-06-01 16:20:49] [INFO ] Deduced a trap composed of 260 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:20:50] [INFO ] Deduced a trap composed of 260 places in 290 ms of which 7 ms to minimize.
[2024-06-01 16:20:50] [INFO ] Deduced a trap composed of 260 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:20:50] [INFO ] Deduced a trap composed of 260 places in 362 ms of which 5 ms to minimize.
[2024-06-01 16:20:51] [INFO ] Deduced a trap composed of 260 places in 339 ms of which 6 ms to minimize.
[2024-06-01 16:20:51] [INFO ] Deduced a trap composed of 260 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:20:51] [INFO ] Deduced a trap composed of 260 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:20:52] [INFO ] Deduced a trap composed of 260 places in 398 ms of which 6 ms to minimize.
[2024-06-01 16:20:52] [INFO ] Deduced a trap composed of 260 places in 370 ms of which 5 ms to minimize.
[2024-06-01 16:20:53] [INFO ] Deduced a trap composed of 260 places in 360 ms of which 6 ms to minimize.
[2024-06-01 16:20:53] [INFO ] Deduced a trap composed of 260 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:20:53] [INFO ] Deduced a trap composed of 260 places in 383 ms of which 5 ms to minimize.
[2024-06-01 16:20:54] [INFO ] Deduced a trap composed of 260 places in 392 ms of which 8 ms to minimize.
[2024-06-01 16:20:54] [INFO ] Deduced a trap composed of 293 places in 369 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 16:20:55] [INFO ] Deduced a trap composed of 296 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:20:56] [INFO ] Deduced a trap composed of 296 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:20:56] [INFO ] Deduced a trap composed of 290 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:20:56] [INFO ] Deduced a trap composed of 311 places in 320 ms of which 6 ms to minimize.
[2024-06-01 16:20:57] [INFO ] Deduced a trap composed of 296 places in 306 ms of which 6 ms to minimize.
[2024-06-01 16:20:57] [INFO ] Deduced a trap composed of 296 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:20:57] [INFO ] Deduced a trap composed of 287 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:20:58] [INFO ] Deduced a trap composed of 293 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:20:58] [INFO ] Deduced a trap composed of 293 places in 415 ms of which 6 ms to minimize.
[2024-06-01 16:20:59] [INFO ] Deduced a trap composed of 260 places in 383 ms of which 7 ms to minimize.
[2024-06-01 16:20:59] [INFO ] Deduced a trap composed of 260 places in 380 ms of which 5 ms to minimize.
[2024-06-01 16:21:00] [INFO ] Deduced a trap composed of 260 places in 358 ms of which 5 ms to minimize.
[2024-06-01 16:21:00] [INFO ] Deduced a trap composed of 260 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:21:01] [INFO ] Deduced a trap composed of 260 places in 352 ms of which 6 ms to minimize.
[2024-06-01 16:21:01] [INFO ] Deduced a trap composed of 260 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:21:01] [INFO ] Deduced a trap composed of 260 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:21:02] [INFO ] Deduced a trap composed of 260 places in 350 ms of which 5 ms to minimize.
[2024-06-01 16:21:02] [INFO ] Deduced a trap composed of 260 places in 328 ms of which 5 ms to minimize.
[2024-06-01 16:21:02] [INFO ] Deduced a trap composed of 260 places in 284 ms of which 5 ms to minimize.
[2024-06-01 16:21:03] [INFO ] Deduced a trap composed of 260 places in 270 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1995 variables, and 172 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 16:21:09] [INFO ] Deduced a trap composed of 283 places in 424 ms of which 6 ms to minimize.
[2024-06-01 16:21:09] [INFO ] Deduced a trap composed of 286 places in 371 ms of which 6 ms to minimize.
[2024-06-01 16:21:10] [INFO ] Deduced a trap composed of 284 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:21:10] [INFO ] Deduced a trap composed of 284 places in 370 ms of which 6 ms to minimize.
[2024-06-01 16:21:11] [INFO ] Deduced a trap composed of 285 places in 328 ms of which 6 ms to minimize.
[2024-06-01 16:21:11] [INFO ] Deduced a trap composed of 282 places in 353 ms of which 6 ms to minimize.
[2024-06-01 16:21:11] [INFO ] Deduced a trap composed of 288 places in 272 ms of which 5 ms to minimize.
[2024-06-01 16:21:12] [INFO ] Deduced a trap composed of 289 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:21:12] [INFO ] Deduced a trap composed of 292 places in 369 ms of which 6 ms to minimize.
[2024-06-01 16:21:12] [INFO ] Deduced a trap composed of 290 places in 344 ms of which 6 ms to minimize.
[2024-06-01 16:21:13] [INFO ] Deduced a trap composed of 286 places in 375 ms of which 6 ms to minimize.
[2024-06-01 16:21:13] [INFO ] Deduced a trap composed of 283 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:21:13] [INFO ] Deduced a trap composed of 285 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:21:14] [INFO ] Deduced a trap composed of 286 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:21:14] [INFO ] Deduced a trap composed of 290 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:21:14] [INFO ] Deduced a trap composed of 286 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:21:15] [INFO ] Deduced a trap composed of 287 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:21:15] [INFO ] Deduced a trap composed of 288 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:21:16] [INFO ] Deduced a trap composed of 284 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:21:16] [INFO ] Deduced a trap composed of 291 places in 278 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 timeout
0)
(s85 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/1995 variables, and 192 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 60/60 constraints]
After SMT, in 62687ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 62699ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 90455 ms. Remains : 833/833 places, 1166/1166 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 321 steps (13 resets) in 13 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4438 reset in 3166 ms.
Product exploration explored 100000 steps with 4501 reset in 2979 ms.
Support contains 366 out of 833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 833/833 places, 1166/1166 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 833 transition count 1164
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 831 transition count 1164
Applied a total of 4 rules in 82 ms. Remains 831 /833 variables (removed 2) and now considering 1164/1166 (removed 2) transitions.
Running 1158 sub problems to find dead transitions.
[2024-06-01 16:21:43] [INFO ] Flow matrix only has 1160 transitions (discarded 4 similar events)
// Phase 1: matrix 1160 rows 831 cols
[2024-06-01 16:21:43] [INFO ] Computed 137 invariants in 43 ms
[2024-06-01 16:21:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/826 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-06-01 16:22:00] [INFO ] Deduced a trap composed of 258 places in 352 ms of which 6 ms to minimize.
[2024-06-01 16:22:00] [INFO ] Deduced a trap composed of 258 places in 326 ms of which 6 ms to minimize.
[2024-06-01 16:22:00] [INFO ] Deduced a trap composed of 286 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:22:01] [INFO ] Deduced a trap composed of 258 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:22:01] [INFO ] Deduced a trap composed of 284 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:22:01] [INFO ] Deduced a trap composed of 258 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:22:02] [INFO ] Deduced a trap composed of 258 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:22:02] [INFO ] Deduced a trap composed of 258 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:22:02] [INFO ] Deduced a trap composed of 258 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:22:03] [INFO ] Deduced a trap composed of 258 places in 271 ms of which 5 ms to minimize.
[2024-06-01 16:22:03] [INFO ] Deduced a trap composed of 258 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:22:03] [INFO ] Deduced a trap composed of 258 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:22:04] [INFO ] Deduced a trap composed of 258 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:22:04] [INFO ] Deduced a trap composed of 258 places in 286 ms of which 5 ms to minimize.
[2024-06-01 16:22:04] [INFO ] Deduced a trap composed of 258 places in 282 ms of which 5 ms to minimize.
[2024-06-01 16:22:04] [INFO ] Deduced a trap composed of 258 places in 290 ms of which 5 ms to minimize.
[2024-06-01 16:22:05] [INFO ] Deduced a trap composed of 258 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:22:05] [INFO ] Deduced a trap composed of 258 places in 292 ms of which 5 ms to minimize.
[2024-06-01 16:22:05] [INFO ] Deduced a trap composed of 258 places in 278 ms of which 5 ms to minimize.
SMT process timed out in 22613ms, After SMT, problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 22644ms
[2024-06-01 16:22:05] [INFO ] Flow matrix only has 1160 transitions (discarded 4 similar events)
[2024-06-01 16:22:05] [INFO ] Invariant cache hit.
[2024-06-01 16:22:06] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-06-01 16:22:06] [INFO ] Flow matrix only has 1160 transitions (discarded 4 similar events)
[2024-06-01 16:22:06] [INFO ] Invariant cache hit.
[2024-06-01 16:22:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:22:09] [INFO ] Implicit Places using invariants and state equation in 3221 ms returned []
Implicit Place search using SMT with State Equation took 3861 ms to find 0 implicit places.
[2024-06-01 16:22:09] [INFO ] Redundant transitions in 13 ms returned []
Running 1158 sub problems to find dead transitions.
[2024-06-01 16:22:09] [INFO ] Flow matrix only has 1160 transitions (discarded 4 similar events)
[2024-06-01 16:22:09] [INFO ] Invariant cache hit.
[2024-06-01 16:22:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/826 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-06-01 16:22:26] [INFO ] Deduced a trap composed of 285 places in 383 ms of which 5 ms to minimize.
[2024-06-01 16:22:26] [INFO ] Deduced a trap composed of 288 places in 279 ms of which 5 ms to minimize.
[2024-06-01 16:22:26] [INFO ] Deduced a trap composed of 298 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:22:27] [INFO ] Deduced a trap composed of 301 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:22:27] [INFO ] Deduced a trap composed of 310 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:22:27] [INFO ] Deduced a trap composed of 289 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:22:28] [INFO ] Deduced a trap composed of 295 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:22:28] [INFO ] Deduced a trap composed of 258 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:22:29] [INFO ] Deduced a trap composed of 258 places in 373 ms of which 5 ms to minimize.
[2024-06-01 16:22:29] [INFO ] Deduced a trap composed of 258 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:22:29] [INFO ] Deduced a trap composed of 258 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:22:30] [INFO ] Deduced a trap composed of 258 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:22:30] [INFO ] Deduced a trap composed of 258 places in 269 ms of which 5 ms to minimize.
[2024-06-01 16:22:30] [INFO ] Deduced a trap composed of 258 places in 266 ms of which 5 ms to minimize.
[2024-06-01 16:22:31] [INFO ] Deduced a trap composed of 258 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:22:31] [INFO ] Deduced a trap composed of 258 places in 269 ms of which 5 ms to minimize.
[2024-06-01 16:22:31] [INFO ] Deduced a trap composed of 257 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:22:32] [INFO ] Deduced a trap composed of 301 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:22:32] [INFO ] Deduced a trap composed of 293 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:22:32] [INFO ] Deduced a trap composed of 258 places in 318 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-06-01 16:22:34] [INFO ] Deduced a trap composed of 307 places in 375 ms of which 6 ms to minimize.
[2024-06-01 16:22:34] [INFO ] Deduced a trap composed of 258 places in 352 ms of which 5 ms to minimize.
[2024-06-01 16:22:34] [INFO ] Deduced a trap composed of 258 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:22:35] [INFO ] Deduced a trap composed of 258 places in 350 ms of which 5 ms to minimize.
[2024-06-01 16:22:35] [INFO ] Deduced a trap composed of 258 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:22:36] [INFO ] Deduced a trap composed of 258 places in 384 ms of which 6 ms to minimize.
[2024-06-01 16:22:36] [INFO ] Deduced a trap composed of 298 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:22:36] [INFO ] Deduced a trap composed of 258 places in 337 ms of which 6 ms to minimize.
[2024-06-01 16:22:37] [INFO ] Deduced a trap composed of 258 places in 361 ms of which 5 ms to minimize.
[2024-06-01 16:22:37] [INFO ] Deduced a trap composed of 258 places in 325 ms of which 5 ms to minimize.
[2024-06-01 16:22:37] [INFO ] Deduced a trap composed of 258 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:22:38] [INFO ] Deduced a trap composed of 258 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:22:38] [INFO ] Deduced a trap composed of 258 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:22:39] [INFO ] Deduced a trap composed of 258 places in 329 ms of which 6 ms to minimize.
[2024-06-01 16:22:39] [INFO ] Deduced a trap composed of 258 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:22:39] [INFO ] Deduced a trap composed of 258 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:22:39] [INFO ] Deduced a trap composed of 258 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:22:40] [INFO ] Deduced a trap composed of 258 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:22:40] [INFO ] Deduced a trap composed of 258 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:22:40] [INFO ] Deduced a trap composed of 258 places in 273 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/826 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 826/1991 variables, and 172 constraints, problems are : Problem set: 0 solved, 1158 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/831 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1158/1158 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/826 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-06-01 16:22:46] [INFO ] Deduced a trap composed of 289 places in 389 ms of which 6 ms to minimize.
[2024-06-01 16:22:46] [INFO ] Deduced a trap composed of 258 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:22:46] [INFO ] Deduced a trap composed of 262 places in 401 ms of which 6 ms to minimize.
[2024-06-01 16:22:47] [INFO ] Deduced a trap composed of 258 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:22:47] [INFO ] Deduced a trap composed of 258 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:22:48] [INFO ] Deduced a trap composed of 262 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:22:48] [INFO ] Deduced a trap composed of 258 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:22:49] [INFO ] Deduced a trap composed of 262 places in 365 ms of which 6 ms to minimize.
[2024-06-01 16:22:49] [INFO ] Deduced a trap composed of 257 places in 348 ms of which 6 ms to minimize.
[2024-06-01 16:22:49] [INFO ] Deduced a trap composed of 258 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:22:50] [INFO ] Deduced a trap composed of 258 places in 376 ms of which 5 ms to minimize.
[2024-06-01 16:22:50] [INFO ] Deduced a trap composed of 258 places in 420 ms of which 6 ms to minimize.
[2024-06-01 16:22:51] [INFO ] Deduced a trap composed of 258 places in 377 ms of which 6 ms to minimize.
[2024-06-01 16:22:51] [INFO ] Deduced a trap composed of 262 places in 370 ms of which 6 ms to minimize.
[2024-06-01 16:22:52] [INFO ] Deduced a trap composed of 258 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:22:52] [INFO ] Deduced a trap composed of 307 places in 334 ms of which 6 ms to minimize.
[2024-06-01 16:22:52] [INFO ] Deduced a trap composed of 262 places in 371 ms of which 8 ms to minimize.
[2024-06-01 16:22:53] [INFO ] Deduced a trap composed of 258 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:22:53] [INFO ] Deduced a trap composed of 301 places in 369 ms of which 6 ms to minimize.
[2024-06-01 16:22:54] [INFO ] Deduced a trap composed of 308 places in 364 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/826 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/1991 variables, and 192 constraints, problems are : Problem set: 0 solved, 1158 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/831 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1158 constraints, Known Traps: 60/60 constraints]
After SMT, in 63068ms problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 63078ms
Starting structural reductions in SI_LTL mode, iteration 1 : 831/833 places, 1164/1166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89691 ms. Remains : 831/833 places, 1164/1166 transitions.
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-06 finished in 284684 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' '!(F((X(X(X(G(p0))))&&G(p1))))'
Support contains 126 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1171
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1105
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1103
Applied a total of 268 rules in 85 ms. Remains 770 /904 variables (removed 134) and now considering 1103/1237 (removed 134) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:23:13] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-06-01 16:23:13] [INFO ] Computed 137 invariants in 37 ms
[2024-06-01 16:23:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:23:27] [INFO ] Deduced a trap composed of 239 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:23:27] [INFO ] Deduced a trap composed of 233 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:23:28] [INFO ] Deduced a trap composed of 227 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:23:28] [INFO ] Deduced a trap composed of 236 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:23:29] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:23:29] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:23:29] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:23:29] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:23:30] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:23:30] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:23:30] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:23:31] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:23:31] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:23:31] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:23:31] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:23:32] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:23:32] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:23:32] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:23:32] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:23:33] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:23:34] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 4 ms to minimize.
[2024-06-01 16:23:34] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:23:34] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:23:35] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 3 ms to minimize.
[2024-06-01 16:23:35] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:23:35] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:23:36] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:23:36] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:23:36] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
SMT process timed out in 23574ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23586ms
[2024-06-01 16:23:36] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:23:36] [INFO ] Invariant cache hit.
[2024-06-01 16:23:37] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-06-01 16:23:37] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:23:37] [INFO ] Invariant cache hit.
[2024-06-01 16:23:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:23:43] [INFO ] Implicit Places using invariants and state equation in 6098 ms returned []
Implicit Place search using SMT with State Equation took 6788 ms to find 0 implicit places.
[2024-06-01 16:23:43] [INFO ] Redundant transitions in 21 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:23:43] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:23:43] [INFO ] Invariant cache hit.
[2024-06-01 16:23:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:23:57] [INFO ] Deduced a trap composed of 245 places in 304 ms of which 5 ms to minimize.
[2024-06-01 16:23:57] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:23:58] [INFO ] Deduced a trap composed of 233 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:23:58] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:23:59] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:23:59] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 8 ms to minimize.
[2024-06-01 16:23:59] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:24:00] [INFO ] Deduced a trap composed of 245 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:24:00] [INFO ] Deduced a trap composed of 196 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:24:00] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:24:01] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:24:01] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:24:01] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:24:02] [INFO ] Deduced a trap composed of 254 places in 277 ms of which 3 ms to minimize.
[2024-06-01 16:24:02] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:24:02] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:24:03] [INFO ] Deduced a trap composed of 242 places in 283 ms of which 5 ms to minimize.
[2024-06-01 16:24:03] [INFO ] Deduced a trap composed of 196 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:24:03] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:24:04] [INFO ] Deduced a trap composed of 242 places in 283 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:24:05] [INFO ] Deduced a trap composed of 254 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:24:05] [INFO ] Deduced a trap composed of 245 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:24:05] [INFO ] Deduced a trap composed of 248 places in 361 ms of which 5 ms to minimize.
[2024-06-01 16:24:06] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
[2024-06-01 16:24:06] [INFO ] Deduced a trap composed of 251 places in 314 ms of which 5 ms to minimize.
[2024-06-01 16:24:07] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 6 ms to minimize.
[2024-06-01 16:24:07] [INFO ] Deduced a trap composed of 233 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:24:07] [INFO ] Deduced a trap composed of 236 places in 307 ms of which 5 ms to minimize.
[2024-06-01 16:24:08] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:24:08] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:24:08] [INFO ] Deduced a trap composed of 260 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:24:09] [INFO ] Deduced a trap composed of 236 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:24:09] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:24:09] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:24:09] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 5 ms to minimize.
[2024-06-01 16:24:10] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 5 ms to minimize.
[2024-06-01 16:24:10] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 5 ms to minimize.
[2024-06-01 16:24:10] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:24:11] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:24:11] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:24:22] [INFO ] Deduced a trap composed of 200 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:24:22] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 5 ms to minimize.
[2024-06-01 16:24:22] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 5 ms to minimize.
[2024-06-01 16:24:23] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:24:23] [INFO ] Deduced a trap composed of 200 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:24:23] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:24:24] [INFO ] Deduced a trap composed of 200 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:24:24] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:24:24] [INFO ] Deduced a trap composed of 200 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:24:24] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:24:25] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:24:25] [INFO ] Deduced a trap composed of 200 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:24:25] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:24:25] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:24:26] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:24:26] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 3 ms to minimize.
[2024-06-01 16:24:26] [INFO ] Deduced a trap composed of 200 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:24:27] [INFO ] Deduced a trap composed of 196 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:24:27] [INFO ] Deduced a trap composed of 200 places in 346 ms of which 5 ms to minimize.
[2024-06-01 16:24:27] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:24:30] [INFO ] Deduced a trap composed of 249 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:24:30] [INFO ] Deduced a trap composed of 248 places in 306 ms of which 6 ms to minimize.
[2024-06-01 16:24:31] [INFO ] Deduced a trap composed of 237 places in 310 ms of which 7 ms to minimize.
[2024-06-01 16:24:31] [INFO ] Deduced a trap composed of 230 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:24:31] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 5 ms to minimize.
[2024-06-01 16:24:32] [INFO ] Deduced a trap composed of 255 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:24:32] [INFO ] Deduced a trap composed of 237 places in 269 ms of which 5 ms to minimize.
[2024-06-01 16:24:32] [INFO ] Deduced a trap composed of 248 places in 278 ms of which 5 ms to minimize.
[2024-06-01 16:24:33] [INFO ] Deduced a trap composed of 242 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:24:33] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 5 ms to minimize.
[2024-06-01 16:24:33] [INFO ] Deduced a trap composed of 254 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:24:34] [INFO ] Deduced a trap composed of 245 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:24:35] [INFO ] Deduced a trap composed of 196 places in 379 ms of which 5 ms to minimize.
[2024-06-01 16:24:35] [INFO ] Deduced a trap composed of 196 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:24:35] [INFO ] Deduced a trap composed of 216 places in 365 ms of which 5 ms to minimize.
[2024-06-01 16:24:36] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:24:36] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:24:36] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 6 ms to minimize.
[2024-06-01 16:24:37] [INFO ] Deduced a trap composed of 261 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:24:37] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 63040ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63058ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/904 places, 1103/1237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93554 ms. Remains : 770/904 places, 1103/1237 transitions.
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-08 finished in 94109 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(X((p0&&G(F(((!p2 U G(p0))||p1)))))))'
Support contains 64 out of 904 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 48 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:24:47] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-06-01 16:24:47] [INFO ] Computed 137 invariants in 38 ms
[2024-06-01 16:24:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.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 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.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 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 (/ 2.0 3.0))
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 (/ 2.0 3.0))
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.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 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.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)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 (/ 2.0 3.0))
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 (/ 1.0 4.0))
(s384 4.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 (/ 2.0 3.0))
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 (/ 2.0 3.0))
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 (/ 2.0 3.0))
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 3.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 (/ 1.0 3.0))
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 (/ 1.0 3.0))
(s762 1.0)
(s763 (/ 1.0 3.0))
(s764 1.0)
(s770 0.0)
(s771 0.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43387ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43404ms
[2024-06-01 16:25:30] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:25:30] [INFO ] Invariant cache hit.
[2024-06-01 16:25:31] [INFO ] Implicit Places using invariants in 757 ms returned []
[2024-06-01 16:25:31] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:25:31] [INFO ] Invariant cache hit.
[2024-06-01 16:25:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:25:37] [INFO ] Implicit Places using invariants and state equation in 6494 ms returned []
Implicit Place search using SMT with State Equation took 7266 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:25:37] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:25:37] [INFO ] Invariant cache hit.
[2024-06-01 16:25:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.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 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.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 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 (/ 2.0 3.0))
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.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 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 (/ 1.0 3.0))
(s249 (/ 1.0 3.0))
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 304 places in 379 ms of which 6 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 12 places in 369 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 63551ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 63567ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114293 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-10 finished in 114522 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(F(!p0))||G(p1))))'
Support contains 64 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 34 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:26:41] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:26:41] [INFO ] Invariant cache hit.
[2024-06-01 16:26:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43090ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43107ms
[2024-06-01 16:27:24] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:27:24] [INFO ] Invariant cache hit.
[2024-06-01 16:27:25] [INFO ] Implicit Places using invariants in 953 ms returned []
[2024-06-01 16:27:25] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:27:25] [INFO ] Invariant cache hit.
[2024-06-01 16:27:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:27:30] [INFO ] Implicit Places using invariants and state equation in 4800 ms returned []
Implicit Place search using SMT with State Equation took 5756 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:27:30] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:27:30] [INFO ] Invariant cache hit.
[2024-06-01 16:27:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-06-01 16:28:30] [INFO ] Deduced a trap composed of 304 places in 402 ms of which 6 ms to minimize.
[2024-06-01 16:28:30] [INFO ] Deduced a trap composed of 12 places in 401 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 63430ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 63475ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112382 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-11
Product exploration explored 100000 steps with 6992 reset in 1033 ms.
Product exploration explored 100000 steps with 6865 reset in 717 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 p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) p0), p0, p0]
RANDOM walk for 40000 steps (2720 resets) in 378 ms. (105 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (501 resets) in 2132 ms. (18 steps per ms) remains 1/1 properties
[2024-06-01 16:28:36] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:28:36] [INFO ] Invariant cache hit.
[2024-06-01 16:28:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 510/574 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 574/2135 variables, and 65 constraints, problems are : Problem set: 1 solved, 0 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 64/131 constraints, Generalized P Invariants (flows): 1/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 236ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 8 factoid took 229 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) p0), p0, p0]
Support contains 64 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 903 transition count 1171
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 773 transition count 1106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 266 place count 770 transition count 1103
Applied a total of 266 rules in 94 ms. Remains 770 /903 variables (removed 133) and now considering 1103/1236 (removed 133) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:28:37] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-06-01 16:28:37] [INFO ] Computed 137 invariants in 35 ms
[2024-06-01 16:28:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:28:50] [INFO ] Deduced a trap composed of 239 places in 288 ms of which 5 ms to minimize.
[2024-06-01 16:28:51] [INFO ] Deduced a trap composed of 233 places in 295 ms of which 5 ms to minimize.
[2024-06-01 16:28:51] [INFO ] Deduced a trap composed of 227 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:28:51] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:28:52] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 5 ms to minimize.
[2024-06-01 16:28:52] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:28:52] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 5 ms to minimize.
[2024-06-01 16:28:53] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 6 ms to minimize.
[2024-06-01 16:28:53] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:28:53] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:28:54] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 6 ms to minimize.
[2024-06-01 16:28:54] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 5 ms to minimize.
[2024-06-01 16:28:54] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:28:55] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 5 ms to minimize.
[2024-06-01 16:28:55] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 5 ms to minimize.
[2024-06-01 16:28:55] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:28:55] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 5 ms to minimize.
[2024-06-01 16:28:56] [INFO ] Deduced a trap composed of 196 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:28:56] [INFO ] Deduced a trap composed of 196 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:28:56] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:28:57] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 4 ms to minimize.
[2024-06-01 16:28:57] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:28:58] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:28:58] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:28:58] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:28:59] [INFO ] Deduced a trap composed of 196 places in 289 ms of which 5 ms to minimize.
[2024-06-01 16:28:59] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:28:59] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:29:00] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 5 ms to minimize.
[2024-06-01 16:29:00] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 5 ms to minimize.
[2024-06-01 16:29:00] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 5 ms to minimize.
[2024-06-01 16:29:01] [INFO ] Deduced a trap composed of 196 places in 358 ms of which 5 ms to minimize.
SMT process timed out in 23351ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23369ms
[2024-06-01 16:29:01] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:29:01] [INFO ] Invariant cache hit.
[2024-06-01 16:29:02] [INFO ] Implicit Places using invariants in 1022 ms returned []
[2024-06-01 16:29:02] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:29:02] [INFO ] Invariant cache hit.
[2024-06-01 16:29:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:29:08] [INFO ] Implicit Places using invariants and state equation in 5895 ms returned []
Implicit Place search using SMT with State Equation took 6922 ms to find 0 implicit places.
[2024-06-01 16:29:08] [INFO ] Redundant transitions in 11 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:29:08] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:29:08] [INFO ] Invariant cache hit.
[2024-06-01 16:29:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:29:21] [INFO ] Deduced a trap composed of 245 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:29:21] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-06-01 16:29:22] [INFO ] Deduced a trap composed of 233 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:29:22] [INFO ] Deduced a trap composed of 196 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:29:23] [INFO ] Deduced a trap composed of 230 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:29:23] [INFO ] Deduced a trap composed of 196 places in 365 ms of which 8 ms to minimize.
[2024-06-01 16:29:23] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:29:24] [INFO ] Deduced a trap composed of 245 places in 373 ms of which 6 ms to minimize.
[2024-06-01 16:29:24] [INFO ] Deduced a trap composed of 196 places in 374 ms of which 5 ms to minimize.
[2024-06-01 16:29:25] [INFO ] Deduced a trap composed of 196 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:29:25] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:29:25] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:29:26] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 ms to minimize.
[2024-06-01 16:29:26] [INFO ] Deduced a trap composed of 254 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:29:26] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:29:27] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:29:27] [INFO ] Deduced a trap composed of 242 places in 350 ms of which 5 ms to minimize.
[2024-06-01 16:29:28] [INFO ] Deduced a trap composed of 196 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:29:28] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:29:28] [INFO ] Deduced a trap composed of 242 places in 252 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:29:29] [INFO ] Deduced a trap composed of 254 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:29:29] [INFO ] Deduced a trap composed of 245 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:29:30] [INFO ] Deduced a trap composed of 248 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:29:30] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-06-01 16:29:31] [INFO ] Deduced a trap composed of 251 places in 291 ms of which 5 ms to minimize.
[2024-06-01 16:29:31] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:29:31] [INFO ] Deduced a trap composed of 233 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:29:32] [INFO ] Deduced a trap composed of 236 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:29:32] [INFO ] Deduced a trap composed of 196 places in 340 ms of which 10 ms to minimize.
[2024-06-01 16:29:32] [INFO ] Deduced a trap composed of 230 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 260 places in 300 ms of which 5 ms to minimize.
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 236 places in 359 ms of which 5 ms to minimize.
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 5 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 196 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:29:36] [INFO ] Deduced a trap composed of 196 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:29:36] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:29:46] [INFO ] Deduced a trap composed of 200 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:29:46] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:29:47] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 4 ms to minimize.
[2024-06-01 16:29:47] [INFO ] Deduced a trap composed of 196 places in 358 ms of which 5 ms to minimize.
[2024-06-01 16:29:47] [INFO ] Deduced a trap composed of 200 places in 295 ms of which 5 ms to minimize.
[2024-06-01 16:29:48] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:29:48] [INFO ] Deduced a trap composed of 200 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:29:48] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:29:49] [INFO ] Deduced a trap composed of 200 places in 324 ms of which 4 ms to minimize.
[2024-06-01 16:29:49] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:29:49] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 5 ms to minimize.
[2024-06-01 16:29:50] [INFO ] Deduced a trap composed of 200 places in 332 ms of which 4 ms to minimize.
[2024-06-01 16:29:50] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:29:50] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:29:50] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:29:51] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:29:51] [INFO ] Deduced a trap composed of 200 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:29:51] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:29:52] [INFO ] Deduced a trap composed of 200 places in 339 ms of which 3 ms to minimize.
[2024-06-01 16:29:52] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:29:55] [INFO ] Deduced a trap composed of 249 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:29:56] [INFO ] Deduced a trap composed of 248 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:29:56] [INFO ] Deduced a trap composed of 237 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:29:56] [INFO ] Deduced a trap composed of 230 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:29:57] [INFO ] Deduced a trap composed of 248 places in 270 ms of which 5 ms to minimize.
[2024-06-01 16:29:57] [INFO ] Deduced a trap composed of 255 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:29:57] [INFO ] Deduced a trap composed of 237 places in 252 ms of which 5 ms to minimize.
[2024-06-01 16:29:58] [INFO ] Deduced a trap composed of 248 places in 321 ms of which 5 ms to minimize.
[2024-06-01 16:29:58] [INFO ] Deduced a trap composed of 242 places in 346 ms of which 7 ms to minimize.
[2024-06-01 16:29:58] [INFO ] Deduced a trap composed of 236 places in 307 ms of which 5 ms to minimize.
[2024-06-01 16:29:59] [INFO ] Deduced a trap composed of 254 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:29:59] [INFO ] Deduced a trap composed of 245 places in 360 ms of which 5 ms to minimize.
[2024-06-01 16:30:00] [INFO ] Deduced a trap composed of 196 places in 370 ms of which 5 ms to minimize.
[2024-06-01 16:30:00] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 6 ms to minimize.
[2024-06-01 16:30:01] [INFO ] Deduced a trap composed of 216 places in 373 ms of which 5 ms to minimize.
[2024-06-01 16:30:01] [INFO ] Deduced a trap composed of 196 places in 352 ms of which 5 ms to minimize.
[2024-06-01 16:30:01] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 6 ms to minimize.
[2024-06-01 16:30:02] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 6 ms to minimize.
[2024-06-01 16:30:02] [INFO ] Deduced a trap composed of 261 places in 358 ms of which 5 ms to minimize.
[2024-06-01 16:30:03] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 63096ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63109ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/903 places, 1103/1236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93523 ms. Remains : 770/903 places, 1103/1236 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 p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 148 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) p0), p0, p0]
RANDOM walk for 40000 steps (2081 resets) in 416 ms. (95 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (132 resets) in 374 ms. (106 steps per ms) remains 1/1 properties
[2024-06-01 16:30:11] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:30:11] [INFO ] Invariant cache hit.
[2024-06-01 16:30:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 375/439 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 305/744 variables, 61/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/756 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 767/1869 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 128/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 371ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 8 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) p0), p0, p0]
Product exploration explored 100000 steps with 5366 reset in 1339 ms.
Product exploration explored 100000 steps with 5327 reset in 1003 ms.
Support contains 64 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 22 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:30:15] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:30:15] [INFO ] Invariant cache hit.
[2024-06-01 16:30:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:30:28] [INFO ] Deduced a trap composed of 245 places in 431 ms of which 12 ms to minimize.
[2024-06-01 16:30:28] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:30:29] [INFO ] Deduced a trap composed of 233 places in 304 ms of which 6 ms to minimize.
[2024-06-01 16:30:29] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:30:29] [INFO ] Deduced a trap composed of 230 places in 339 ms of which 5 ms to minimize.
[2024-06-01 16:30:30] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:30:30] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 5 ms to minimize.
[2024-06-01 16:30:30] [INFO ] Deduced a trap composed of 245 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:30:31] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 5 ms to minimize.
[2024-06-01 16:30:31] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:30:31] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:30:32] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 5 ms to minimize.
[2024-06-01 16:30:32] [INFO ] Deduced a trap composed of 196 places in 353 ms of which 5 ms to minimize.
[2024-06-01 16:30:32] [INFO ] Deduced a trap composed of 254 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:30:33] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:30:33] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 10 ms to minimize.
[2024-06-01 16:30:33] [INFO ] Deduced a trap composed of 242 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:30:34] [INFO ] Deduced a trap composed of 196 places in 360 ms of which 5 ms to minimize.
[2024-06-01 16:30:34] [INFO ] Deduced a trap composed of 196 places in 352 ms of which 6 ms to minimize.
[2024-06-01 16:30:35] [INFO ] Deduced a trap composed of 242 places in 336 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:30:35] [INFO ] Deduced a trap composed of 254 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:30:36] [INFO ] Deduced a trap composed of 245 places in 304 ms of which 5 ms to minimize.
[2024-06-01 16:30:36] [INFO ] Deduced a trap composed of 248 places in 353 ms of which 5 ms to minimize.
[2024-06-01 16:30:37] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:30:37] [INFO ] Deduced a trap composed of 251 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:30:37] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:30:38] [INFO ] Deduced a trap composed of 233 places in 327 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 159 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 27/159 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:30:40] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:30:42] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:30:43] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:30:43] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 5 ms to minimize.
[2024-06-01 16:30:44] [INFO ] Deduced a trap composed of 200 places in 324 ms of which 6 ms to minimize.
[2024-06-01 16:30:44] [INFO ] Deduced a trap composed of 239 places in 288 ms of which 5 ms to minimize.
[2024-06-01 16:30:44] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 5 ms to minimize.
[2024-06-01 16:30:45] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:30:45] [INFO ] Deduced a trap composed of 200 places in 312 ms of which 6 ms to minimize.
[2024-06-01 16:30:45] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-06-01 16:30:45] [INFO ] Deduced a trap composed of 200 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:30:46] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:30:46] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:30:46] [INFO ] Deduced a trap composed of 200 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:30:46] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:30:47] [INFO ] Deduced a trap composed of 196 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:30:47] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:30:47] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:30:48] [INFO ] Deduced a trap composed of 200 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:30:48] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:30:49] [INFO ] Deduced a trap composed of 240 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:30:49] [INFO ] Deduced a trap composed of 231 places in 285 ms of which 5 ms to minimize.
[2024-06-01 16:30:50] [INFO ] Deduced a trap composed of 239 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:30:50] [INFO ] Deduced a trap composed of 251 places in 261 ms of which 5 ms to minimize.
[2024-06-01 16:30:50] [INFO ] Deduced a trap composed of 251 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:30:51] [INFO ] Deduced a trap composed of 196 places in 366 ms of which 5 ms to minimize.
[2024-06-01 16:30:51] [INFO ] Deduced a trap composed of 196 places in 372 ms of which 5 ms to minimize.
[2024-06-01 16:30:52] [INFO ] Deduced a trap composed of 196 places in 353 ms of which 5 ms to minimize.
[2024-06-01 16:30:52] [INFO ] Deduced a trap composed of 196 places in 362 ms of which 9 ms to minimize.
[2024-06-01 16:30:52] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:30:53] [INFO ] Deduced a trap composed of 196 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:30:53] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:30:53] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:30:54] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:30:54] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:30:54] [INFO ] Deduced a trap composed of 196 places in 372 ms of which 5 ms to minimize.
[2024-06-01 16:30:55] [INFO ] Deduced a trap composed of 196 places in 354 ms of which 5 ms to minimize.
[2024-06-01 16:30:55] [INFO ] Deduced a trap composed of 196 places in 363 ms of which 4 ms to minimize.
[2024-06-01 16:30:56] [INFO ] Deduced a trap composed of 196 places in 379 ms of which 6 ms to minimize.
[2024-06-01 16:30:56] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 199 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 67/67 constraints]
After SMT, in 43077ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 43085ms
[2024-06-01 16:30:58] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:30:58] [INFO ] Invariant cache hit.
[2024-06-01 16:30:58] [INFO ] Implicit Places using invariants in 732 ms returned []
[2024-06-01 16:30:58] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:30:58] [INFO ] Invariant cache hit.
[2024-06-01 16:30:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:31:04] [INFO ] Implicit Places using invariants and state equation in 6020 ms returned []
Implicit Place search using SMT with State Equation took 6758 ms to find 0 implicit places.
[2024-06-01 16:31:04] [INFO ] Redundant transitions in 22 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:31:04] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:31:05] [INFO ] Invariant cache hit.
[2024-06-01 16:31:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:31:19] [INFO ] Deduced a trap composed of 245 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:31:19] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:31:20] [INFO ] Deduced a trap composed of 233 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:31:20] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 10 ms to minimize.
[2024-06-01 16:31:20] [INFO ] Deduced a trap composed of 230 places in 359 ms of which 9 ms to minimize.
[2024-06-01 16:31:21] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:31:21] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:31:22] [INFO ] Deduced a trap composed of 245 places in 350 ms of which 6 ms to minimize.
[2024-06-01 16:31:22] [INFO ] Deduced a trap composed of 196 places in 398 ms of which 7 ms to minimize.
[2024-06-01 16:31:22] [INFO ] Deduced a trap composed of 196 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:31:23] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 5 ms to minimize.
[2024-06-01 16:31:23] [INFO ] Deduced a trap composed of 196 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:31:24] [INFO ] Deduced a trap composed of 196 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:31:24] [INFO ] Deduced a trap composed of 254 places in 337 ms of which 9 ms to minimize.
[2024-06-01 16:31:24] [INFO ] Deduced a trap composed of 196 places in 350 ms of which 5 ms to minimize.
[2024-06-01 16:31:25] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:31:25] [INFO ] Deduced a trap composed of 242 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 196 places in 353 ms of which 5 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 242 places in 270 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:31:27] [INFO ] Deduced a trap composed of 254 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:31:27] [INFO ] Deduced a trap composed of 245 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:31:28] [INFO ] Deduced a trap composed of 248 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:31:28] [INFO ] Deduced a trap composed of 196 places in 344 ms of which 5 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 251 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 196 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 233 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 236 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 260 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:31:31] [INFO ] Deduced a trap composed of 236 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:31:31] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:31:32] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:31:32] [INFO ] Deduced a trap composed of 196 places in 289 ms of which 5 ms to minimize.
[2024-06-01 16:31:32] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:31:32] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:31:33] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 6 ms to minimize.
[2024-06-01 16:31:33] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:31:33] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:31:43] [INFO ] Deduced a trap composed of 200 places in 346 ms of which 5 ms to minimize.
[2024-06-01 16:31:43] [INFO ] Deduced a trap composed of 196 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:31:43] [INFO ] Deduced a trap composed of 196 places in 374 ms of which 5 ms to minimize.
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 196 places in 344 ms of which 5 ms to minimize.
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 200 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 4 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 200 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 200 places in 369 ms of which 5 ms to minimize.
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 6 ms to minimize.
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 196 places in 363 ms of which 5 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 200 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 6 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 200 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 200 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:31:52] [INFO ] Deduced a trap composed of 249 places in 344 ms of which 5 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 248 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 237 places in 352 ms of which 5 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 230 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 248 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 255 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 237 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 248 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 242 places in 281 ms of which 5 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Deduced a trap composed of 254 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Deduced a trap composed of 245 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:31:57] [INFO ] Deduced a trap composed of 196 places in 375 ms of which 5 ms to minimize.
[2024-06-01 16:31:57] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 5 ms to minimize.
[2024-06-01 16:31:58] [INFO ] Deduced a trap composed of 216 places in 328 ms of which 5 ms to minimize.
[2024-06-01 16:31:58] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:31:58] [INFO ] Deduced a trap composed of 196 places in 356 ms of which 5 ms to minimize.
[2024-06-01 16:31:59] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:31:59] [INFO ] Deduced a trap composed of 261 places in 386 ms of which 6 ms to minimize.
[2024-06-01 16:32:00] [INFO ] Deduced a trap composed of 196 places in 345 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 63259ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63279ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113184 ms. Remains : 770/770 places, 1103/1103 transitions.
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-11 finished in 326755 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' '!((p0 U G(!p1)))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1172
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 839 transition count 1171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 838 transition count 1171
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 132 place count 838 transition count 1108
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 258 place count 775 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 774 transition count 1107
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 774 transition count 1107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 772 transition count 1105
Applied a total of 264 rules in 110 ms. Remains 772 /904 variables (removed 132) and now considering 1105/1237 (removed 132) transitions.
Running 1099 sub problems to find dead transitions.
[2024-06-01 16:32:08] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
// Phase 1: matrix 1101 rows 772 cols
[2024-06-01 16:32:08] [INFO ] Computed 137 invariants in 40 ms
[2024-06-01 16:32:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 (/ 1.0 3.0))
(s9 1.0)
(s10 (/ 2.0 3.0))
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 6.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.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 3.0))
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 (/ 1.0 3.0))
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.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 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 (/ 1.0 3.0))
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 4/770 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1873 variables, and 135 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 3 (OVERLAPS) 4/770 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 770/1873 variables, and 135 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1099 constraints, Known Traps: 0/0 constraints]
After SMT, in 42915ms problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 42932ms
[2024-06-01 16:32:51] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-06-01 16:32:51] [INFO ] Invariant cache hit.
[2024-06-01 16:32:52] [INFO ] Implicit Places using invariants in 863 ms returned []
[2024-06-01 16:32:52] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-06-01 16:32:52] [INFO ] Invariant cache hit.
[2024-06-01 16:32:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:33:01] [INFO ] Implicit Places using invariants and state equation in 8953 ms returned []
Implicit Place search using SMT with State Equation took 9819 ms to find 0 implicit places.
[2024-06-01 16:33:01] [INFO ] Redundant transitions in 8 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-06-01 16:33:01] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-06-01 16:33:01] [INFO ] Invariant cache hit.
[2024-06-01 16:33:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 4/770 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1873 variables, and 135 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 3 (OVERLAPS) 4/770 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/772 variables, 2/137 constraints. Problems are: Problem set: 17 solved, 1082 unsolved
[2024-06-01 16:34:02] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/1873 variables, and 138 constraints, problems are : Problem set: 17 solved, 1082 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1099 constraints, Known Traps: 1/1 constraints]
After SMT, in 63070ms problems are : Problem set: 17 solved, 1082 unsolved
Search for dead transitions found 17 dead transitions in 63083ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 772/904 places, 1088/1237 transitions.
Applied a total of 0 rules in 24 ms. Remains 772 /772 variables (removed 0) and now considering 1088/1088 (removed 0) transitions.
[2024-06-01 16:34:04] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 116010 ms. Remains : 772/904 places, 1088/1237 transitions.
Stuttering acceptance computed with spot in 105 ms :[p1, true, p1]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-12
Entered a terminal (fully accepting) state of product in 60 steps with 2 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-12 finished in 116144 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(X(F(p0))))'
Support contains 62 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 35 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:34:04] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-06-01 16:34:04] [INFO ] Computed 137 invariants in 35 ms
[2024-06-01 16:34:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42705ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42720ms
[2024-06-01 16:34:47] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:34:47] [INFO ] Invariant cache hit.
[2024-06-01 16:34:48] [INFO ] Implicit Places using invariants in 775 ms returned []
[2024-06-01 16:34:48] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:34:48] [INFO ] Invariant cache hit.
[2024-06-01 16:34:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:34:54] [INFO ] Implicit Places using invariants and state equation in 6503 ms returned []
Implicit Place search using SMT with State Equation took 7281 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-06-01 16:34:54] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-06-01 16:34:54] [INFO ] Invariant cache hit.
[2024-06-01 16:34:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-06-01 16:35:51] [INFO ] Deduced a trap composed of 304 places in 423 ms of which 6 ms to minimize.
[2024-06-01 16:35:52] [INFO ] Deduced a trap composed of 12 places in 414 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62908ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62919ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112962 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 429 ms.
Product exploration explored 100000 steps with 33333 reset in 521 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 26 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S05J60-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-15 finished in 114101 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' '!(G(F(p0)))'
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' '!((F(G(p0))||G((F(p2)&&p1))))'
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(F(!p0))||G(p1))))'
Found a Lengthening insensitive property : PolyORBNT-COL-S05J60-LTLFireability-11
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Support contains 64 out of 904 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1171
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1105
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1103
Applied a total of 268 rules in 75 ms. Remains 770 /904 variables (removed 134) and now considering 1103/1237 (removed 134) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:35:59] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-06-01 16:35:59] [INFO ] Computed 137 invariants in 21 ms
[2024-06-01 16:35:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:36:12] [INFO ] Deduced a trap composed of 239 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:36:12] [INFO ] Deduced a trap composed of 233 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:36:13] [INFO ] Deduced a trap composed of 227 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:36:13] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:36:13] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:36:14] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
[2024-06-01 16:36:14] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:36:14] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:36:14] [INFO ] Deduced a trap composed of 196 places in 341 ms of which 5 ms to minimize.
[2024-06-01 16:36:15] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:36:15] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:36:15] [INFO ] Deduced a trap composed of 196 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:36:16] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:36:16] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:36:16] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:36:17] [INFO ] Deduced a trap composed of 196 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:36:17] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:36:17] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:36:17] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:36:18] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:36:19] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:36:19] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 5 ms to minimize.
[2024-06-01 16:36:19] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:36:20] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 4 ms to minimize.
[2024-06-01 16:36:20] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 5 ms to minimize.
[2024-06-01 16:36:20] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 5 ms to minimize.
[2024-06-01 16:36:21] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:36:21] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:36:21] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:36:22] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:36:22] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
SMT process timed out in 22960ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22972ms
[2024-06-01 16:36:22] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:36:22] [INFO ] Invariant cache hit.
[2024-06-01 16:36:23] [INFO ] Implicit Places using invariants in 757 ms returned []
[2024-06-01 16:36:23] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:36:23] [INFO ] Invariant cache hit.
[2024-06-01 16:36:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:36:28] [INFO ] Implicit Places using invariants and state equation in 5785 ms returned []
Implicit Place search using SMT with State Equation took 6546 ms to find 0 implicit places.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:36:28] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:36:28] [INFO ] Invariant cache hit.
[2024-06-01 16:36:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:36:42] [INFO ] Deduced a trap composed of 245 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:36:42] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:36:43] [INFO ] Deduced a trap composed of 233 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:36:43] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
[2024-06-01 16:36:43] [INFO ] Deduced a trap composed of 230 places in 319 ms of which 4 ms to minimize.
[2024-06-01 16:36:44] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:36:44] [INFO ] Deduced a trap composed of 196 places in 366 ms of which 5 ms to minimize.
[2024-06-01 16:36:45] [INFO ] Deduced a trap composed of 245 places in 358 ms of which 5 ms to minimize.
[2024-06-01 16:36:45] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:36:46] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:36:46] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:36:46] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-06-01 16:36:47] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:36:47] [INFO ] Deduced a trap composed of 254 places in 325 ms of which 6 ms to minimize.
[2024-06-01 16:36:47] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-06-01 16:36:48] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:36:48] [INFO ] Deduced a trap composed of 242 places in 260 ms of which 5 ms to minimize.
[2024-06-01 16:36:48] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:36:49] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:36:49] [INFO ] Deduced a trap composed of 242 places in 243 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:36:50] [INFO ] Deduced a trap composed of 254 places in 304 ms of which 5 ms to minimize.
[2024-06-01 16:36:50] [INFO ] Deduced a trap composed of 245 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:36:50] [INFO ] Deduced a trap composed of 248 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:36:51] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:36:51] [INFO ] Deduced a trap composed of 251 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:36:52] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:36:52] [INFO ] Deduced a trap composed of 233 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:36:52] [INFO ] Deduced a trap composed of 236 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:36:53] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:36:53] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 5 ms to minimize.
[2024-06-01 16:36:53] [INFO ] Deduced a trap composed of 260 places in 307 ms of which 5 ms to minimize.
[2024-06-01 16:36:54] [INFO ] Deduced a trap composed of 236 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:36:54] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:36:54] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:36:55] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:36:55] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:36:55] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:36:55] [INFO ] Deduced a trap composed of 196 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:36:56] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:36:56] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:37:06] [INFO ] Deduced a trap composed of 200 places in 346 ms of which 5 ms to minimize.
[2024-06-01 16:37:07] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:37:07] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:37:07] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:37:08] [INFO ] Deduced a trap composed of 200 places in 374 ms of which 6 ms to minimize.
[2024-06-01 16:37:08] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 6 ms to minimize.
[2024-06-01 16:37:08] [INFO ] Deduced a trap composed of 200 places in 377 ms of which 5 ms to minimize.
[2024-06-01 16:37:09] [INFO ] Deduced a trap composed of 196 places in 365 ms of which 5 ms to minimize.
[2024-06-01 16:37:09] [INFO ] Deduced a trap composed of 200 places in 376 ms of which 6 ms to minimize.
[2024-06-01 16:37:10] [INFO ] Deduced a trap composed of 196 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:37:10] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:37:10] [INFO ] Deduced a trap composed of 200 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:37:11] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:37:11] [INFO ] Deduced a trap composed of 196 places in 359 ms of which 5 ms to minimize.
[2024-06-01 16:37:11] [INFO ] Deduced a trap composed of 196 places in 366 ms of which 6 ms to minimize.
[2024-06-01 16:37:12] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:37:12] [INFO ] Deduced a trap composed of 200 places in 339 ms of which 5 ms to minimize.
[2024-06-01 16:37:13] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:37:13] [INFO ] Deduced a trap composed of 200 places in 331 ms of which 4 ms to minimize.
[2024-06-01 16:37:13] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:37:16] [INFO ] Deduced a trap composed of 249 places in 334 ms of which 6 ms to minimize.
[2024-06-01 16:37:17] [INFO ] Deduced a trap composed of 248 places in 281 ms of which 5 ms to minimize.
[2024-06-01 16:37:17] [INFO ] Deduced a trap composed of 237 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:37:17] [INFO ] Deduced a trap composed of 230 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:37:18] [INFO ] Deduced a trap composed of 248 places in 288 ms of which 6 ms to minimize.
[2024-06-01 16:37:18] [INFO ] Deduced a trap composed of 255 places in 354 ms of which 6 ms to minimize.
[2024-06-01 16:37:18] [INFO ] Deduced a trap composed of 237 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:37:19] [INFO ] Deduced a trap composed of 248 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:37:19] [INFO ] Deduced a trap composed of 242 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:37:19] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 5 ms to minimize.
[2024-06-01 16:37:20] [INFO ] Deduced a trap composed of 254 places in 271 ms of which 5 ms to minimize.
[2024-06-01 16:37:20] [INFO ] Deduced a trap composed of 245 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:37:21] [INFO ] Deduced a trap composed of 196 places in 360 ms of which 9 ms to minimize.
[2024-06-01 16:37:21] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:37:22] [INFO ] Deduced a trap composed of 216 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:37:22] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:37:22] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:37:23] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:37:23] [INFO ] Deduced a trap composed of 261 places in 345 ms of which 4 ms to minimize.
[2024-06-01 16:37:23] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62998ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63022ms
Starting structural reductions in LI_LTL mode, iteration 1 : 770/904 places, 1103/1237 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 92625 ms. Remains : 770/904 places, 1103/1237 transitions.
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-11
Product exploration explored 100000 steps with 5355 reset in 1202 ms.
Product exploration explored 100000 steps with 5305 reset in 1218 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 p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) p0), p0, p0]
RANDOM walk for 40000 steps (2097 resets) in 357 ms. (111 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (136 resets) in 525 ms. (76 steps per ms) remains 1/1 properties
[2024-06-01 16:37:34] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:37:34] [INFO ] Invariant cache hit.
[2024-06-01 16:37:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 375/439 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 305/744 variables, 61/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/756 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 767/1869 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 128/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 8 factoid took 196 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) p0), p0, p0]
Support contains 64 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 33 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:37:35] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:37:35] [INFO ] Invariant cache hit.
[2024-06-01 16:37:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:37:49] [INFO ] Deduced a trap composed of 245 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:37:49] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:37:50] [INFO ] Deduced a trap composed of 233 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:37:50] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:37:50] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:37:51] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:37:51] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:37:51] [INFO ] Deduced a trap composed of 245 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:37:52] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:37:52] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:37:52] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:37:52] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:37:53] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 3 ms to minimize.
[2024-06-01 16:37:53] [INFO ] Deduced a trap composed of 254 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:37:53] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-06-01 16:37:54] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:37:54] [INFO ] Deduced a trap composed of 242 places in 302 ms of which 6 ms to minimize.
[2024-06-01 16:37:55] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:37:55] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:37:55] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:37:56] [INFO ] Deduced a trap composed of 254 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:37:56] [INFO ] Deduced a trap composed of 245 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:37:57] [INFO ] Deduced a trap composed of 248 places in 327 ms of which 6 ms to minimize.
[2024-06-01 16:37:57] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-06-01 16:37:58] [INFO ] Deduced a trap composed of 251 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:37:58] [INFO ] Deduced a trap composed of 196 places in 368 ms of which 6 ms to minimize.
[2024-06-01 16:37:58] [INFO ] Deduced a trap composed of 233 places in 341 ms of which 5 ms to minimize.
SMT process timed out in 23211ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23228ms
[2024-06-01 16:37:58] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:37:58] [INFO ] Invariant cache hit.
[2024-06-01 16:37:59] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-06-01 16:37:59] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:37:59] [INFO ] Invariant cache hit.
[2024-06-01 16:38:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:38:05] [INFO ] Implicit Places using invariants and state equation in 5769 ms returned []
Implicit Place search using SMT with State Equation took 6649 ms to find 0 implicit places.
[2024-06-01 16:38:05] [INFO ] Redundant transitions in 24 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:38:05] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:38:05] [INFO ] Invariant cache hit.
[2024-06-01 16:38:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:38:19] [INFO ] Deduced a trap composed of 245 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:38:20] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:38:20] [INFO ] Deduced a trap composed of 233 places in 330 ms of which 6 ms to minimize.
[2024-06-01 16:38:21] [INFO ] Deduced a trap composed of 196 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:38:21] [INFO ] Deduced a trap composed of 230 places in 336 ms of which 5 ms to minimize.
[2024-06-01 16:38:21] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:38:22] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 5 ms to minimize.
[2024-06-01 16:38:22] [INFO ] Deduced a trap composed of 245 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:38:23] [INFO ] Deduced a trap composed of 196 places in 357 ms of which 5 ms to minimize.
[2024-06-01 16:38:23] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:38:23] [INFO ] Deduced a trap composed of 196 places in 353 ms of which 5 ms to minimize.
[2024-06-01 16:38:24] [INFO ] Deduced a trap composed of 196 places in 367 ms of which 5 ms to minimize.
[2024-06-01 16:38:24] [INFO ] Deduced a trap composed of 196 places in 356 ms of which 5 ms to minimize.
[2024-06-01 16:38:24] [INFO ] Deduced a trap composed of 254 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:38:25] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:38:25] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 3 ms to minimize.
[2024-06-01 16:38:25] [INFO ] Deduced a trap composed of 242 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:38:26] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:38:26] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:38:27] [INFO ] Deduced a trap composed of 242 places in 361 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:38:27] [INFO ] Deduced a trap composed of 254 places in 346 ms of which 5 ms to minimize.
[2024-06-01 16:38:28] [INFO ] Deduced a trap composed of 245 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:38:28] [INFO ] Deduced a trap composed of 248 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:38:29] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:38:29] [INFO ] Deduced a trap composed of 251 places in 280 ms of which 5 ms to minimize.
[2024-06-01 16:38:29] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 5 ms to minimize.
[2024-06-01 16:38:30] [INFO ] Deduced a trap composed of 233 places in 285 ms of which 5 ms to minimize.
[2024-06-01 16:38:30] [INFO ] Deduced a trap composed of 236 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:38:30] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 5 ms to minimize.
[2024-06-01 16:38:31] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 5 ms to minimize.
[2024-06-01 16:38:31] [INFO ] Deduced a trap composed of 260 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:38:31] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:38:31] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:38:32] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:38:32] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:38:32] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:38:32] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:38:33] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:38:33] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-06-01 16:38:33] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:38:43] [INFO ] Deduced a trap composed of 200 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:38:44] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 5 ms to minimize.
[2024-06-01 16:38:44] [INFO ] Deduced a trap composed of 196 places in 357 ms of which 5 ms to minimize.
[2024-06-01 16:38:45] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:38:45] [INFO ] Deduced a trap composed of 200 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:38:45] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:38:46] [INFO ] Deduced a trap composed of 200 places in 369 ms of which 6 ms to minimize.
[2024-06-01 16:38:46] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
[2024-06-01 16:38:46] [INFO ] Deduced a trap composed of 200 places in 345 ms of which 5 ms to minimize.
[2024-06-01 16:38:47] [INFO ] Deduced a trap composed of 196 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:38:47] [INFO ] Deduced a trap composed of 196 places in 366 ms of which 5 ms to minimize.
[2024-06-01 16:38:47] [INFO ] Deduced a trap composed of 200 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:38:48] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:38:48] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:38:48] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:38:49] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:38:49] [INFO ] Deduced a trap composed of 200 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:38:49] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 5 ms to minimize.
[2024-06-01 16:38:50] [INFO ] Deduced a trap composed of 200 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:38:50] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:38:53] [INFO ] Deduced a trap composed of 249 places in 341 ms of which 5 ms to minimize.
[2024-06-01 16:38:53] [INFO ] Deduced a trap composed of 248 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:38:54] [INFO ] Deduced a trap composed of 237 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:38:54] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 6 ms to minimize.
[2024-06-01 16:38:54] [INFO ] Deduced a trap composed of 248 places in 307 ms of which 5 ms to minimize.
[2024-06-01 16:38:55] [INFO ] Deduced a trap composed of 255 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:38:55] [INFO ] Deduced a trap composed of 237 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:38:55] [INFO ] Deduced a trap composed of 248 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:38:56] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 5 ms to minimize.
[2024-06-01 16:38:56] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:38:56] [INFO ] Deduced a trap composed of 254 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:38:57] [INFO ] Deduced a trap composed of 245 places in 321 ms of which 5 ms to minimize.
[2024-06-01 16:38:58] [INFO ] Deduced a trap composed of 196 places in 380 ms of which 5 ms to minimize.
[2024-06-01 16:38:58] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:38:58] [INFO ] Deduced a trap composed of 216 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:38:58] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:38:59] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:38:59] [INFO ] Deduced a trap composed of 196 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:39:00] [INFO ] Deduced a trap composed of 261 places in 354 ms of which 5 ms to minimize.
[2024-06-01 16:39:00] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 63235ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 93204 ms. Remains : 770/770 places, 1103/1103 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 p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 145 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) p0), p0, p0]
RANDOM walk for 40000 steps (2076 resets) in 362 ms. (110 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (142 resets) in 340 ms. (117 steps per ms) remains 1/1 properties
[2024-06-01 16:39:09] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:39:09] [INFO ] Invariant cache hit.
[2024-06-01 16:39:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 375/439 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 305/744 variables, 61/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/756 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 767/1869 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 128/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 8 factoid took 234 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) p0), p0, p0]
Product exploration explored 100000 steps with 5343 reset in 1019 ms.
Product exploration explored 100000 steps with 5387 reset in 956 ms.
Support contains 64 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 22 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:39:12] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:39:12] [INFO ] Invariant cache hit.
[2024-06-01 16:39:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:39:26] [INFO ] Deduced a trap composed of 245 places in 338 ms of which 6 ms to minimize.
[2024-06-01 16:39:27] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:39:27] [INFO ] Deduced a trap composed of 233 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:39:27] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:39:28] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:39:28] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:39:28] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:39:29] [INFO ] Deduced a trap composed of 245 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:39:29] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:39:29] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:39:30] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-06-01 16:39:30] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:39:30] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 4 ms to minimize.
[2024-06-01 16:39:31] [INFO ] Deduced a trap composed of 254 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:39:31] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:39:31] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:39:31] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:39:32] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:39:32] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:39:32] [INFO ] Deduced a trap composed of 242 places in 269 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:39:33] [INFO ] Deduced a trap composed of 254 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:39:33] [INFO ] Deduced a trap composed of 245 places in 325 ms of which 5 ms to minimize.
[2024-06-01 16:39:34] [INFO ] Deduced a trap composed of 248 places in 298 ms of which 6 ms to minimize.
[2024-06-01 16:39:34] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:39:34] [INFO ] Deduced a trap composed of 251 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:39:35] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:39:35] [INFO ] Deduced a trap composed of 233 places in 246 ms of which 3 ms to minimize.
SMT process timed out in 23046ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23058ms
[2024-06-01 16:39:35] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:39:35] [INFO ] Invariant cache hit.
[2024-06-01 16:39:36] [INFO ] Implicit Places using invariants in 770 ms returned []
[2024-06-01 16:39:36] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:39:36] [INFO ] Invariant cache hit.
[2024-06-01 16:39:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:39:42] [INFO ] Implicit Places using invariants and state equation in 6020 ms returned []
Implicit Place search using SMT with State Equation took 6791 ms to find 0 implicit places.
[2024-06-01 16:39:42] [INFO ] Redundant transitions in 24 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-06-01 16:39:42] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-06-01 16:39:42] [INFO ] Invariant cache hit.
[2024-06-01 16:39:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:39:56] [INFO ] Deduced a trap composed of 245 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:39:56] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:39:56] [INFO ] Deduced a trap composed of 233 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:39:57] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:39:57] [INFO ] Deduced a trap composed of 230 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:39:58] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:39:58] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:39:58] [INFO ] Deduced a trap composed of 245 places in 323 ms of which 4 ms to minimize.
[2024-06-01 16:39:59] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:39:59] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:39:59] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:40:00] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 6 ms to minimize.
[2024-06-01 16:40:00] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:40:00] [INFO ] Deduced a trap composed of 254 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:40:00] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:40:01] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:40:01] [INFO ] Deduced a trap composed of 242 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:40:01] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:40:02] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:40:02] [INFO ] Deduced a trap composed of 242 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:40:03] [INFO ] Deduced a trap composed of 254 places in 314 ms of which 5 ms to minimize.
[2024-06-01 16:40:03] [INFO ] Deduced a trap composed of 245 places in 365 ms of which 6 ms to minimize.
[2024-06-01 16:40:04] [INFO ] Deduced a trap composed of 248 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:40:04] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:40:04] [INFO ] Deduced a trap composed of 251 places in 297 ms of which 5 ms to minimize.
[2024-06-01 16:40:05] [INFO ] Deduced a trap composed of 196 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:40:05] [INFO ] Deduced a trap composed of 233 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:40:06] [INFO ] Deduced a trap composed of 236 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:40:06] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 6 ms to minimize.
[2024-06-01 16:40:06] [INFO ] Deduced a trap composed of 230 places in 325 ms of which 5 ms to minimize.
[2024-06-01 16:40:07] [INFO ] Deduced a trap composed of 260 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:40:07] [INFO ] Deduced a trap composed of 236 places in 296 ms of which 5 ms to minimize.
[2024-06-01 16:40:07] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:40:07] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:40:08] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:40:08] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:40:08] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:40:09] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:40:09] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:40:09] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:40:20] [INFO ] Deduced a trap composed of 200 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:40:20] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:40:20] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:40:21] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 3 ms to minimize.
[2024-06-01 16:40:21] [INFO ] Deduced a trap composed of 200 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:40:21] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:40:22] [INFO ] Deduced a trap composed of 200 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:40:22] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 4 ms to minimize.
[2024-06-01 16:40:22] [INFO ] Deduced a trap composed of 200 places in 290 ms of which 3 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 200 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 3 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 200 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 200 places in 296 ms of which 3 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 249 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 248 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 237 places in 336 ms of which 7 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 248 places in 261 ms of which 5 ms to minimize.
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 255 places in 324 ms of which 4 ms to minimize.
[2024-06-01 16:40:31] [INFO ] Deduced a trap composed of 237 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:40:31] [INFO ] Deduced a trap composed of 248 places in 252 ms of which 5 ms to minimize.
[2024-06-01 16:40:31] [INFO ] Deduced a trap composed of 242 places in 252 ms of which 5 ms to minimize.
[2024-06-01 16:40:31] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 5 ms to minimize.
[2024-06-01 16:40:32] [INFO ] Deduced a trap composed of 254 places in 341 ms of which 5 ms to minimize.
[2024-06-01 16:40:32] [INFO ] Deduced a trap composed of 245 places in 352 ms of which 5 ms to minimize.
[2024-06-01 16:40:33] [INFO ] Deduced a trap composed of 196 places in 385 ms of which 5 ms to minimize.
[2024-06-01 16:40:33] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
[2024-06-01 16:40:34] [INFO ] Deduced a trap composed of 216 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:40:34] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:40:34] [INFO ] Deduced a trap composed of 196 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:40:35] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:40:35] [INFO ] Deduced a trap composed of 261 places in 377 ms of which 6 ms to minimize.
[2024-06-01 16:40:36] [INFO ] Deduced a trap composed of 196 places in 346 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62958ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62978ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 92886 ms. Remains : 770/770 places, 1103/1103 transitions.
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-11 finished in 286437 ms.
[2024-06-01 16:40:45] [INFO ] Flatten gal took : 59 ms
[2024-06-01 16:40:45] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 16:40:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 904 places, 1237 transitions and 5899 arcs took 21 ms.
Total runtime 2127006 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBNT-COL-S05J60-LTLFireability-00
Could not compute solution for formula : PolyORBNT-COL-S05J60-LTLFireability-06
Could not compute solution for formula : PolyORBNT-COL-S05J60-LTLFireability-11

BK_STOP 1717261236487

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBNT-COL-S05J60-LTLFireability-00
ltl formula formula --ltl=/tmp/5632/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 904 places, 1237 transitions and 5899 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.070 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5632/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5632/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5632/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5632/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBNT-COL-S05J60-LTLFireability-06
ltl formula formula --ltl=/tmp/5632/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 904 places, 1237 transitions and 5899 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.030 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5632/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5632/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5632/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5632/ltl_1_
ltl formula name PolyORBNT-COL-S05J60-LTLFireability-11
ltl formula formula --ltl=/tmp/5632/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 904 places, 1237 transitions and 5899 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.030 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5632/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5632/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5632/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5632/ltl_2_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected

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="PolyORBNT-COL-S05J60"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-COL-S05J60, 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 r516-tajo-171654447000388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;