fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446500180
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-COL-S06J04T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16203.523 3600000.00 9770975.00 1639.20 FFFFFFF?FFTT?FFF 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.r290-tajo-171654446500180.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S06J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446500180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 16:51 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 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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-COL-S06J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716910681449

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 15:38:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:38:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:38:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 15:38:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:38:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 698 ms
[2024-05-28 15:38:03] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 632 PT places and 10560.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 15:38:03] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 8 ms.
[2024-05-28 15:38:04] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40006 steps (3874 resets) in 1265 ms. (31 steps per ms) remains 13/24 properties
BEST_FIRST walk for 40003 steps (111 resets) in 301 ms. (132 steps per ms) remains 1/13 properties
BEST_FIRST walk for 4971 steps (26 resets) in 38 ms. (127 steps per ms) remains 0/1 properties
[2024-05-28 15:38:04] [INFO ] Flatten gal took : 39 ms
[2024-05-28 15:38:04] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2024-05-28 15:38:04] [INFO ] Unfolded HLPN to a Petri net with 632 places and 10500 transitions 88770 arcs in 214 ms.
[2024-05-28 15:38:04] [INFO ] Unfolded 13 HLPN properties in 2 ms.
[2024-05-28 15:38:04] [INFO ] Reduced 7020 identical enabling conditions.
[2024-05-28 15:38:04] [INFO ] Reduced 960 identical enabling conditions.
[2024-05-28 15:38:04] [INFO ] Reduced 960 identical enabling conditions.
[2024-05-28 15:38:04] [INFO ] Reduced 960 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 318 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 626 transition count 2424
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 626 transition count 2424
Applied a total of 12 rules in 97 ms. Remains 626 /632 variables (removed 6) and now considering 2424/2430 (removed 6) transitions.
Running 2418 sub problems to find dead transitions.
[2024-05-28 15:38:05] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
// Phase 1: matrix 2388 rows 626 cols
[2024-05-28 15:38:05] [INFO ] Computed 54 invariants in 183 ms
[2024-05-28 15:38:05] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 10.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.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 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 4.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 0.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 2.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 0.0)
(s606 1.0)
(s607 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2418 unsolved
SMT process timed out in 42341ms, After SMT, problems are : Problem set: 0 solved, 2418 unsolved
Search for dead transitions found 0 dead transitions in 42396ms
[2024-05-28 15:38:47] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
[2024-05-28 15:38:47] [INFO ] Invariant cache hit.
[2024-05-28 15:38:48] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-28 15:38:48] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
[2024-05-28 15:38:48] [INFO ] Invariant cache hit.
[2024-05-28 15:38:49] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:38:56] [INFO ] Implicit Places using invariants and state equation in 7885 ms returned []
Implicit Place search using SMT with State Equation took 8572 ms to find 0 implicit places.
Running 2418 sub problems to find dead transitions.
[2024-05-28 15:38:56] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
[2024-05-28 15:38:56] [INFO ] Invariant cache hit.
[2024-05-28 15:38:56] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 2418 unsolved
[2024-05-28 15:39:37] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 16 ms to minimize.
[2024-05-28 15:39:37] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 1 ms to minimize.
[2024-05-28 15:39:37] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:39:37] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 1 ms to minimize.
[2024-05-28 15:39:38] [INFO ] Deduced a trap composed of 84 places in 390 ms of which 1 ms to minimize.
[2024-05-28 15:39:38] [INFO ] Deduced a trap composed of 366 places in 405 ms of which 4 ms to minimize.
[2024-05-28 15:39:39] [INFO ] Deduced a trap composed of 360 places in 401 ms of which 5 ms to minimize.
[2024-05-28 15:39:39] [INFO ] Deduced a trap composed of 379 places in 375 ms of which 4 ms to minimize.
[2024-05-28 15:39:40] [INFO ] Deduced a trap composed of 334 places in 524 ms of which 3 ms to minimize.
[2024-05-28 15:39:40] [INFO ] Deduced a trap composed of 157 places in 556 ms of which 3 ms to minimize.
[2024-05-28 15:39:44] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 1 ms to minimize.
[2024-05-28 15:39:45] [INFO ] Deduced a trap composed of 397 places in 727 ms of which 6 ms to minimize.
[2024-05-28 15:39:46] [INFO ] Deduced a trap composed of 345 places in 575 ms of which 4 ms to minimize.
[2024-05-28 15:39:46] [INFO ] Deduced a trap composed of 367 places in 474 ms of which 4 ms to minimize.
[2024-05-28 15:39:46] [INFO ] Deduced a trap composed of 327 places in 427 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/3014 variables, and 57 constraints, problems are : Problem set: 0 solved, 2418 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 13/21 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/626 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2418/1164 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 2418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 2418 unsolved
[2024-05-28 15:39:51] [INFO ] Deduced a trap composed of 319 places in 513 ms of which 4 ms to minimize.
[2024-05-28 15:40:02] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/3014 variables, and 59 constraints, problems are : Problem set: 0 solved, 2418 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 13/21 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/626 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1164 constraints, Known Traps: 17/17 constraints]
After SMT, in 81016ms problems are : Problem set: 0 solved, 2418 unsolved
Search for dead transitions found 0 dead transitions in 81062ms
Starting structural reductions in LTL mode, iteration 1 : 626/632 places, 2424/2430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132186 ms. Remains : 626/632 places, 2424/2430 transitions.
Support contains 318 out of 626 places after structural reductions.
[2024-05-28 15:40:17] [INFO ] Flatten gal took : 398 ms
[2024-05-28 15:40:18] [INFO ] Flatten gal took : 346 ms
[2024-05-28 15:40:19] [INFO ] Input system was already deterministic with 2424 transitions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 4271 steps (17 resets) in 226 ms. (18 steps per ms) remains 0/26 properties
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 18 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 2424/2424 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 620 transition count 2382
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 578 transition count 2382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 578 transition count 2310
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 506 transition count 2310
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 372 place count 434 transition count 2238
Applied a total of 372 rules in 273 ms. Remains 434 /626 variables (removed 192) and now considering 2238/2424 (removed 186) transitions.
Running 2232 sub problems to find dead transitions.
[2024-05-28 15:40:20] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
// Phase 1: matrix 2202 rows 434 cols
[2024-05-28 15:40:20] [INFO ] Computed 48 invariants in 53 ms
[2024-05-28 15:40:20] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 15:40:57] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 1 ms to minimize.
[2024-05-28 15:40:57] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:40:57] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:40:57] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:40:57] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
[2024-05-28 15:40:57] [INFO ] Deduced a trap composed of 178 places in 322 ms of which 2 ms to minimize.
[2024-05-28 15:40:58] [INFO ] Deduced a trap composed of 212 places in 388 ms of which 3 ms to minimize.
[2024-05-28 15:40:58] [INFO ] Deduced a trap composed of 211 places in 391 ms of which 3 ms to minimize.
[2024-05-28 15:40:59] [INFO ] Deduced a trap composed of 184 places in 368 ms of which 2 ms to minimize.
[2024-05-28 15:41:00] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:41:01] [INFO ] Deduced a trap composed of 179 places in 457 ms of which 3 ms to minimize.
[2024-05-28 15:41:01] [INFO ] Deduced a trap composed of 146 places in 390 ms of which 3 ms to minimize.
[2024-05-28 15:41:02] [INFO ] Deduced a trap composed of 197 places in 379 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/2636 variables, and 55 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2024-05-28 15:41:08] [INFO ] Deduced a trap composed of 72 places in 294 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/2636 variables, and 57 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 15/15 constraints]
After SMT, in 64806ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 64832ms
[2024-05-28 15:41:24] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-05-28 15:41:24] [INFO ] Invariant cache hit.
[2024-05-28 15:41:25] [INFO ] Implicit Places using invariants in 419 ms returned [370, 371, 372, 373, 374, 375]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 440 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 428/626 places, 2238/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 422 transition count 2232
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 422 transition count 2232
Applied a total of 12 rules in 63 ms. Remains 422 /428 variables (removed 6) and now considering 2232/2238 (removed 6) transitions.
[2024-05-28 15:41:25] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
// Phase 1: matrix 2196 rows 422 cols
[2024-05-28 15:41:25] [INFO ] Computed 42 invariants in 48 ms
[2024-05-28 15:41:25] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-05-28 15:41:25] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:41:25] [INFO ] Invariant cache hit.
[2024-05-28 15:41:26] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:41:32] [INFO ] Implicit Places using invariants and state equation in 6576 ms returned []
Implicit Place search using SMT with State Equation took 7232 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 422/626 places, 2232/2424 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72846 ms. Remains : 422/626 places, 2232/2424 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-00
Stuttering criterion allowed to conclude after 90 steps with 3 reset in 6 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-00 finished in 73131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 50 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 2424/2424 transitions.
Ensure Unique test removed 6 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 620 transition count 2388
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 584 transition count 2388
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 72 place count 584 transition count 2352
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 144 place count 548 transition count 2352
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 300 place count 470 transition count 2274
Applied a total of 300 rules in 163 ms. Remains 470 /626 variables (removed 156) and now considering 2274/2424 (removed 150) transitions.
Running 2268 sub problems to find dead transitions.
[2024-05-28 15:41:33] [INFO ] Flow matrix only has 2238 transitions (discarded 36 similar events)
// Phase 1: matrix 2238 rows 470 cols
[2024-05-28 15:41:33] [INFO ] Computed 48 invariants in 34 ms
[2024-05-28 15:41:33] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 2268 unsolved
[2024-05-28 15:42:08] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 1 ms to minimize.
[2024-05-28 15:42:08] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:42:08] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 4 ms to minimize.
[2024-05-28 15:42:08] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 0 ms to minimize.
[2024-05-28 15:42:08] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:42:10] [INFO ] Deduced a trap composed of 232 places in 639 ms of which 4 ms to minimize.
[2024-05-28 15:42:10] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:42:11] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2708 variables, and 50 constraints, problems are : Problem set: 0 solved, 2268 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2268/1014 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 2268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 2268 unsolved
[2024-05-28 15:42:24] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2708 variables, and 51 constraints, problems are : Problem set: 0 solved, 2268 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1014 constraints, Known Traps: 9/9 constraints]
After SMT, in 60531ms problems are : Problem set: 0 solved, 2268 unsolved
Search for dead transitions found 0 dead transitions in 60560ms
[2024-05-28 15:42:33] [INFO ] Flow matrix only has 2238 transitions (discarded 36 similar events)
[2024-05-28 15:42:33] [INFO ] Invariant cache hit.
[2024-05-28 15:42:33] [INFO ] Implicit Places using invariants in 281 ms returned [406, 407, 408, 409, 410, 411]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 288 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 464/626 places, 2274/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 458 transition count 2268
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 458 transition count 2268
Applied a total of 12 rules in 56 ms. Remains 458 /464 variables (removed 6) and now considering 2268/2274 (removed 6) transitions.
[2024-05-28 15:42:33] [INFO ] Flow matrix only has 2232 transitions (discarded 36 similar events)
// Phase 1: matrix 2232 rows 458 cols
[2024-05-28 15:42:33] [INFO ] Computed 42 invariants in 37 ms
[2024-05-28 15:42:34] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-05-28 15:42:34] [INFO ] Flow matrix only has 2232 transitions (discarded 36 similar events)
[2024-05-28 15:42:34] [INFO ] Invariant cache hit.
[2024-05-28 15:42:35] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:42:43] [INFO ] Implicit Places using invariants and state equation in 9221 ms returned []
Implicit Place search using SMT with State Equation took 9755 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 458/626 places, 2268/2424 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 70828 ms. Remains : 458/626 places, 2268/2424 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-01
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-01 finished in 70994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X((G(p1) U (!p0&&G(p1))))) U p2))'
Support contains 56 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 2424/2424 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 614 transition count 2418
Applied a total of 18 rules in 68 ms. Remains 614 /626 variables (removed 12) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 15:42:43] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-05-28 15:42:43] [INFO ] Computed 48 invariants in 57 ms
[2024-05-28 15:42:44] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 15:43:24] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:43:24] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2024-05-28 15:43:24] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:43:24] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:43:24] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:43:25] [INFO ] Deduced a trap composed of 163 places in 396 ms of which 3 ms to minimize.
[2024-05-28 15:43:25] [INFO ] Deduced a trap composed of 175 places in 340 ms of which 3 ms to minimize.
[2024-05-28 15:43:26] [INFO ] Deduced a trap composed of 157 places in 529 ms of which 5 ms to minimize.
SMT process timed out in 42596ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 42635ms
[2024-05-28 15:43:26] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:43:26] [INFO ] Invariant cache hit.
[2024-05-28 15:43:27] [INFO ] Implicit Places using invariants in 563 ms returned [490, 491, 492, 493, 494, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 586 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 608/626 places, 2418/2424 transitions.
Applied a total of 0 rules in 90 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43400 ms. Remains : 608/626 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-02
Stuttering criterion allowed to conclude after 111 steps with 1 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-02 finished in 43554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 20 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 2424/2424 transitions.
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 626 transition count 2388
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 590 transition count 2388
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 72 place count 590 transition count 2316
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 216 place count 518 transition count 2316
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 288 place count 482 transition count 2280
Applied a total of 288 rules in 79 ms. Remains 482 /626 variables (removed 144) and now considering 2280/2424 (removed 144) transitions.
Running 2274 sub problems to find dead transitions.
[2024-05-28 15:43:27] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
// Phase 1: matrix 2244 rows 482 cols
[2024-05-28 15:43:27] [INFO ] Computed 54 invariants in 140 ms
[2024-05-28 15:43:27] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-05-28 15:44:03] [INFO ] Deduced a trap composed of 61 places in 431 ms of which 3 ms to minimize.
[2024-05-28 15:44:03] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 4 ms to minimize.
[2024-05-28 15:44:03] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 2 ms to minimize.
[2024-05-28 15:44:03] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:44:03] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:44:03] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:44:04] [INFO ] Deduced a trap composed of 199 places in 498 ms of which 4 ms to minimize.
[2024-05-28 15:44:05] [INFO ] Deduced a trap composed of 232 places in 605 ms of which 15 ms to minimize.
[2024-05-28 15:44:07] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/2726 variables, and 51 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/22 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/482 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2274/1020 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-05-28 15:44:10] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 3 ms to minimize.
[2024-05-28 15:44:13] [INFO ] Deduced a trap composed of 226 places in 492 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/2726 variables, and 53 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/22 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/482 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1020 constraints, Known Traps: 11/11 constraints]
After SMT, in 59868ms problems are : Problem set: 0 solved, 2274 unsolved
Search for dead transitions found 0 dead transitions in 59891ms
[2024-05-28 15:44:27] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
[2024-05-28 15:44:27] [INFO ] Invariant cache hit.
[2024-05-28 15:44:27] [INFO ] Implicit Places using invariants in 668 ms returned [418, 419, 420, 421, 422, 423]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 677 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 476/626 places, 2280/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 470 transition count 2274
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 470 transition count 2274
Applied a total of 12 rules in 71 ms. Remains 470 /476 variables (removed 6) and now considering 2274/2280 (removed 6) transitions.
[2024-05-28 15:44:28] [INFO ] Flow matrix only has 2238 transitions (discarded 36 similar events)
// Phase 1: matrix 2238 rows 470 cols
[2024-05-28 15:44:28] [INFO ] Computed 48 invariants in 93 ms
[2024-05-28 15:44:28] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-05-28 15:44:28] [INFO ] Flow matrix only has 2238 transitions (discarded 36 similar events)
[2024-05-28 15:44:28] [INFO ] Invariant cache hit.
[2024-05-28 15:44:29] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:44:37] [INFO ] Implicit Places using invariants and state equation in 8901 ms returned []
Implicit Place search using SMT with State Equation took 9597 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 470/626 places, 2274/2424 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 70323 ms. Remains : 470/626 places, 2274/2424 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-05 finished in 70480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 20 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 2424/2424 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 614 transition count 2418
Applied a total of 18 rules in 43 ms. Remains 614 /626 variables (removed 12) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 15:44:37] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-05-28 15:44:37] [INFO ] Computed 48 invariants in 52 ms
[2024-05-28 15:44:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 15:45:17] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 2 ms to minimize.
[2024-05-28 15:45:17] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:45:17] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:45:17] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:45:17] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:45:18] [INFO ] Deduced a trap composed of 163 places in 364 ms of which 4 ms to minimize.
SMT process timed out in 40198ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 40227ms
[2024-05-28 15:45:18] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:45:18] [INFO ] Invariant cache hit.
[2024-05-28 15:45:18] [INFO ] Implicit Places using invariants in 521 ms returned [490, 491, 492, 493, 494, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 530 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 608/626 places, 2418/2424 transitions.
Applied a total of 0 rules in 17 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40825 ms. Remains : 608/626 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 82 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-06 finished in 41009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 12 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 2424/2424 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 614 transition count 2418
Applied a total of 18 rules in 29 ms. Remains 614 /626 variables (removed 12) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 15:45:18] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:45:18] [INFO ] Invariant cache hit.
[2024-05-28 15:45:18] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 1 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 365 places in 567 ms of which 5 ms to minimize.
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 170 places in 586 ms of which 5 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 50 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 15:46:02] [INFO ] Deduced a trap composed of 302 places in 566 ms of which 7 ms to minimize.
[2024-05-28 15:46:05] [INFO ] Deduced a trap composed of 364 places in 530 ms of which 4 ms to minimize.
[2024-05-28 15:46:06] [INFO ] Deduced a trap composed of 347 places in 495 ms of which 3 ms to minimize.
[2024-05-28 15:46:06] [INFO ] Deduced a trap composed of 15 places in 472 ms of which 3 ms to minimize.
[2024-05-28 15:46:07] [INFO ] Deduced a trap composed of 361 places in 602 ms of which 5 ms to minimize.
[2024-05-28 15:46:15] [INFO ] Deduced a trap composed of 63 places in 409 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 56 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 14/14 constraints]
After SMT, in 59875ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 59898ms
[2024-05-28 15:46:18] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:46:18] [INFO ] Invariant cache hit.
[2024-05-28 15:46:19] [INFO ] Implicit Places using invariants in 667 ms returned [490, 491, 492, 493, 494, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 686 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 608/626 places, 2418/2424 transitions.
Applied a total of 0 rules in 14 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60632 ms. Remains : 608/626 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-07
Product exploration explored 100000 steps with 1627 reset in 733 ms.
Product exploration explored 100000 steps with 1611 reset in 562 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 67 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 533 steps (3 resets) in 13 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Support contains 6 out of 608 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 608 transition count 2388
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 578 transition count 2382
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 572 transition count 2382
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 72 place count 572 transition count 2316
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 204 place count 506 transition count 2316
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 336 place count 440 transition count 2250
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 342 place count 434 transition count 2244
Iterating global reduction 3 with 6 rules applied. Total rules applied 348 place count 434 transition count 2244
Applied a total of 348 rules in 183 ms. Remains 434 /608 variables (removed 174) and now considering 2244/2418 (removed 174) transitions.
Running 2238 sub problems to find dead transitions.
[2024-05-28 15:46:21] [INFO ] Flow matrix only has 2208 transitions (discarded 36 similar events)
// Phase 1: matrix 2208 rows 434 cols
[2024-05-28 15:46:21] [INFO ] Computed 42 invariants in 84 ms
[2024-05-28 15:46:21] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
[2024-05-28 15:46:57] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 2 ms to minimize.
[2024-05-28 15:46:57] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 1 ms to minimize.
[2024-05-28 15:46:57] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:46:57] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 0 ms to minimize.
[2024-05-28 15:46:57] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:46:58] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:46:58] [INFO ] Deduced a trap composed of 239 places in 553 ms of which 3 ms to minimize.
[2024-05-28 15:46:59] [INFO ] Deduced a trap composed of 239 places in 516 ms of which 3 ms to minimize.
[2024-05-28 15:46:59] [INFO ] Deduced a trap composed of 230 places in 491 ms of which 4 ms to minimize.
[2024-05-28 15:47:00] [INFO ] Deduced a trap composed of 204 places in 441 ms of which 3 ms to minimize.
[2024-05-28 15:47:00] [INFO ] Deduced a trap composed of 225 places in 451 ms of which 3 ms to minimize.
[2024-05-28 15:47:01] [INFO ] Deduced a trap composed of 199 places in 424 ms of which 3 ms to minimize.
[2024-05-28 15:47:01] [INFO ] Deduced a trap composed of 200 places in 397 ms of which 2 ms to minimize.
[2024-05-28 15:47:02] [INFO ] Deduced a trap composed of 205 places in 367 ms of which 3 ms to minimize.
[2024-05-28 15:47:02] [INFO ] Deduced a trap composed of 200 places in 421 ms of which 3 ms to minimize.
[2024-05-28 15:47:03] [INFO ] Deduced a trap composed of 48 places in 342 ms of which 2 ms to minimize.
[2024-05-28 15:47:04] [INFO ] Deduced a trap composed of 189 places in 627 ms of which 4 ms to minimize.
SMT process timed out in 42353ms, After SMT, problems are : Problem set: 0 solved, 2238 unsolved
Search for dead transitions found 0 dead transitions in 42388ms
[2024-05-28 15:47:04] [INFO ] Flow matrix only has 2208 transitions (discarded 36 similar events)
[2024-05-28 15:47:04] [INFO ] Invariant cache hit.
[2024-05-28 15:47:04] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-28 15:47:04] [INFO ] Flow matrix only has 2208 transitions (discarded 36 similar events)
[2024-05-28 15:47:04] [INFO ] Invariant cache hit.
[2024-05-28 15:47:05] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:47:11] [INFO ] Implicit Places using invariants and state equation in 6889 ms returned []
Implicit Place search using SMT with State Equation took 7511 ms to find 0 implicit places.
[2024-05-28 15:47:11] [INFO ] Redundant transitions in 115 ms returned []
Running 2238 sub problems to find dead transitions.
[2024-05-28 15:47:11] [INFO ] Flow matrix only has 2208 transitions (discarded 36 similar events)
[2024-05-28 15:47:11] [INFO ] Invariant cache hit.
[2024-05-28 15:47:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 2 ms to minimize.
[2024-05-28 15:47:52] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 2 ms to minimize.
[2024-05-28 15:47:52] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:47:52] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:47:52] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:47:53] [INFO ] Deduced a trap composed of 222 places in 605 ms of which 4 ms to minimize.
[2024-05-28 15:47:53] [INFO ] Deduced a trap composed of 258 places in 479 ms of which 3 ms to minimize.
[2024-05-28 15:47:54] [INFO ] Deduced a trap composed of 236 places in 401 ms of which 3 ms to minimize.
[2024-05-28 15:47:54] [INFO ] Deduced a trap composed of 234 places in 394 ms of which 2 ms to minimize.
[2024-05-28 15:47:55] [INFO ] Deduced a trap composed of 220 places in 523 ms of which 3 ms to minimize.
[2024-05-28 15:47:55] [INFO ] Deduced a trap composed of 200 places in 577 ms of which 4 ms to minimize.
[2024-05-28 15:47:56] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/2642 variables, and 48 constraints, problems are : Problem set: 0 solved, 2238 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2238/984 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 2238 unsolved
[2024-05-28 15:48:14] [INFO ] Deduced a trap composed of 190 places in 396 ms of which 2 ms to minimize.
[2024-05-28 15:48:16] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/2642 variables, and 50 constraints, problems are : Problem set: 0 solved, 2238 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/984 constraints, Known Traps: 14/14 constraints]
After SMT, in 86343ms problems are : Problem set: 0 solved, 2238 unsolved
Search for dead transitions found 0 dead transitions in 86375ms
Starting structural reductions in SI_LTL mode, iteration 1 : 434/608 places, 2244/2418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136594 ms. Remains : 434/608 places, 2244/2418 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 327 steps (2 resets) in 7 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2011 reset in 587 ms.
Product exploration explored 100000 steps with 2043 reset in 549 ms.
Built C files in :
/tmp/ltsmin219390333296943824
[2024-05-28 15:48:39] [INFO ] Too many transitions (2244) to apply POR reductions. Disabling POR matrices.
[2024-05-28 15:48:39] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin219390333296943824
Running compilation step : cd /tmp/ltsmin219390333296943824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin219390333296943824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin219390333296943824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 2244/2244 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 434 transition count 2238
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 428 transition count 2238
Applied a total of 12 rules in 88 ms. Remains 428 /434 variables (removed 6) and now considering 2238/2244 (removed 6) transitions.
Running 2232 sub problems to find dead transitions.
[2024-05-28 15:48:42] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
// Phase 1: matrix 2202 rows 428 cols
[2024-05-28 15:48:43] [INFO ] Computed 42 invariants in 78 ms
[2024-05-28 15:48:43] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 15:49:19] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:49:19] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:49:19] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:49:20] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:49:20] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:49:20] [INFO ] Deduced a trap composed of 229 places in 530 ms of which 3 ms to minimize.
[2024-05-28 15:49:21] [INFO ] Deduced a trap composed of 199 places in 450 ms of which 3 ms to minimize.
[2024-05-28 15:49:21] [INFO ] Deduced a trap composed of 194 places in 395 ms of which 2 ms to minimize.
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 189 places in 364 ms of which 2 ms to minimize.
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 186 places in 386 ms of which 3 ms to minimize.
[2024-05-28 15:49:23] [INFO ] Deduced a trap composed of 54 places in 559 ms of which 3 ms to minimize.
[2024-05-28 15:49:23] [INFO ] Deduced a trap composed of 15 places in 529 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/2630 variables, and 48 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/2630 variables, and 48 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 12/12 constraints]
After SMT, in 63012ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 63033ms
[2024-05-28 15:49:45] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-05-28 15:49:45] [INFO ] Invariant cache hit.
[2024-05-28 15:49:46] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-28 15:49:46] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-05-28 15:49:46] [INFO ] Invariant cache hit.
[2024-05-28 15:49:47] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:49:51] [INFO ] Implicit Places using invariants and state equation in 4874 ms returned []
Implicit Place search using SMT with State Equation took 5370 ms to find 0 implicit places.
[2024-05-28 15:49:51] [INFO ] Redundant transitions in 100 ms returned []
Running 2232 sub problems to find dead transitions.
[2024-05-28 15:49:51] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-05-28 15:49:51] [INFO ] Invariant cache hit.
[2024-05-28 15:49:51] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 15:50:24] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:50:24] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2024-05-28 15:50:25] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:50:25] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:50:25] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:50:25] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:50:26] [INFO ] Deduced a trap composed of 198 places in 561 ms of which 4 ms to minimize.
[2024-05-28 15:50:26] [INFO ] Deduced a trap composed of 207 places in 457 ms of which 3 ms to minimize.
[2024-05-28 15:50:26] [INFO ] Deduced a trap composed of 193 places in 383 ms of which 2 ms to minimize.
[2024-05-28 15:50:27] [INFO ] Deduced a trap composed of 183 places in 542 ms of which 4 ms to minimize.
[2024-05-28 15:50:29] [INFO ] Deduced a trap composed of 184 places in 308 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/2630 variables, and 47 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 15:50:47] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-05-28 15:51:09] [INFO ] Deduced a trap composed of 44 places in 436 ms of which 3 ms to minimize.
[2024-05-28 15:51:10] [INFO ] Deduced a trap composed of 63 places in 437 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/2630 variables, and 50 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 14/14 constraints]
After SMT, in 81098ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 81133ms
Starting structural reductions in SI_LTL mode, iteration 1 : 428/434 places, 2238/2244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149746 ms. Remains : 428/434 places, 2238/2244 transitions.
Built C files in :
/tmp/ltsmin9820997614289338213
[2024-05-28 15:51:12] [INFO ] Too many transitions (2238) to apply POR reductions. Disabling POR matrices.
[2024-05-28 15:51:12] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9820997614289338213
Running compilation step : cd /tmp/ltsmin9820997614289338213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9820997614289338213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9820997614289338213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:51:16] [INFO ] Flatten gal took : 204 ms
[2024-05-28 15:51:16] [INFO ] Flatten gal took : 151 ms
[2024-05-28 15:51:16] [INFO ] Time to serialize gal into /tmp/LTL3981315372212937214.gal : 38 ms
[2024-05-28 15:51:16] [INFO ] Time to serialize properties into /tmp/LTL17046116922760229914.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3981315372212937214.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11438188154669326889.hoa' '-atoms' '/tmp/LTL17046116922760229914.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17046116922760229914.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11438188154669326889.hoa
Detected timeout of ITS tools.
[2024-05-28 15:51:31] [INFO ] Flatten gal took : 142 ms
[2024-05-28 15:51:31] [INFO ] Flatten gal took : 159 ms
[2024-05-28 15:51:31] [INFO ] Time to serialize gal into /tmp/LTL12681956606335166451.gal : 34 ms
[2024-05-28 15:51:31] [INFO ] Time to serialize properties into /tmp/LTL1785144180597795181.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12681956606335166451.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1785144180597795181.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(((EnablePollingE_4>=1)||(EnablePollingE_5>=1))||((EnablePollingE_2>=1)||(EnablePollingE_3>=1)))")||(("((EnablePollingE_0>=1)||...275
Formula 0 simplified : X(!"(((EnablePollingE_4>=1)||(EnablePollingE_5>=1))||((EnablePollingE_2>=1)||(EnablePollingE_3>=1)))" & !"((EnablePollingE_0>=1)||(E...265
Detected timeout of ITS tools.
[2024-05-28 15:51:47] [INFO ] Flatten gal took : 96 ms
[2024-05-28 15:51:47] [INFO ] Applying decomposition
[2024-05-28 15:51:47] [INFO ] Flatten gal took : 95 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17765422255608822704.txt' '-o' '/tmp/graph17765422255608822704.bin' '-w' '/tmp/graph17765422255608822704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17765422255608822704.bin' '-l' '-1' '-v' '-w' '/tmp/graph17765422255608822704.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:51:47] [INFO ] Decomposing Gal with order
[2024-05-28 15:51:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:51:47] [INFO ] Removed a total of 1243 redundant transitions.
[2024-05-28 15:51:48] [INFO ] Flatten gal took : 504 ms
[2024-05-28 15:51:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 44 ms.
[2024-05-28 15:51:48] [INFO ] Time to serialize gal into /tmp/LTL16139268178801422577.gal : 24 ms
[2024-05-28 15:51:48] [INFO ] Time to serialize properties into /tmp/LTL15336602754808181748.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16139268178801422577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15336602754808181748.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(("(((i0.u5.EnablePollingE_4>=1)||(i0.u6.EnablePollingE_5>=1))||((i0.u16.EnablePollingE_2>=1)||(i0.u17.EnablePollingE_3>=1)))")||(...353
Formula 0 simplified : X(!"(((i0.u5.EnablePollingE_4>=1)||(i0.u6.EnablePollingE_5>=1))||((i0.u16.EnablePollingE_2>=1)||(i0.u17.EnablePollingE_3>=1)))" & !"...343
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-07 finished in 404429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((F(p0)||G(p1))))))'
Support contains 43 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 2424/2424 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 614 transition count 2418
Applied a total of 18 rules in 31 ms. Remains 614 /626 variables (removed 12) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 15:52:03] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-05-28 15:52:03] [INFO ] Computed 48 invariants in 87 ms
[2024-05-28 15:52:03] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 15:52:43] [INFO ] Deduced a trap composed of 83 places in 161 ms of which 2 ms to minimize.
[2024-05-28 15:52:44] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:52:44] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:52:44] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 0 ms to minimize.
[2024-05-28 15:52:44] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 15:52:46] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:52:47] [INFO ] Deduced a trap composed of 263 places in 355 ms of which 3 ms to minimize.
[2024-05-28 15:52:48] [INFO ] Deduced a trap composed of 178 places in 427 ms of which 3 ms to minimize.
[2024-05-28 15:52:48] [INFO ] Deduced a trap composed of 169 places in 355 ms of which 3 ms to minimize.
[2024-05-28 15:52:48] [INFO ] Deduced a trap composed of 159 places in 366 ms of which 3 ms to minimize.
[2024-05-28 15:52:49] [INFO ] Deduced a trap composed of 172 places in 357 ms of which 3 ms to minimize.
[2024-05-28 15:52:50] [INFO ] Deduced a trap composed of 288 places in 375 ms of which 3 ms to minimize.
[2024-05-28 15:52:50] [INFO ] Deduced a trap composed of 310 places in 350 ms of which 3 ms to minimize.
[2024-05-28 15:52:51] [INFO ] Deduced a trap composed of 347 places in 350 ms of which 3 ms to minimize.
[2024-05-28 15:53:03] [INFO ] Deduced a trap composed of 327 places in 631 ms of which 4 ms to minimize.
[2024-05-28 15:53:04] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 1 ms to minimize.
[2024-05-28 15:53:04] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 59 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 17/17 constraints]
After SMT, in 61639ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61664ms
[2024-05-28 15:53:04] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:53:04] [INFO ] Invariant cache hit.
[2024-05-28 15:53:05] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-28 15:53:05] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:53:05] [INFO ] Invariant cache hit.
[2024-05-28 15:53:06] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:53:21] [INFO ] Implicit Places using invariants and state equation in 16111 ms returned []
Implicit Place search using SMT with State Equation took 16775 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 15:53:21] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:53:21] [INFO ] Invariant cache hit.
[2024-05-28 15:53:21] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 15:54:00] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:54:00] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:54:00] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:54:00] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 365 places in 361 ms of which 3 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 170 places in 358 ms of which 3 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 347 places in 635 ms of which 4 ms to minimize.
[2024-05-28 15:54:05] [INFO ] Deduced a trap composed of 66 places in 421 ms of which 2 ms to minimize.
[2024-05-28 15:54:07] [INFO ] Deduced a trap composed of 368 places in 522 ms of which 4 ms to minimize.
[2024-05-28 15:54:07] [INFO ] Deduced a trap composed of 327 places in 592 ms of which 4 ms to minimize.
[2024-05-28 15:54:08] [INFO ] Deduced a trap composed of 366 places in 511 ms of which 4 ms to minimize.
[2024-05-28 15:54:09] [INFO ] Deduced a trap composed of 355 places in 510 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 56 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 15:54:23] [INFO ] Deduced a trap composed of 177 places in 501 ms of which 3 ms to minimize.
[2024-05-28 15:54:24] [INFO ] Deduced a trap composed of 41 places in 514 ms of which 4 ms to minimize.
[2024-05-28 15:54:26] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 59 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 17/17 constraints]
After SMT, in 80537ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 80562ms
Starting structural reductions in LTL mode, iteration 1 : 614/626 places, 2418/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159042 ms. Remains : 614/626 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-08
Stuttering criterion allowed to conclude after 72 steps with 1 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-08 finished in 159181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p0&&G(!p1)) U (G(p0)||p2)))))'
Support contains 19 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 2424/2424 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 614 transition count 2418
Applied a total of 18 rules in 30 ms. Remains 614 /626 variables (removed 12) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 15:54:42] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:54:42] [INFO ] Invariant cache hit.
[2024-05-28 15:54:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 15:55:21] [INFO ] Deduced a trap composed of 83 places in 222 ms of which 2 ms to minimize.
[2024-05-28 15:55:21] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:55:21] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:55:21] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 1 ms to minimize.
[2024-05-28 15:55:21] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:55:22] [INFO ] Deduced a trap composed of 365 places in 535 ms of which 5 ms to minimize.
[2024-05-28 15:55:23] [INFO ] Deduced a trap composed of 170 places in 572 ms of which 4 ms to minimize.
SMT process timed out in 40634ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 40657ms
[2024-05-28 15:55:23] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:55:23] [INFO ] Invariant cache hit.
[2024-05-28 15:55:23] [INFO ] Implicit Places using invariants in 641 ms returned [490, 491, 492, 493, 494, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 657 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 608/626 places, 2418/2424 transitions.
Applied a total of 0 rules in 13 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41363 ms. Remains : 608/626 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, p1, (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-09
Entered a terminal (fully accepting) state of product in 42 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-09 finished in 41580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(!p0)||(!p1 U (G(!p1)||(!p1&&G(p2))))))))'
Support contains 43 out of 626 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 2424/2424 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 620 transition count 2394
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 590 transition count 2394
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 60 place count 590 transition count 2352
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 144 place count 548 transition count 2352
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 288 place count 476 transition count 2280
Applied a total of 288 rules in 73 ms. Remains 476 /626 variables (removed 150) and now considering 2280/2424 (removed 144) transitions.
Running 2274 sub problems to find dead transitions.
[2024-05-28 15:55:24] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
// Phase 1: matrix 2244 rows 476 cols
[2024-05-28 15:55:24] [INFO ] Computed 48 invariants in 37 ms
[2024-05-28 15:55:24] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-05-28 15:55:56] [INFO ] Deduced a trap composed of 72 places in 407 ms of which 3 ms to minimize.
[2024-05-28 15:55:56] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 1 ms to minimize.
[2024-05-28 15:55:56] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 1 ms to minimize.
[2024-05-28 15:55:57] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 0 ms to minimize.
[2024-05-28 15:55:57] [INFO ] Deduced a trap composed of 194 places in 342 ms of which 2 ms to minimize.
[2024-05-28 15:55:57] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:55:57] [INFO ] Deduced a trap composed of 66 places in 394 ms of which 2 ms to minimize.
[2024-05-28 15:55:58] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:55:58] [INFO ] Deduced a trap composed of 219 places in 558 ms of which 4 ms to minimize.
[2024-05-28 15:55:59] [INFO ] Deduced a trap composed of 240 places in 590 ms of which 3 ms to minimize.
[2024-05-28 15:56:00] [INFO ] Deduced a trap composed of 224 places in 584 ms of which 3 ms to minimize.
[2024-05-28 15:56:00] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/2720 variables, and 54 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 30/33 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2274/1020 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-05-28 15:56:09] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 2 ms to minimize.
[2024-05-28 15:56:09] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/2720 variables, and 56 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 30/33 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1020 constraints, Known Traps: 14/14 constraints]
After SMT, in 59087ms problems are : Problem set: 0 solved, 2274 unsolved
Search for dead transitions found 0 dead transitions in 59108ms
[2024-05-28 15:56:23] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
[2024-05-28 15:56:23] [INFO ] Invariant cache hit.
[2024-05-28 15:56:23] [INFO ] Implicit Places using invariants in 362 ms returned [376, 377, 378, 379, 380, 381]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 368 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 470/626 places, 2280/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 464 transition count 2274
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 464 transition count 2274
Applied a total of 12 rules in 39 ms. Remains 464 /470 variables (removed 6) and now considering 2274/2280 (removed 6) transitions.
[2024-05-28 15:56:23] [INFO ] Flow matrix only has 2238 transitions (discarded 36 similar events)
// Phase 1: matrix 2238 rows 464 cols
[2024-05-28 15:56:23] [INFO ] Computed 42 invariants in 68 ms
[2024-05-28 15:56:24] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-28 15:56:24] [INFO ] Flow matrix only has 2238 transitions (discarded 36 similar events)
[2024-05-28 15:56:24] [INFO ] Invariant cache hit.
[2024-05-28 15:56:24] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:56:32] [INFO ] Implicit Places using invariants and state equation in 8007 ms returned []
Implicit Place search using SMT with State Equation took 8488 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/626 places, 2274/2424 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 68085 ms. Remains : 464/626 places, 2274/2424 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-11
Product exploration explored 100000 steps with 925 reset in 1651 ms.
Product exploration explored 100000 steps with 913 reset in 1637 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 160 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (381 resets) in 1007 ms. (39 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (33 resets) in 2275 ms. (17 steps per ms) remains 1/1 properties
[2024-05-28 15:56:36] [INFO ] Flow matrix only has 2238 transitions (discarded 36 similar events)
[2024-05-28 15:56:36] [INFO ] Invariant cache hit.
[2024-05-28 15:56:36] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 220/263 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/273 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 457/2702 variables, and 36 constraints, problems are : Problem set: 1 solved, 0 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/464 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1058ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 11 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-11 finished in 73844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 2424/2424 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 620 transition count 2382
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 578 transition count 2382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 578 transition count 2310
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 506 transition count 2310
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 372 place count 434 transition count 2238
Applied a total of 372 rules in 69 ms. Remains 434 /626 variables (removed 192) and now considering 2238/2424 (removed 186) transitions.
Running 2232 sub problems to find dead transitions.
[2024-05-28 15:56:37] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
// Phase 1: matrix 2202 rows 434 cols
[2024-05-28 15:56:38] [INFO ] Computed 48 invariants in 75 ms
[2024-05-28 15:56:38] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 15:57:10] [INFO ] Deduced a trap composed of 29 places in 389 ms of which 2 ms to minimize.
[2024-05-28 15:57:10] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:57:10] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:57:10] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:57:10] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:57:10] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:57:11] [INFO ] Deduced a trap composed of 183 places in 526 ms of which 3 ms to minimize.
[2024-05-28 15:57:13] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:57:15] [INFO ] Deduced a trap composed of 177 places in 576 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/2636 variables, and 51 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 15:57:20] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 1 ms to minimize.
[2024-05-28 15:57:20] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/2636 variables, and 53 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 11/11 constraints]
After SMT, in 59419ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 59440ms
[2024-05-28 15:57:37] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-05-28 15:57:37] [INFO ] Invariant cache hit.
[2024-05-28 15:57:37] [INFO ] Implicit Places using invariants in 577 ms returned [370, 371, 372, 373, 374, 375]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 596 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 428/626 places, 2238/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 422 transition count 2232
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 422 transition count 2232
Applied a total of 12 rules in 47 ms. Remains 422 /428 variables (removed 6) and now considering 2232/2238 (removed 6) transitions.
[2024-05-28 15:57:38] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
// Phase 1: matrix 2196 rows 422 cols
[2024-05-28 15:57:38] [INFO ] Computed 42 invariants in 72 ms
[2024-05-28 15:57:38] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-05-28 15:57:38] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:57:38] [INFO ] Invariant cache hit.
[2024-05-28 15:57:39] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:57:46] [INFO ] Implicit Places using invariants and state equation in 7482 ms returned []
Implicit Place search using SMT with State Equation took 8125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 422/626 places, 2232/2424 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 68281 ms. Remains : 422/626 places, 2232/2424 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-12
Product exploration explored 100000 steps with 6011 reset in 960 ms.
Product exploration explored 100000 steps with 5973 reset in 667 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 69 steps (3 resets) in 7 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 2232/2232 transitions.
Applied a total of 0 rules in 40 ms. Remains 422 /422 variables (removed 0) and now considering 2232/2232 (removed 0) transitions.
Running 2226 sub problems to find dead transitions.
[2024-05-28 15:57:48] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:57:48] [INFO ] Invariant cache hit.
[2024-05-28 15:57:48] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 15:58:28] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:58:28] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 0 ms to minimize.
[2024-05-28 15:58:28] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:58:28] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:58:28] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2024-05-28 15:58:29] [INFO ] Deduced a trap composed of 182 places in 447 ms of which 2 ms to minimize.
[2024-05-28 15:58:29] [INFO ] Deduced a trap composed of 177 places in 377 ms of which 2 ms to minimize.
[2024-05-28 15:58:30] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 1 ms to minimize.
[2024-05-28 15:58:30] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 45 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 15:58:37] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 1 ms to minimize.
[2024-05-28 15:58:37] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2024-05-28 15:58:41] [INFO ] Deduced a trap composed of 216 places in 341 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 48 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 12/12 constraints]
After SMT, in 67427ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 67460ms
[2024-05-28 15:58:56] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:58:56] [INFO ] Invariant cache hit.
[2024-05-28 15:58:56] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-28 15:58:56] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:58:56] [INFO ] Invariant cache hit.
[2024-05-28 15:58:57] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:59:03] [INFO ] Implicit Places using invariants and state equation in 6781 ms returned []
Implicit Place search using SMT with State Equation took 7318 ms to find 0 implicit places.
[2024-05-28 15:59:03] [INFO ] Redundant transitions in 29 ms returned []
Running 2226 sub problems to find dead transitions.
[2024-05-28 15:59:03] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:59:03] [INFO ] Invariant cache hit.
[2024-05-28 15:59:03] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 15:59:37] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:59:37] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:59:37] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 0 ms to minimize.
[2024-05-28 15:59:37] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:59:37] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:59:38] [INFO ] Deduced a trap composed of 182 places in 513 ms of which 3 ms to minimize.
[2024-05-28 15:59:38] [INFO ] Deduced a trap composed of 177 places in 396 ms of which 2 ms to minimize.
[2024-05-28 15:59:39] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 2 ms to minimize.
[2024-05-28 15:59:39] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 45 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2024-05-28 15:59:59] [INFO ] Deduced a trap composed of 216 places in 356 ms of which 2 ms to minimize.
[2024-05-28 16:00:17] [INFO ] Deduced a trap composed of 47 places in 310 ms of which 1 ms to minimize.
[2024-05-28 16:00:21] [INFO ] Deduced a trap composed of 132 places in 371 ms of which 3 ms to minimize.
[2024-05-28 16:00:22] [INFO ] Deduced a trap composed of 146 places in 385 ms of which 4 ms to minimize.
[2024-05-28 16:00:22] [INFO ] Deduced a trap composed of 140 places in 383 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 52 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 16/16 constraints]
After SMT, in 80119ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 80151ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 155038 ms. Remains : 422/422 places, 2232/2232 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 108 steps (8 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6013 reset in 574 ms.
Product exploration explored 100000 steps with 6021 reset in 662 ms.
Built C files in :
/tmp/ltsmin14129475143244042387
[2024-05-28 16:00:25] [INFO ] Too many transitions (2232) to apply POR reductions. Disabling POR matrices.
[2024-05-28 16:00:25] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14129475143244042387
Running compilation step : cd /tmp/ltsmin14129475143244042387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14129475143244042387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14129475143244042387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 2232/2232 transitions.
Applied a total of 0 rules in 54 ms. Remains 422 /422 variables (removed 0) and now considering 2232/2232 (removed 0) transitions.
Running 2226 sub problems to find dead transitions.
[2024-05-28 16:00:28] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 16:00:28] [INFO ] Invariant cache hit.
[2024-05-28 16:00:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 16:01:02] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:01:02] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:01:02] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 0 ms to minimize.
[2024-05-28 16:01:02] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:01:02] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2024-05-28 16:01:03] [INFO ] Deduced a trap composed of 182 places in 384 ms of which 2 ms to minimize.
[2024-05-28 16:01:03] [INFO ] Deduced a trap composed of 177 places in 392 ms of which 2 ms to minimize.
[2024-05-28 16:01:04] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 1 ms to minimize.
[2024-05-28 16:01:04] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 45 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 16:01:10] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2024-05-28 16:01:11] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-05-28 16:01:14] [INFO ] Deduced a trap composed of 216 places in 409 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 9)
(s111 1)
(s112 0)
(s113 1)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 6)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 1)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 1)
(s370 0)
(s371 1)
(s372 0)
(s373 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 48 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 12/12 constraints]
After SMT, in 60733ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 60761ms
[2024-05-28 16:01:29] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 16:01:29] [INFO ] Invariant cache hit.
[2024-05-28 16:01:29] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-28 16:01:29] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 16:01:29] [INFO ] Invariant cache hit.
[2024-05-28 16:01:30] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:01:36] [INFO ] Implicit Places using invariants and state equation in 7134 ms returned []
Implicit Place search using SMT with State Equation took 7580 ms to find 0 implicit places.
[2024-05-28 16:01:36] [INFO ] Redundant transitions in 58 ms returned []
Running 2226 sub problems to find dead transitions.
[2024-05-28 16:01:36] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 16:01:36] [INFO ] Invariant cache hit.
[2024-05-28 16:01:36] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 16:02:15] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:02:15] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:02:15] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 0 ms to minimize.
[2024-05-28 16:02:16] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:02:16] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:02:16] [INFO ] Deduced a trap composed of 182 places in 392 ms of which 2 ms to minimize.
[2024-05-28 16:02:16] [INFO ] Deduced a trap composed of 177 places in 410 ms of which 2 ms to minimize.
[2024-05-28 16:02:17] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 2 ms to minimize.
[2024-05-28 16:02:17] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 45 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 16:02:34] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2024-05-28 16:02:34] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-28 16:02:38] [INFO ] Deduced a trap composed of 216 places in 347 ms of which 2 ms to minimize.
[2024-05-28 16:02:56] [INFO ] Deduced a trap composed of 47 places in 277 ms of which 4 ms to minimize.
[2024-05-28 16:03:00] [INFO ] Deduced a trap composed of 132 places in 339 ms of which 2 ms to minimize.
[2024-05-28 16:03:01] [INFO ] Deduced a trap composed of 146 places in 349 ms of which 3 ms to minimize.
[2024-05-28 16:03:01] [INFO ] Deduced a trap composed of 140 places in 335 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 52 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 16/16 constraints]
After SMT, in 85817ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 85845ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 154329 ms. Remains : 422/422 places, 2232/2232 transitions.
Built C files in :
/tmp/ltsmin3284107703521860164
[2024-05-28 16:03:02] [INFO ] Too many transitions (2232) to apply POR reductions. Disabling POR matrices.
[2024-05-28 16:03:02] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3284107703521860164
Running compilation step : cd /tmp/ltsmin3284107703521860164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3284107703521860164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3284107703521860164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 16:03:05] [INFO ] Flatten gal took : 112 ms
[2024-05-28 16:03:06] [INFO ] Flatten gal took : 111 ms
[2024-05-28 16:03:06] [INFO ] Time to serialize gal into /tmp/LTL168475547495345714.gal : 61 ms
[2024-05-28 16:03:06] [INFO ] Time to serialize properties into /tmp/LTL464167258769151672.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL168475547495345714.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8633348853750295744.hoa' '-atoms' '/tmp/LTL464167258769151672.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL464167258769151672.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8633348853750295744.hoa
Detected timeout of ITS tools.
[2024-05-28 16:03:21] [INFO ] Flatten gal took : 94 ms
[2024-05-28 16:03:21] [INFO ] Flatten gal took : 101 ms
[2024-05-28 16:03:21] [INFO ] Time to serialize gal into /tmp/LTL16399116103803484820.gal : 15 ms
[2024-05-28 16:03:21] [INFO ] Time to serialize properties into /tmp/LTL10609783383605903484.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16399116103803484820.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10609783383605903484.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((((QueueJobE_1<1)&&(QueueJobE_0<1))&&((QueueJobE_3<1)&&(QueueJobE_2<1)))&&((QueueJobE_5<1)&&(QueueJobE_4<1)))"))))
Formula 0 simplified : FG!"((((QueueJobE_1<1)&&(QueueJobE_0<1))&&((QueueJobE_3<1)&&(QueueJobE_2<1)))&&((QueueJobE_5<1)&&(QueueJobE_4<1)))"
Detected timeout of ITS tools.
[2024-05-28 16:03:36] [INFO ] Flatten gal took : 149 ms
[2024-05-28 16:03:36] [INFO ] Applying decomposition
[2024-05-28 16:03:36] [INFO ] Flatten gal took : 146 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13008427674876208878.txt' '-o' '/tmp/graph13008427674876208878.bin' '-w' '/tmp/graph13008427674876208878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13008427674876208878.bin' '-l' '-1' '-v' '-w' '/tmp/graph13008427674876208878.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:03:37] [INFO ] Decomposing Gal with order
[2024-05-28 16:03:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:03:37] [INFO ] Removed a total of 758 redundant transitions.
[2024-05-28 16:03:37] [INFO ] Flatten gal took : 228 ms
[2024-05-28 16:03:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 15 ms.
[2024-05-28 16:03:37] [INFO ] Time to serialize gal into /tmp/LTL10033743984115186633.gal : 27 ms
[2024-05-28 16:03:37] [INFO ] Time to serialize properties into /tmp/LTL9837430724854631252.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10033743984115186633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9837430724854631252.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((((i2.u5.QueueJobE_1<1)&&(i2.u5.QueueJobE_0<1))&&((i2.u5.QueueJobE_3<1)&&(i2.u5.QueueJobE_2<1)))&&((i2.u5.QueueJobE_5<1)&&(i2...180
Formula 0 simplified : FG!"((((i2.u5.QueueJobE_1<1)&&(i2.u5.QueueJobE_0<1))&&((i2.u5.QueueJobE_3<1)&&(i2.u5.QueueJobE_2<1)))&&((i2.u5.QueueJobE_5<1)&&(i2.u...174
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-12 finished in 434783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(X(F(p1))))))))'
Support contains 48 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 2424/2424 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 614 transition count 2418
Applied a total of 18 rules in 34 ms. Remains 614 /626 variables (removed 12) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 16:03:52] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-05-28 16:03:52] [INFO ] Computed 48 invariants in 51 ms
[2024-05-28 16:03:52] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 16:04:34] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 1 ms to minimize.
[2024-05-28 16:04:34] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 1 ms to minimize.
[2024-05-28 16:04:34] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:04:34] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:04:34] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 0 ms to minimize.
[2024-05-28 16:04:35] [INFO ] Deduced a trap composed of 163 places in 387 ms of which 4 ms to minimize.
[2024-05-28 16:04:35] [INFO ] Deduced a trap composed of 175 places in 359 ms of which 3 ms to minimize.
[2024-05-28 16:04:36] [INFO ] Deduced a trap composed of 157 places in 445 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 50 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 16:04:39] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:04:41] [INFO ] Deduced a trap composed of 304 places in 616 ms of which 4 ms to minimize.
[2024-05-28 16:04:43] [INFO ] Deduced a trap composed of 63 places in 440 ms of which 3 ms to minimize.
[2024-05-28 16:04:47] [INFO ] Deduced a trap composed of 41 places in 419 ms of which 3 ms to minimize.
[2024-05-28 16:04:51] [INFO ] Deduced a trap composed of 331 places in 522 ms of which 5 ms to minimize.
[2024-05-28 16:04:51] [INFO ] Deduced a trap composed of 325 places in 455 ms of which 3 ms to minimize.
[2024-05-28 16:04:52] [INFO ] Deduced a trap composed of 325 places in 496 ms of which 4 ms to minimize.
[2024-05-28 16:04:52] [INFO ] Deduced a trap composed of 326 places in 496 ms of which 4 ms to minimize.
[2024-05-28 16:04:53] [INFO ] Deduced a trap composed of 322 places in 510 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 59 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 17/17 constraints]
After SMT, in 64050ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 64084ms
[2024-05-28 16:04:56] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 16:04:56] [INFO ] Invariant cache hit.
[2024-05-28 16:04:57] [INFO ] Implicit Places using invariants in 498 ms returned [490, 491, 492, 493, 494, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 516 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 608/626 places, 2418/2424 transitions.
Applied a total of 0 rules in 12 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64654 ms. Remains : 608/626 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLFireability-15
Stuttering criterion allowed to conclude after 329 steps with 2 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLFireability-15 finished in 64812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-28 16:04:57] [INFO ] Flatten gal took : 128 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin992772657712402040
[2024-05-28 16:04:57] [INFO ] Too many transitions (2424) to apply POR reductions. Disabling POR matrices.
[2024-05-28 16:04:57] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin992772657712402040
Running compilation step : cd /tmp/ltsmin992772657712402040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 16:04:57] [INFO ] Applying decomposition
[2024-05-28 16:04:58] [INFO ] Flatten gal took : 141 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16976226102942172396.txt' '-o' '/tmp/graph16976226102942172396.bin' '-w' '/tmp/graph16976226102942172396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16976226102942172396.bin' '-l' '-1' '-v' '-w' '/tmp/graph16976226102942172396.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:04:58] [INFO ] Decomposing Gal with order
[2024-05-28 16:04:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:04:58] [INFO ] Removed a total of 912 redundant transitions.
[2024-05-28 16:04:58] [INFO ] Flatten gal took : 287 ms
[2024-05-28 16:04:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 27 ms.
[2024-05-28 16:04:58] [INFO ] Time to serialize gal into /tmp/LTLFireability17995567432067989912.gal : 58 ms
[2024-05-28 16:04:58] [INFO ] Time to serialize properties into /tmp/LTLFireability7968256132260109323.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17995567432067989912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7968256132260109323.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(("(((i8.i0.u8.EnablePollingE_4>=1)||(i1.i0.u32.EnablePollingE_5>=1))||((i1.i0.u56.EnablePollingE_2>=1)||(i8.i1.u30.EnablePollingE...394
Formula 0 simplified : X(!"(((i8.i0.u8.EnablePollingE_4>=1)||(i1.i0.u32.EnablePollingE_5>=1))||((i1.i0.u56.EnablePollingE_2>=1)||(i8.i1.u30.EnablePollingE_...384
Compilation finished in 6691 ms.
Running link step : cd /tmp/ltsmin992772657712402040;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin992772657712402040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin992772657712402040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin992772657712402040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-28 16:31:07] [INFO ] Applying decomposition
[2024-05-28 16:31:08] [INFO ] Flatten gal took : 337 ms
[2024-05-28 16:31:08] [INFO ] Decomposing Gal with order
[2024-05-28 16:31:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:31:08] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, P_1617_5, ScheduleTaskE_Idle_5],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DataOnSrc_2, PlaceSources_2, ModifiedSrc_2, AbourtToModifySrc_2],[DataOnSrc_3, PlaceSources_3, ModifiedSrc_3, AbourtToModifySrc_3],[DataOnSrc_4, PlaceSources_4, ModifiedSrc_4, AbourtToModifySrc_4],[DataOnSrc_5, PlaceSources_5, ModifiedSrc_5, AbourtToModifySrc_5],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],[DisablePollingE_16, DisablePollingB_16, Insert_Source_B_16, P_1119_16, P_2579_16],[DisablePollingE_17, DisablePollingB_17, Insert_Source_B_17, P_1119_17, P_2579_17],[DisablePollingE_18, DisablePollingB_18, Insert_Source_B_18, P_1119_18, P_2579_18],[DisablePollingE_19, DisablePollingB_19, Insert_Source_B_19, P_1119_19, P_2579_19],[DisablePollingE_20, DisablePollingB_20, Insert_Source_B_20, P_1119_20, P_2579_20],[DisablePollingE_21, DisablePollingB_21, Insert_Source_B_21, P_1119_21, P_2579_21],[DisablePollingE_22, DisablePollingB_22, Insert_Source_B_22, P_1119_22, P_2579_22],[DisablePollingE_23, DisablePollingB_23, Insert_Source_B_23, P_1119_23, P_2579_23],[DisablePollingE_24, DisablePollingB_24, Insert_Source_B_24, P_1119_24, P_2579_24],[DisablePollingE_25, DisablePollingB_25, Insert_Source_B_25, P_1119_25, P_2579_25],[DisablePollingE_26, DisablePollingB_26, Insert_Source_B_26, P_1119_26, P_2579_26],[DisablePollingE_27, DisablePollingB_27, Insert_Source_B_27, P_1119_27, P_2579_27],[DisablePollingE_28, DisablePollingB_28, Insert_Source_B_28, P_1119_28, P_2579_28],[DisablePollingE_29, DisablePollingB_29, Insert_Source_B_29, P_1119_29, P_2579_29],[DisablePollingE_30, DisablePollingB_30, Insert_Source_B_30, P_1119_30, P_2579_30],[DisablePollingE_31, DisablePollingB_31, Insert_Source_B_31, P_1119_31, P_2579_31],[DisablePollingE_32, DisablePollingB_32, Insert_Source_B_32, P_1119_32, P_2579_32],[DisablePollingE_33, DisablePollingB_33, Insert_Source_B_33, P_1119_33, P_2579_33],[DisablePollingE_34, DisablePollingB_34, Insert_Source_B_34, P_1119_34, P_2579_34],[DisablePollingE_35, DisablePollingB_35, Insert_Source_B_35, P_1119_35, P_2579_35],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 16:31:08] [INFO ] Flatten gal took : 295 ms
[2024-05-28 16:31:08] [INFO ] Time to serialize gal into /tmp/LTLFireability16042543955446292322.gal : 27 ms
[2024-05-28 16:31:08] [INFO ] Time to serialize properties into /tmp/LTLFireability3193716932151709334.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16042543955446292322.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3193716932151709334.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X(("(((EnablePollingE_4>=1)||(EnablePollingE_5>=1))||((EnablePollingE_2>=1)||(EnablePollingE_3>=1)))")||(("((EnablePollingE_0>=1)||...275
Formula 0 simplified : X(!"(((EnablePollingE_4>=1)||(EnablePollingE_5>=1))||((EnablePollingE_2>=1)||(EnablePollingE_3>=1)))" & !"((EnablePollingE_0>=1)||(E...265
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin992772657712402040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin992772657712402040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S06J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446500180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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