About the Execution of LTSMin+red for PolyORBLF-PT-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2001.760 | 746608.00 | 886564.00 | 170.10 | ?T?????????????T | normal |
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-171654446700242.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 PolyORBLF-PT-S02J06T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700242
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 601K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717252727254
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:38:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:38:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:38:48] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-01 14:38:48] [INFO ] Transformed 536 places.
[2024-06-01 14:38:48] [INFO ] Transformed 1064 transitions.
[2024-06-01 14:38:48] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
[2024-06-01 14:38:48] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 366 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 531 transition count 963
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 531 transition count 963
Applied a total of 10 rules in 54 ms. Remains 531 /536 variables (removed 5) and now considering 963/968 (removed 5) transitions.
Running 961 sub problems to find dead transitions.
[2024-06-01 14:38:48] [INFO ] Flow matrix only has 951 transitions (discarded 12 similar events)
// Phase 1: matrix 951 rows 531 cols
[2024-06-01 14:38:48] [INFO ] Computed 50 invariants in 43 ms
[2024-06-01 14:38:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 20 places in 313 ms of which 32 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 2 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 253 places in 225 ms of which 4 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 153 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 189 places in 156 ms of which 3 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 149 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 347 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 247 places in 276 ms of which 4 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 268 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 263 places in 235 ms of which 4 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 248 places in 270 ms of which 4 ms to minimize.
[2024-06-01 14:39:07] [INFO ] Deduced a trap composed of 233 places in 277 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.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 1.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 1.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 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 3.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 1.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 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.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 1.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 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 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.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)
(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 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.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 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 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 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.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 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 6.0)
(s395 0.0)
(s396 7.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.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)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 timeout
0.0)
(s434 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1482 variables, and 64 constraints, problems are : Problem set: 0 solved, 961 unsolved in 20092 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/531 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 961 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 527/1482 variables, and 64 constraints, problems are : Problem set: 0 solved, 961 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/531 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 18/18 constraints]
After SMT, in 41230ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 41269ms
[2024-06-01 14:39:30] [INFO ] Flow matrix only has 951 transitions (discarded 12 similar events)
[2024-06-01 14:39:30] [INFO ] Invariant cache hit.
[2024-06-01 14:39:30] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-01 14:39:30] [INFO ] Flow matrix only has 951 transitions (discarded 12 similar events)
[2024-06-01 14:39:30] [INFO ] Invariant cache hit.
[2024-06-01 14:39:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:39:34] [INFO ] Implicit Places using invariants and state equation in 4107 ms returned []
Implicit Place search using SMT with State Equation took 4349 ms to find 0 implicit places.
Running 961 sub problems to find dead transitions.
[2024-06-01 14:39:34] [INFO ] Flow matrix only has 951 transitions (discarded 12 similar events)
[2024-06-01 14:39:34] [INFO ] Invariant cache hit.
[2024-06-01 14:39:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 14:39:42] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:39:42] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 1 ms to minimize.
[2024-06-01 14:39:42] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:39:42] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:39:42] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:39:42] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:39:42] [INFO ] Deduced a trap composed of 253 places in 217 ms of which 4 ms to minimize.
[2024-06-01 14:39:42] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:39:43] [INFO ] Deduced a trap composed of 134 places in 273 ms of which 4 ms to minimize.
[2024-06-01 14:39:44] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:39:48] [INFO ] Deduced a trap composed of 259 places in 257 ms of which 4 ms to minimize.
[2024-06-01 14:39:49] [INFO ] Deduced a trap composed of 276 places in 276 ms of which 4 ms to minimize.
[2024-06-01 14:39:49] [INFO ] Deduced a trap composed of 265 places in 271 ms of which 5 ms to minimize.
[2024-06-01 14:39:49] [INFO ] Deduced a trap composed of 275 places in 314 ms of which 4 ms to minimize.
[2024-06-01 14:39:50] [INFO ] Deduced a trap composed of 258 places in 288 ms of which 4 ms to minimize.
[2024-06-01 14:39:51] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 5 ms to minimize.
[2024-06-01 14:39:52] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 7 ms to minimize.
[2024-06-01 14:39:53] [INFO ] Deduced a trap composed of 284 places in 281 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1482 variables, and 64 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/531 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 266 places in 252 ms of which 4 ms to minimize.
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 267 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1482 variables, and 66 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/531 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 20/20 constraints]
After SMT, in 61308ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 61329ms
Starting structural reductions in LTL mode, iteration 1 : 531/536 places, 963/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107051 ms. Remains : 531/536 places, 963/968 transitions.
Support contains 366 out of 531 places after structural reductions.
[2024-06-01 14:40:36] [INFO ] Flatten gal took : 126 ms
[2024-06-01 14:40:36] [INFO ] Flatten gal took : 95 ms
[2024-06-01 14:40:36] [INFO ] Input system was already deterministic with 963 transitions.
Support contains 364 out of 531 places (down from 366) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 75 to 72
RANDOM walk for 40000 steps (14 resets) in 2203 ms. (18 steps per ms) remains 16/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
[2024-06-01 14:40:37] [INFO ] Flow matrix only has 951 transitions (discarded 12 similar events)
[2024-06-01 14:40:37] [INFO ] Invariant cache hit.
[2024-06-01 14:40:37] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 127/281 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 6 (OVERLAPS) 245/526 variables, 28/46 constraints. Problems are: Problem set: 8 solved, 8 unsolved
[2024-06-01 14:40:38] [INFO ] Deduced a trap composed of 72 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:40:38] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:40:38] [INFO ] Deduced a trap composed of 72 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:40:38] [INFO ] Deduced a trap composed of 73 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:40:39] [INFO ] Deduced a trap composed of 281 places in 283 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 5/51 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/51 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/527 variables, 1/52 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 0/52 constraints. Problems are: Problem set: 8 solved, 8 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp37 is UNSAT
At refinement iteration 11 (OVERLAPS) 4/531 variables, 3/55 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/55 constraints. Problems are: Problem set: 11 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1482/1482 variables, and 586 constraints, problems are : Problem set: 11 solved, 5 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 531/531 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 11 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 36/56 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 326/382 variables, 8/10 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/10 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 47/429 variables, 12/22 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/22 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 100/529 variables, 27/49 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 5/54 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-06-01 14:40:43] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 1/55 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-06-01 14:40:43] [INFO ] Deduced a trap composed of 229 places in 331 ms of which 4 ms to minimize.
[2024-06-01 14:40:43] [INFO ] Deduced a trap composed of 256 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:40:44] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 3/58 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 0/58 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 951/1480 variables, 529/587 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 72/659 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1480 variables, 5/664 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1480 variables, 0/664 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/1482 variables, 2/666 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1482 variables, 1/667 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1482 variables, 0/667 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1482 variables, 0/667 constraints. Problems are: Problem set: 11 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1482/1482 variables, and 667 constraints, problems are : Problem set: 11 solved, 5 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 531/531 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 5/16 constraints, Known Traps: 9/9 constraints]
After SMT, in 10156ms problems are : Problem set: 11 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5017 ms.
Support contains 20 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 529 transition count 931
Reduce places removed 32 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 38 rules applied. Total rules applied 72 place count 497 transition count 925
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 491 transition count 925
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 78 place count 491 transition count 865
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 198 place count 431 transition count 865
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 304 place count 378 transition count 812
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 316 place count 378 transition count 800
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 328 place count 366 transition count 800
Applied a total of 328 rules in 138 ms. Remains 366 /531 variables (removed 165) and now considering 800/963 (removed 163) transitions.
Running 798 sub problems to find dead transitions.
[2024-06-01 14:40:52] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
// Phase 1: matrix 788 rows 366 cols
[2024-06-01 14:40:52] [INFO ] Computed 48 invariants in 14 ms
[2024-06-01 14:40:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-06-01 14:40:58] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-06-01 14:40:58] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:40:58] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:40:58] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 2 ms to minimize.
[2024-06-01 14:40:58] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 2 ms to minimize.
[2024-06-01 14:40:59] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:40:59] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:40:59] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:40:59] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 4 ms to minimize.
[2024-06-01 14:41:00] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 3 ms to minimize.
[2024-06-01 14:41:00] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 2 ms to minimize.
[2024-06-01 14:41:00] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:41:02] [INFO ] Deduced a trap composed of 117 places in 189 ms of which 3 ms to minimize.
[2024-06-01 14:41:03] [INFO ] Deduced a trap composed of 210 places in 199 ms of which 3 ms to minimize.
[2024-06-01 14:41:04] [INFO ] Deduced a trap composed of 216 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:41:04] [INFO ] Deduced a trap composed of 195 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:41:04] [INFO ] Deduced a trap composed of 122 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:41:04] [INFO ] Deduced a trap composed of 114 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:41:05] [INFO ] Deduced a trap composed of 106 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:41:06] [INFO ] Deduced a trap composed of 149 places in 191 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 135 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:41:12] [INFO ] Deduced a trap composed of 152 places in 171 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.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 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 (/ 1.0 2.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 (/ 1.0 2.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 1.0)
(s49 0.0)
(s50 (/ 1.0 2.0))
(s51 (/ 1.0 2.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 (/ 1.0 4.0))
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 (/ 3.0 2.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 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 (/ 1.0 2.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 1.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 (/ 1.0 2.0))
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 5.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 1.0)
(s163 (/ 1.0 2.0))
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 (/ 3.0 2.0))
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 (/ 3.0 4.0))
(s173 (/ 1.0 2.0))
(s174 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1154 variables, and 68 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Problem TDEAD711 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/366 variables, 2/70 constraints. Problems are: Problem set: 66 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1154 variables, and 70 constraints, problems are : Problem set: 66 solved, 732 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 22/22 constraints]
After SMT, in 41250ms problems are : Problem set: 66 solved, 732 unsolved
Search for dead transitions found 66 dead transitions in 41259ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 366/531 places, 734/963 transitions.
Reduce places removed 0 places and 12 transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 0 places and 12 transitions.
Applied a total of 0 rules in 26 ms. Remains 366 /366 variables (removed 0) and now considering 710/734 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41427 ms. Remains : 366/531 places, 710/963 transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
[2024-06-01 14:41:34] [INFO ] Flatten gal took : 49 ms
[2024-06-01 14:41:34] [INFO ] Flatten gal took : 45 ms
[2024-06-01 14:41:34] [INFO ] Input system was already deterministic with 963 transitions.
FORMULA PolyORBLF-PT-S02J06T06-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 529 transition count 937
Reduce places removed 26 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 32 rules applied. Total rules applied 58 place count 503 transition count 931
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 497 transition count 931
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 64 place count 497 transition count 871
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 184 place count 437 transition count 871
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 242 place count 408 transition count 842
Applied a total of 242 rules in 61 ms. Remains 408 /531 variables (removed 123) and now considering 842/963 (removed 121) transitions.
Running 840 sub problems to find dead transitions.
[2024-06-01 14:41:34] [INFO ] Flow matrix only has 830 transitions (discarded 12 similar events)
// Phase 1: matrix 830 rows 408 cols
[2024-06-01 14:41:34] [INFO ] Computed 48 invariants in 30 ms
[2024-06-01 14:41:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-06-01 14:41:40] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:41:40] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 3 ms to minimize.
[2024-06-01 14:41:40] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:41:40] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:41:40] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:41:40] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:41:41] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:41:41] [INFO ] Deduced a trap composed of 144 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 79 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2024-06-01 14:41:43] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 3 ms to minimize.
[2024-06-01 14:41:43] [INFO ] Deduced a trap composed of 145 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:41:48] [INFO ] Deduced a trap composed of 174 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:41:49] [INFO ] Deduced a trap composed of 168 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:41:49] [INFO ] Deduced a trap composed of 190 places in 204 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1238 variables, and 62 constraints, problems are : Problem set: 0 solved, 840 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/408 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 840/840 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-06-01 14:42:02] [INFO ] Deduced a trap composed of 246 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:42:04] [INFO ] Deduced a trap composed of 127 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:42:07] [INFO ] Deduced a trap composed of 209 places in 204 ms of which 2 ms to minimize.
[2024-06-01 14:42:07] [INFO ] Deduced a trap composed of 209 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1238 variables, and 66 constraints, problems are : Problem set: 0 solved, 840 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/408 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/840 constraints, Known Traps: 20/20 constraints]
After SMT, in 41191ms problems are : Problem set: 0 solved, 840 unsolved
Search for dead transitions found 0 dead transitions in 41203ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41268 ms. Remains : 408/531 places, 842/963 transitions.
[2024-06-01 14:42:15] [INFO ] Flatten gal took : 36 ms
[2024-06-01 14:42:15] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:42:15] [INFO ] Input system was already deterministic with 842 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 529 transition count 932
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 498 transition count 931
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 497 transition count 931
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 64 place count 497 transition count 871
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 184 place count 437 transition count 871
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 290 place count 384 transition count 818
Applied a total of 290 rules in 56 ms. Remains 384 /531 variables (removed 147) and now considering 818/963 (removed 145) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 14:42:15] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 384 cols
[2024-06-01 14:42:15] [INFO ] Computed 48 invariants in 27 ms
[2024-06-01 14:42:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:42:21] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:42:21] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:42:21] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:42:21] [INFO ] Deduced a trap composed of 49 places in 27 ms of which 0 ms to minimize.
[2024-06-01 14:42:21] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 1 ms to minimize.
[2024-06-01 14:42:21] [INFO ] Deduced a trap composed of 49 places in 28 ms of which 1 ms to minimize.
[2024-06-01 14:42:22] [INFO ] Deduced a trap composed of 132 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:42:22] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:42:22] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 1 ms to minimize.
[2024-06-01 14:42:23] [INFO ] Deduced a trap composed of 69 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 151 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 163 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:42:28] [INFO ] Deduced a trap composed of 172 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:42:28] [INFO ] Deduced a trap composed of 155 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:42:29] [INFO ] Deduced a trap composed of 156 places in 224 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:42:33] [INFO ] Deduced a trap composed of 127 places in 157 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 9.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 1.0)
(s28 1.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 1.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 2.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1190 variables, and 62 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:42:45] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1190 variables, and 63 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 17/17 constraints]
After SMT, in 41206ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 41217ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41276 ms. Remains : 384/531 places, 818/963 transitions.
[2024-06-01 14:42:57] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:42:57] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:42:57] [INFO ] Input system was already deterministic with 818 transitions.
RANDOM walk for 193 steps (0 resets) in 6 ms. (27 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J06T06-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 529 transition count 963
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 523 transition count 957
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 523 transition count 957
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 522 transition count 956
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 522 transition count 956
Applied a total of 16 rules in 39 ms. Remains 522 /531 variables (removed 9) and now considering 956/963 (removed 7) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:42:57] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-06-01 14:42:57] [INFO ] Computed 48 invariants in 17 ms
[2024-06-01 14:42:57] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:43:04] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:43:04] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 246 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:43:06] [INFO ] Deduced a trap composed of 124 places in 234 ms of which 2 ms to minimize.
[2024-06-01 14:43:07] [INFO ] Deduced a trap composed of 346 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:43:09] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 3 ms to minimize.
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 4 ms to minimize.
[2024-06-01 14:43:11] [INFO ] Deduced a trap composed of 247 places in 255 ms of which 4 ms to minimize.
[2024-06-01 14:43:11] [INFO ] Deduced a trap composed of 272 places in 274 ms of which 4 ms to minimize.
[2024-06-01 14:43:14] [INFO ] Deduced a trap composed of 86 places in 260 ms of which 3 ms to minimize.
[2024-06-01 14:43:17] [INFO ] Deduced a trap composed of 304 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:43:17] [INFO ] Deduced a trap composed of 281 places in 203 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:43:32] [INFO ] Deduced a trap composed of 356 places in 270 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 67 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 21/21 constraints]
After SMT, in 40947ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40956ms
Finished structural reductions in LTL mode , in 1 iterations and 40997 ms. Remains : 522/531 places, 956/963 transitions.
[2024-06-01 14:43:38] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:43:38] [INFO ] Flatten gal took : 30 ms
[2024-06-01 14:43:38] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 525 transition count 957
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 525 transition count 957
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 524 transition count 956
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 524 transition count 956
Applied a total of 14 rules in 16 ms. Remains 524 /531 variables (removed 7) and now considering 956/963 (removed 7) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:43:38] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 524 cols
[2024-06-01 14:43:38] [INFO ] Computed 50 invariants in 29 ms
[2024-06-01 14:43:38] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:43:47] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:43:47] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:43:47] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:43:47] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:43:47] [INFO ] Deduced a trap composed of 246 places in 216 ms of which 3 ms to minimize.
[2024-06-01 14:43:47] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:43:47] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:43:48] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:43:48] [INFO ] Deduced a trap composed of 130 places in 274 ms of which 4 ms to minimize.
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:43:52] [INFO ] Deduced a trap composed of 255 places in 254 ms of which 4 ms to minimize.
[2024-06-01 14:43:55] [INFO ] Deduced a trap composed of 276 places in 281 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1468 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:44:06] [INFO ] Deduced a trap composed of 356 places in 289 ms of which 4 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 272 places in 258 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1468 variables, and 60 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 14/14 constraints]
After SMT, in 40967ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40978ms
Finished structural reductions in LTL mode , in 1 iterations and 40996 ms. Remains : 524/531 places, 956/963 transitions.
[2024-06-01 14:44:19] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:44:19] [INFO ] Flatten gal took : 30 ms
[2024-06-01 14:44:19] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 529 transition count 925
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 491 transition count 925
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 76 place count 491 transition count 865
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 196 place count 431 transition count 865
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 278 place count 390 transition count 824
Applied a total of 278 rules in 42 ms. Remains 390 /531 variables (removed 141) and now considering 824/963 (removed 139) transitions.
Running 822 sub problems to find dead transitions.
[2024-06-01 14:44:19] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 390 cols
[2024-06-01 14:44:19] [INFO ] Computed 48 invariants in 18 ms
[2024-06-01 14:44:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 14:44:25] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:44:25] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:44:25] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
[2024-06-01 14:44:25] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:44:25] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:44:25] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:44:26] [INFO ] Deduced a trap composed of 228 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:44:26] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:44:26] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 3 ms to minimize.
[2024-06-01 14:44:27] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:44:29] [INFO ] Deduced a trap composed of 142 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:44:29] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:44:29] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:44:31] [INFO ] Deduced a trap composed of 233 places in 213 ms of which 3 ms to minimize.
[2024-06-01 14:44:31] [INFO ] Deduced a trap composed of 236 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:44:32] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:44:32] [INFO ] Deduced a trap composed of 208 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:44:33] [INFO ] Deduced a trap composed of 155 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:44:33] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:44:33] [INFO ] Deduced a trap composed of 194 places in 189 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 14:44:36] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 3 ms to minimize.
[2024-06-01 14:44:37] [INFO ] Deduced a trap composed of 157 places in 224 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1202 variables, and 68 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 14:44:45] [INFO ] Deduced a trap composed of 144 places in 223 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 822 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 388/1202 variables, and 69 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 23/23 constraints]
After SMT, in 41003ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41010ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41054 ms. Remains : 390/531 places, 824/963 transitions.
[2024-06-01 14:45:00] [INFO ] Flatten gal took : 26 ms
[2024-06-01 14:45:00] [INFO ] Flatten gal took : 26 ms
[2024-06-01 14:45:00] [INFO ] Input system was already deterministic with 824 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 529 transition count 927
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 493 transition count 921
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 487 transition count 921
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 84 place count 487 transition count 860
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 206 place count 426 transition count 860
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 207 place count 425 transition count 859
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 425 transition count 859
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 290 place count 384 transition count 818
Applied a total of 290 rules in 52 ms. Remains 384 /531 variables (removed 147) and now considering 818/963 (removed 145) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 14:45:00] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 384 cols
[2024-06-01 14:45:00] [INFO ] Computed 48 invariants in 24 ms
[2024-06-01 14:45:00] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:45:06] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:45:06] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:45:06] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:45:06] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:45:07] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 3 ms to minimize.
[2024-06-01 14:45:07] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:45:07] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:45:07] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:45:08] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:45:17] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1190 variables, and 55 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:45:26] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:45:26] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:45:26] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:45:27] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/384 variables, 3/62 constraints. Problems are: Problem set: 66 solved, 750 unsolved
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 169 places in 249 ms of which 2 ms to minimize.
[2024-06-01 14:45:42] [INFO ] Deduced a trap composed of 156 places in 234 ms of which 3 ms to minimize.
SMT process timed out in 41347ms, After SMT, problems are : Problem set: 66 solved, 750 unsolved
Search for dead transitions found 66 dead transitions in 41356ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 384/531 places, 752/963 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 370 transition count 728
Applied a total of 12 rules in 19 ms. Remains 370 /384 variables (removed 14) and now considering 728/752 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41429 ms. Remains : 370/531 places, 728/963 transitions.
[2024-06-01 14:45:42] [INFO ] Flatten gal took : 22 ms
[2024-06-01 14:45:42] [INFO ] Flatten gal took : 24 ms
[2024-06-01 14:45:42] [INFO ] Input system was already deterministic with 728 transitions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 529 transition count 963
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 523 transition count 957
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 523 transition count 957
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 522 transition count 956
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 522 transition count 956
Applied a total of 16 rules in 16 ms. Remains 522 /531 variables (removed 9) and now considering 956/963 (removed 7) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:45:42] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-06-01 14:45:42] [INFO ] Computed 48 invariants in 20 ms
[2024-06-01 14:45:42] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:45:50] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:45:50] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
[2024-06-01 14:45:50] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:45:50] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:45:50] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 2 ms to minimize.
[2024-06-01 14:45:50] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:45:50] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:45:50] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:45:50] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:45:51] [INFO ] Deduced a trap composed of 246 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:45:51] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:45:52] [INFO ] Deduced a trap composed of 124 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:45:53] [INFO ] Deduced a trap composed of 346 places in 272 ms of which 4 ms to minimize.
[2024-06-01 14:45:54] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:45:55] [INFO ] Deduced a trap composed of 42 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:45:56] [INFO ] Deduced a trap composed of 247 places in 285 ms of which 5 ms to minimize.
[2024-06-01 14:45:57] [INFO ] Deduced a trap composed of 272 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:46:00] [INFO ] Deduced a trap composed of 86 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:46:01] [INFO ] Deduced a trap composed of 304 places in 251 ms of which 4 ms to minimize.
[2024-06-01 14:46:02] [INFO ] Deduced a trap composed of 281 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:46:17] [INFO ] Deduced a trap composed of 356 places in 217 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 67 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 21/21 constraints]
After SMT, in 40995ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41004ms
Finished structural reductions in LTL mode , in 1 iterations and 41022 ms. Remains : 522/531 places, 956/963 transitions.
[2024-06-01 14:46:23] [INFO ] Flatten gal took : 37 ms
[2024-06-01 14:46:23] [INFO ] Flatten gal took : 37 ms
[2024-06-01 14:46:23] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 531 transition count 950
Reduce places removed 13 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 20 rules applied. Total rules applied 33 place count 518 transition count 943
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 511 transition count 943
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 40 place count 511 transition count 883
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 160 place count 451 transition count 883
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 218 place count 422 transition count 854
Applied a total of 218 rules in 45 ms. Remains 422 /531 variables (removed 109) and now considering 854/963 (removed 109) transitions.
Running 852 sub problems to find dead transitions.
[2024-06-01 14:46:23] [INFO ] Flow matrix only has 842 transitions (discarded 12 similar events)
// Phase 1: matrix 842 rows 422 cols
[2024-06-01 14:46:23] [INFO ] Computed 50 invariants in 19 ms
[2024-06-01 14:46:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 54 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 150 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 2 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 74 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 106 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:46:32] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:46:32] [INFO ] Deduced a trap composed of 175 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:46:34] [INFO ] Deduced a trap composed of 173 places in 213 ms of which 2 ms to minimize.
[2024-06-01 14:46:35] [INFO ] Deduced a trap composed of 171 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:46:35] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:46:36] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:46:38] [INFO ] Deduced a trap composed of 173 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1264 variables, and 64 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/422 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-06-01 14:46:52] [INFO ] Deduced a trap composed of 126 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:46:54] [INFO ] Deduced a trap composed of 187 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:46:58] [INFO ] Deduced a trap composed of 264 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1264 variables, and 67 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/422 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/852 constraints, Known Traps: 21/21 constraints]
After SMT, in 41080ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 41092ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41139 ms. Remains : 422/531 places, 854/963 transitions.
[2024-06-01 14:47:04] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:47:04] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:47:04] [INFO ] Input system was already deterministic with 854 transitions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 529 transition count 963
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 524 transition count 958
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 524 transition count 958
Applied a total of 12 rules in 11 ms. Remains 524 /531 variables (removed 7) and now considering 958/963 (removed 5) transitions.
Running 956 sub problems to find dead transitions.
[2024-06-01 14:47:04] [INFO ] Flow matrix only has 946 transitions (discarded 12 similar events)
// Phase 1: matrix 946 rows 524 cols
[2024-06-01 14:47:04] [INFO ] Computed 48 invariants in 10 ms
[2024-06-01 14:47:04] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 14:47:12] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
[2024-06-01 14:47:12] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:47:12] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:47:12] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:47:12] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:47:12] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:47:13] [INFO ] Deduced a trap composed of 248 places in 233 ms of which 4 ms to minimize.
[2024-06-01 14:47:13] [INFO ] Deduced a trap composed of 71 places in 285 ms of which 4 ms to minimize.
[2024-06-01 14:47:13] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:47:14] [INFO ] Deduced a trap composed of 126 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:47:15] [INFO ] Deduced a trap composed of 352 places in 266 ms of which 4 ms to minimize.
[2024-06-01 14:47:15] [INFO ] Deduced a trap composed of 358 places in 240 ms of which 4 ms to minimize.
[2024-06-01 14:47:17] [INFO ] Deduced a trap composed of 88 places in 267 ms of which 4 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 250 places in 321 ms of which 4 ms to minimize.
[2024-06-01 14:47:19] [INFO ] Deduced a trap composed of 295 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:47:19] [INFO ] Deduced a trap composed of 273 places in 313 ms of which 7 ms to minimize.
[2024-06-01 14:47:20] [INFO ] Deduced a trap composed of 227 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:47:20] [INFO ] Deduced a trap composed of 279 places in 221 ms of which 4 ms to minimize.
[2024-06-01 14:47:23] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:47:24] [INFO ] Deduced a trap composed of 249 places in 263 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/1470 variables, and 66 constraints, problems are : Problem set: 0 solved, 956 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 956/956 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 956 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 14:47:36] [INFO ] Deduced a trap composed of 264 places in 283 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/1470 variables, and 67 constraints, problems are : Problem set: 0 solved, 956 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/956 constraints, Known Traps: 21/21 constraints]
After SMT, in 41018ms problems are : Problem set: 0 solved, 956 unsolved
Search for dead transitions found 0 dead transitions in 41028ms
Finished structural reductions in LTL mode , in 1 iterations and 41041 ms. Remains : 524/531 places, 958/963 transitions.
[2024-06-01 14:47:45] [INFO ] Flatten gal took : 25 ms
[2024-06-01 14:47:45] [INFO ] Flatten gal took : 25 ms
[2024-06-01 14:47:45] [INFO ] Input system was already deterministic with 958 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 529 transition count 925
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 491 transition count 925
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 76 place count 491 transition count 865
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 196 place count 431 transition count 865
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 302 place count 378 transition count 812
Applied a total of 302 rules in 34 ms. Remains 378 /531 variables (removed 153) and now considering 812/963 (removed 151) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:47:45] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 378 cols
[2024-06-01 14:47:45] [INFO ] Computed 48 invariants in 15 ms
[2024-06-01 14:47:45] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:47:50] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 1 ms to minimize.
[2024-06-01 14:47:50] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:47:51] [INFO ] Deduced a trap composed of 132 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:47:52] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 4 ms to minimize.
[2024-06-01 14:47:52] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:47:52] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:47:55] [INFO ] Deduced a trap composed of 126 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:47:56] [INFO ] Deduced a trap composed of 94 places in 168 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 20930ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 20937ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 20974 ms. Remains : 378/531 places, 812/963 transitions.
[2024-06-01 14:48:06] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:48:06] [INFO ] Flatten gal took : 47 ms
[2024-06-01 14:48:06] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 529 transition count 963
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 523 transition count 957
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 523 transition count 957
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 522 transition count 956
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 522 transition count 956
Applied a total of 16 rules in 24 ms. Remains 522 /531 variables (removed 9) and now considering 956/963 (removed 7) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:48:07] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-06-01 14:48:07] [INFO ] Computed 48 invariants in 27 ms
[2024-06-01 14:48:07] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:48:14] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 3 ms to minimize.
[2024-06-01 14:48:14] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:48:14] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-06-01 14:48:15] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:48:15] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:48:15] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:48:15] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:48:15] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:48:15] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:48:15] [INFO ] Deduced a trap composed of 246 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:48:15] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:48:16] [INFO ] Deduced a trap composed of 124 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:48:17] [INFO ] Deduced a trap composed of 346 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:48:19] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:48:20] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 4 ms to minimize.
[2024-06-01 14:48:21] [INFO ] Deduced a trap composed of 247 places in 267 ms of which 4 ms to minimize.
[2024-06-01 14:48:21] [INFO ] Deduced a trap composed of 272 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:48:25] [INFO ] Deduced a trap composed of 86 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:48:27] [INFO ] Deduced a trap composed of 304 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:48:27] [INFO ] Deduced a trap composed of 281 places in 196 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:48:43] [INFO ] Deduced a trap composed of 356 places in 239 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 67 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 21/21 constraints]
After SMT, in 40923ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40934ms
Finished structural reductions in LTL mode , in 1 iterations and 40961 ms. Remains : 522/531 places, 956/963 transitions.
[2024-06-01 14:48:47] [INFO ] Flatten gal took : 24 ms
[2024-06-01 14:48:48] [INFO ] Flatten gal took : 25 ms
[2024-06-01 14:48:48] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 529 transition count 963
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 525 transition count 959
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 525 transition count 959
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 524 transition count 958
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 524 transition count 958
Applied a total of 12 rules in 18 ms. Remains 524 /531 variables (removed 7) and now considering 958/963 (removed 5) transitions.
Running 956 sub problems to find dead transitions.
[2024-06-01 14:48:48] [INFO ] Flow matrix only has 946 transitions (discarded 12 similar events)
// Phase 1: matrix 946 rows 524 cols
[2024-06-01 14:48:48] [INFO ] Computed 48 invariants in 10 ms
[2024-06-01 14:48:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 14:48:56] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:48:56] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-06-01 14:48:56] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:48:56] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:48:56] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:48:56] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:48:56] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:48:57] [INFO ] Deduced a trap composed of 248 places in 245 ms of which 4 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 123 places in 282 ms of which 4 ms to minimize.
[2024-06-01 14:48:59] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:49:01] [INFO ] Deduced a trap composed of 264 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:49:02] [INFO ] Deduced a trap composed of 254 places in 286 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/1470 variables, and 58 constraints, problems are : Problem set: 0 solved, 956 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 956/956 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 956 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 956 unsolved
[2024-06-01 14:49:18] [INFO ] Deduced a trap composed of 350 places in 274 ms of which 4 ms to minimize.
[2024-06-01 14:49:27] [INFO ] Deduced a trap composed of 226 places in 179 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/1470 variables, and 60 constraints, problems are : Problem set: 0 solved, 956 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/956 constraints, Known Traps: 14/14 constraints]
After SMT, in 41194ms problems are : Problem set: 0 solved, 956 unsolved
Search for dead transitions found 0 dead transitions in 41206ms
Finished structural reductions in LTL mode , in 1 iterations and 41227 ms. Remains : 524/531 places, 958/963 transitions.
[2024-06-01 14:49:29] [INFO ] Flatten gal took : 46 ms
[2024-06-01 14:49:29] [INFO ] Flatten gal took : 41 ms
[2024-06-01 14:49:29] [INFO ] Input system was already deterministic with 958 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 529 transition count 926
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 492 transition count 926
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 74 place count 492 transition count 868
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 190 place count 434 transition count 868
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 288 place count 385 transition count 819
Applied a total of 288 rules in 70 ms. Remains 385 /531 variables (removed 146) and now considering 819/963 (removed 144) transitions.
Running 817 sub problems to find dead transitions.
[2024-06-01 14:49:29] [INFO ] Flow matrix only has 807 transitions (discarded 12 similar events)
// Phase 1: matrix 807 rows 385 cols
[2024-06-01 14:49:29] [INFO ] Computed 48 invariants in 11 ms
[2024-06-01 14:49:29] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 817 unsolved
[2024-06-01 14:49:34] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 132 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 154 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:49:36] [INFO ] Deduced a trap composed of 146 places in 204 ms of which 4 ms to minimize.
[2024-06-01 14:49:36] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:49:37] [INFO ] Deduced a trap composed of 67 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:49:41] [INFO ] Deduced a trap composed of 160 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:49:41] [INFO ] Deduced a trap composed of 124 places in 207 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 817 unsolved
[2024-06-01 14:49:49] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1192 variables, and 61 constraints, problems are : Problem set: 0 solved, 817 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/385 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 817 unsolved
[2024-06-01 14:50:00] [INFO ] Deduced a trap composed of 229 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:50:00] [INFO ] Deduced a trap composed of 216 places in 203 ms of which 2 ms to minimize.
[2024-06-01 14:50:01] [INFO ] Deduced a trap composed of 215 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:50:01] [INFO ] Deduced a trap composed of 152 places in 228 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/1192 variables, and 65 constraints, problems are : Problem set: 0 solved, 817 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/385 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 19/19 constraints]
After SMT, in 41223ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 41236ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41309 ms. Remains : 385/531 places, 819/963 transitions.
[2024-06-01 14:50:10] [INFO ] Flatten gal took : 24 ms
[2024-06-01 14:50:10] [INFO ] Flatten gal took : 26 ms
[2024-06-01 14:50:10] [INFO ] Input system was already deterministic with 819 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 529 transition count 919
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 485 transition count 919
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 88 place count 485 transition count 859
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 208 place count 425 transition count 859
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 314 place count 372 transition count 806
Applied a total of 314 rules in 34 ms. Remains 372 /531 variables (removed 159) and now considering 806/963 (removed 157) transitions.
Running 804 sub problems to find dead transitions.
[2024-06-01 14:50:10] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 372 cols
[2024-06-01 14:50:10] [INFO ] Computed 48 invariants in 20 ms
[2024-06-01 14:50:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 120 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:50:17] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:50:20] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:50:22] [INFO ] Deduced a trap composed of 103 places in 151 ms of which 4 ms to minimize.
[2024-06-01 14:50:22] [INFO ] Deduced a trap composed of 198 places in 180 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 804 unsolved
SMT process timed out in 20965ms, After SMT, problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 20974ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 21010 ms. Remains : 372/531 places, 806/963 transitions.
[2024-06-01 14:50:31] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:50:31] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:50:32] [INFO ] Input system was already deterministic with 806 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 531/531 places, 963/963 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 529 transition count 919
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 485 transition count 919
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 88 place count 485 transition count 859
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 208 place count 425 transition count 859
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 310 place count 374 transition count 808
Applied a total of 310 rules in 34 ms. Remains 374 /531 variables (removed 157) and now considering 808/963 (removed 155) transitions.
Running 806 sub problems to find dead transitions.
[2024-06-01 14:50:32] [INFO ] Flow matrix only has 796 transitions (discarded 12 similar events)
// Phase 1: matrix 796 rows 374 cols
[2024-06-01 14:50:32] [INFO ] Computed 48 invariants in 12 ms
[2024-06-01 14:50:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:50:38] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-06-01 14:50:38] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/374 variables, 7/52 constraints. Problems are: Problem set: 66 solved, 740 unsolved
[2024-06-01 14:50:50] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 129 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 (/ 29.0 4.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 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.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 1.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 (/ 3.0 4.0))
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 (/ 1.0 4.0))
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/1170 variables, and 61 constraints, problems are : Problem set: 66 solved, 740 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/374 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 806/806 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 66 solved, 740 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 16/16 constraints. Problems are: Problem set: 66 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 25/41 constraints. Problems are: Problem set: 66 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 13/54 constraints. Problems are: Problem set: 66 solved, 740 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 0/54 constraints. Problems are: Problem set: 66 solved, 740 unsolved
At refinement iteration 4 (OVERLAPS) 2/374 variables, 7/61 constraints. Problems are: Problem set: 66 solved, 740 unsolved
[2024-06-01 14:51:07] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:51:08] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 61 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:51:13] [INFO ] Deduced a trap composed of 116 places in 223 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/1170 variables, and 65 constraints, problems are : Problem set: 66 solved, 740 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/374 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/806 constraints, Known Traps: 17/17 constraints]
After SMT, in 40994ms problems are : Problem set: 66 solved, 740 unsolved
Search for dead transitions found 66 dead transitions in 41004ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 374/531 places, 742/963 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 360 transition count 718
Applied a total of 12 rules in 24 ms. Remains 360 /374 variables (removed 14) and now considering 718/742 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41064 ms. Remains : 360/531 places, 718/963 transitions.
[2024-06-01 14:51:13] [INFO ] Flatten gal took : 33 ms
[2024-06-01 14:51:13] [INFO ] Flatten gal took : 31 ms
[2024-06-01 14:51:13] [INFO ] Input system was already deterministic with 718 transitions.
[2024-06-01 14:51:13] [INFO ] Flatten gal took : 40 ms
[2024-06-01 14:51:13] [INFO ] Flatten gal took : 43 ms
[2024-06-01 14:51:13] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 11 ms.
[2024-06-01 14:51:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 531 places, 963 transitions and 4184 arcs took 8 ms.
Total runtime 745033 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLFireability-2024-14
BK_STOP 1717253473862
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1698/ctl_0_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1698/ctl_1_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1698/ctl_2_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1698/ctl_3_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1698/ctl_4_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1698/ctl_5_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1698/ctl_6_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1698/ctl_7_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1698/ctl_8_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1698/ctl_9_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1698/ctl_10_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1698/ctl_11_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1698/ctl_12_
ctl formula name PolyORBLF-PT-S02J06T06-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1698/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J06T06"
export BK_EXAMINATION="CTLFireability"
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 PolyORBLF-PT-S02J06T06, examination is CTLFireability"
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-171654446700242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T06.tgz
mv PolyORBLF-PT-S02J06T06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;