Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683760400139.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldIIPs-PT-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760400139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 675K 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 ShieldIIPs-PT-040B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716910270202

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 15:31:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:31:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:31:11] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-28 15:31:11] [INFO ] Transformed 2403 places.
[2024-05-28 15:31:11] [INFO ] Transformed 2363 transitions.
[2024-05-28 15:31:11] [INFO ] Found NUPN structural information;
[2024-05-28 15:31:11] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Discarding 275 places :
Symmetric choice reduction at 0 with 275 rule applications. Total rules 275 place count 2128 transition count 2088
Iterating global reduction 0 with 275 rules applied. Total rules applied 550 place count 2128 transition count 2088
Applied a total of 550 rules in 441 ms. Remains 2128 /2403 variables (removed 275) and now considering 2088/2363 (removed 275) transitions.
// Phase 1: matrix 2088 rows 2128 cols
[2024-05-28 15:31:12] [INFO ] Computed 361 invariants in 41 ms
[2024-05-28 15:31:13] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-05-28 15:31:13] [INFO ] Invariant cache hit.
[2024-05-28 15:31:15] [INFO ] Implicit Places using invariants and state equation in 1828 ms returned []
Implicit Place search using SMT with State Equation took 2751 ms to find 0 implicit places.
Running 2087 sub problems to find dead transitions.
[2024-05-28 15:31:15] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2127/4216 variables, and 0 constraints, problems are : Problem set: 0 solved, 2087 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2128 constraints, PredecessorRefiner: 2087/2087 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2087 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2127/4216 variables, and 0 constraints, problems are : Problem set: 0 solved, 2087 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2128 constraints, PredecessorRefiner: 0/2087 constraints, Known Traps: 0/0 constraints]
After SMT, in 60904ms problems are : Problem set: 0 solved, 2087 unsolved
Search for dead transitions found 0 dead transitions in 60943ms
Starting structural reductions in LTL mode, iteration 1 : 2128/2403 places, 2088/2363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64171 ms. Remains : 2128/2403 places, 2088/2363 transitions.
Support contains 28 out of 2128 places after structural reductions.
[2024-05-28 15:32:16] [INFO ] Flatten gal took : 170 ms
[2024-05-28 15:32:16] [INFO ] Flatten gal took : 99 ms
[2024-05-28 15:32:16] [INFO ] Input system was already deterministic with 2088 transitions.
RANDOM walk for 39824 steps (8 resets) in 1518 ms. (26 steps per ms) remains 0/18 properties
Computed a total of 483 stabilizing places and 483 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' '!(X(G((X(p1)||p0))))'
Support contains 4 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2123 transition count 2083
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2123 transition count 2083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 2122 transition count 2082
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 2122 transition count 2082
Applied a total of 12 rules in 242 ms. Remains 2122 /2128 variables (removed 6) and now considering 2082/2088 (removed 6) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-28 15:32:17] [INFO ] Computed 361 invariants in 14 ms
[2024-05-28 15:32:18] [INFO ] Implicit Places using invariants in 859 ms returned []
[2024-05-28 15:32:18] [INFO ] Invariant cache hit.
[2024-05-28 15:32:20] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2835 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:32:20] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60776ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60810ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2128 places, 2082/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63894 ms. Remains : 2122/2128 places, 2082/2088 transitions.
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-03
Product exploration explored 100000 steps with 20 reset in 908 ms.
Product exploration explored 100000 steps with 20 reset in 975 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 8662 steps (0 resets) in 200 ms. (43 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 274 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 71 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
[2024-05-28 15:33:24] [INFO ] Invariant cache hit.
[2024-05-28 15:33:25] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-28 15:33:25] [INFO ] Invariant cache hit.
[2024-05-28 15:33:27] [INFO ] Implicit Places using invariants and state equation in 1966 ms returned []
Implicit Place search using SMT with State Equation took 2588 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:33:27] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
(s365 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60562ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60582ms
Finished structural reductions in LTL mode , in 1 iterations and 63249 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 8976 steps (0 resets) in 132 ms. (67 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 226 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20 reset in 777 ms.
Product exploration explored 100000 steps with 20 reset in 951 ms.
Built C files in :
/tmp/ltsmin7580729997699604560
[2024-05-28 15:34:31] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7580729997699604560
Running compilation step : cd /tmp/ltsmin7580729997699604560;'/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/ltsmin7580729997699604560;'/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/ltsmin7580729997699604560;'/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 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 75 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
[2024-05-28 15:34:34] [INFO ] Invariant cache hit.
[2024-05-28 15:34:34] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-28 15:34:34] [INFO ] Invariant cache hit.
[2024-05-28 15:34:36] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2579 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:34:36] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60565ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60583ms
Finished structural reductions in LTL mode , in 1 iterations and 63247 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Built C files in :
/tmp/ltsmin1117302880947523594
[2024-05-28 15:35:37] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1117302880947523594
Running compilation step : cd /tmp/ltsmin1117302880947523594;'/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/ltsmin1117302880947523594;'/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/ltsmin1117302880947523594;'/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:35:40] [INFO ] Flatten gal took : 87 ms
[2024-05-28 15:35:40] [INFO ] Flatten gal took : 70 ms
[2024-05-28 15:35:40] [INFO ] Time to serialize gal into /tmp/LTL6669211916805442959.gal : 42 ms
[2024-05-28 15:35:40] [INFO ] Time to serialize properties into /tmp/LTL7556362657015452289.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/LTL6669211916805442959.gal' '-t' 'CGAL' '-hoa' '/tmp/aut314850889675952246.hoa' '-atoms' '/tmp/LTL7556362657015452289.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...316
Loading property file /tmp/LTL7556362657015452289.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut314850889675952246.hoa
Detected timeout of ITS tools.
[2024-05-28 15:35:55] [INFO ] Flatten gal took : 75 ms
[2024-05-28 15:35:55] [INFO ] Flatten gal took : 79 ms
[2024-05-28 15:35:56] [INFO ] Time to serialize gal into /tmp/LTL14697773899688945508.gal : 24 ms
[2024-05-28 15:35:56] [INFO ] Time to serialize properties into /tmp/LTL8709816770590410283.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/LTL14697773899688945508.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8709816770590410283.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(G(("((p729==0)||(p1260==1))")||(X("((p990==0)||(p874==1))"))))))
Formula 0 simplified : XF(!"((p729==0)||(p1260==1))" & X!"((p990==0)||(p874==1))")
Detected timeout of ITS tools.
[2024-05-28 15:36:11] [INFO ] Flatten gal took : 59 ms
[2024-05-28 15:36:11] [INFO ] Applying decomposition
[2024-05-28 15:36:11] [INFO ] Flatten gal took : 78 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/graph5263899264150254266.txt' '-o' '/tmp/graph5263899264150254266.bin' '-w' '/tmp/graph5263899264150254266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5263899264150254266.bin' '-l' '-1' '-v' '-w' '/tmp/graph5263899264150254266.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:36:11] [INFO ] Decomposing Gal with order
[2024-05-28 15:36:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:36:12] [INFO ] Removed a total of 920 redundant transitions.
[2024-05-28 15:36:12] [INFO ] Flatten gal took : 185 ms
[2024-05-28 15:36:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2024-05-28 15:36:12] [INFO ] Time to serialize gal into /tmp/LTL14851886203138959293.gal : 30 ms
[2024-05-28 15:36:12] [INFO ] Time to serialize properties into /tmp/LTL12527474797342698459.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/LTL14851886203138959293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12527474797342698459.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(G(("((i11.i1.u245.p729==0)||(i20.i1.u423.p1260==1))")||(X("((i16.i3.u332.p990==0)||(i14.i1.u293.p874==1))"))))))
Formula 0 simplified : XF(!"((i11.i1.u245.p729==0)||(i20.i1.u423.p1260==1))" & X!"((i16.i3.u332.p990==0)||(i14.i1.u293.p874==1))")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-03 finished in 249678 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(X(G(p0)))))'
Support contains 2 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2123 transition count 2083
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2123 transition count 2083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 2122 transition count 2082
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 2122 transition count 2082
Applied a total of 12 rules in 198 ms. Remains 2122 /2128 variables (removed 6) and now considering 2082/2088 (removed 6) transitions.
[2024-05-28 15:36:27] [INFO ] Invariant cache hit.
[2024-05-28 15:36:28] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-05-28 15:36:28] [INFO ] Invariant cache hit.
[2024-05-28 15:36:30] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 2592 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:36:30] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 timeout
1)
(s428 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60546ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60564ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2128 places, 2082/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63367 ms. Remains : 2122/2128 places, 2082/2088 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-04 finished in 63537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0)) U p0)))'
Support contains 2 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2123 transition count 2083
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2123 transition count 2083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 2122 transition count 2082
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 2122 transition count 2082
Applied a total of 12 rules in 208 ms. Remains 2122 /2128 variables (removed 6) and now considering 2082/2088 (removed 6) transitions.
[2024-05-28 15:37:31] [INFO ] Invariant cache hit.
[2024-05-28 15:37:31] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-05-28 15:37:31] [INFO ] Invariant cache hit.
[2024-05-28 15:37:33] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:37:33] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60553ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60571ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2128 places, 2082/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63265 ms. Remains : 2122/2128 places, 2082/2088 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), p0, p0]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 603 ms.
Product exploration explored 100000 steps with 50000 reset in 662 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-05 finished in 64750 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&&F(G(p0)))))'
Support contains 1 out of 2128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2127 transition count 1886
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1926 transition count 1886
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 402 place count 1926 transition count 1686
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 802 place count 1726 transition count 1686
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 807 place count 1721 transition count 1681
Iterating global reduction 2 with 5 rules applied. Total rules applied 812 place count 1721 transition count 1681
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 812 place count 1721 transition count 1680
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 814 place count 1720 transition count 1680
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 3 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2246 place count 1004 transition count 964
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2248 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2249 place count 1001 transition count 962
Applied a total of 2249 rules in 492 ms. Remains 1001 /2128 variables (removed 1127) and now considering 962/2088 (removed 1126) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2024-05-28 15:38:36] [INFO ] Computed 360 invariants in 3 ms
[2024-05-28 15:38:36] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-28 15:38:36] [INFO ] Invariant cache hit.
[2024-05-28 15:38:37] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
[2024-05-28 15:38:37] [INFO ] Redundant transitions in 161 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 960 sub problems to find dead transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 15:38:37] [INFO ] Computed 360 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:38:51] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 32 ms to minimize.
[2024-05-28 15:38:52] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 5 ms to minimize.
[2024-05-28 15:38:52] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 13 ms to minimize.
[2024-05-28 15:38:52] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 4 ms to minimize.
[2024-05-28 15:38:52] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 3 ms to minimize.
[2024-05-28 15:38:52] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 4 ms to minimize.
[2024-05-28 15:38:53] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 4 ms to minimize.
[2024-05-28 15:38:53] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 3 ms to minimize.
[2024-05-28 15:38:53] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 4 ms to minimize.
[2024-05-28 15:38:53] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-28 15:38:53] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 4 ms to minimize.
[2024-05-28 15:38:54] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:38:54] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:38:54] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:38:54] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-05-28 15:38:54] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:38:54] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:38:55] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-28 15:38:55] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-05-28 15:38:55] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:38:55] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2024-05-28 15:38:55] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 3 ms to minimize.
[2024-05-28 15:38:55] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 3 ms to minimize.
[2024-05-28 15:38:56] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 3 ms to minimize.
[2024-05-28 15:38:56] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:38:56] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:38:56] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-05-28 15:38:56] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:38:56] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:38:56] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:38:57] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:38:57] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:38:57] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:38:57] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:38:57] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:38:57] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 3 ms to minimize.
[2024-05-28 15:38:57] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:38:57] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:38:57] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-28 15:38:57] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:38:58] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:38:59] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:38:59] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-28 15:38:59] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-28 15:38:59] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:38:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:38:59] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:38:59] [INFO ] Deduced a trap composed of 16 places in 56 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1962 variables, and 420 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:39:08] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:39:08] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:39:08] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:39:08] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:39:09] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:39:09] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:39:09] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:39:09] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-28 15:39:10] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:39:10] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:39:10] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:39:10] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:39:10] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:39:10] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:39:11] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:39:11] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:39:11] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:39:11] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-28 15:39:12] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:39:12] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:39:13] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:39:14] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:39:14] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:39:15] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:39:15] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:39:15] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:39:15] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:39:16] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-05-28 15:39:16] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 3 ms to minimize.
[2024-05-28 15:39:16] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-05-28 15:39:17] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-28 15:39:17] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:39:17] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2024-05-28 15:39:17] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:39:18] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-05-28 15:39:18] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-28 15:39:18] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 2 ms to minimize.
[2024-05-28 15:39:18] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 3 ms to minimize.
[2024-05-28 15:39:19] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-05-28 15:39:19] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:39:22] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 3 ms to minimize.
[2024-05-28 15:39:22] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:39:23] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:39:23] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2024-05-28 15:39:24] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:39:24] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-28 15:39:25] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2024-05-28 15:39:25] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2024-05-28 15:39:25] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 4 ms to minimize.
[2024-05-28 15:39:26] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 4 ms to minimize.
[2024-05-28 15:39:26] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 4 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 4 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 4 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 4 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 4 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 4 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 3 ms to minimize.
[2024-05-28 15:39:32] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:39:32] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:39:32] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:39:33] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:39:35] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-28 15:39:35] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2024-05-28 15:39:36] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 3 ms to minimize.
[2024-05-28 15:39:37] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-05-28 15:39:37] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1962 variables, and 486 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 126/126 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2128 places, 961/2088 transitions.
Applied a total of 0 rules in 36 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62220 ms. Remains : 1001/2128 places, 961/2088 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-06
Product exploration explored 100000 steps with 48 reset in 726 ms.
Product exploration explored 100000 steps with 48 reset in 948 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 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 4040 steps (0 resets) in 46 ms. (85 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 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 27 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:39:39] [INFO ] Invariant cache hit.
[2024-05-28 15:39:40] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-28 15:39:40] [INFO ] Invariant cache hit.
[2024-05-28 15:39:41] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
[2024-05-28 15:39:41] [INFO ] Redundant transitions in 126 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-28 15:39:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:39:55] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 4 ms to minimize.
[2024-05-28 15:39:55] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 4 ms to minimize.
[2024-05-28 15:39:55] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 4 ms to minimize.
[2024-05-28 15:39:56] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-05-28 15:39:56] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 4 ms to minimize.
[2024-05-28 15:39:56] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 4 ms to minimize.
[2024-05-28 15:39:56] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 4 ms to minimize.
[2024-05-28 15:39:56] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:39:56] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-05-28 15:39:57] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-05-28 15:39:57] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-05-28 15:39:57] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:39:57] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 3 ms to minimize.
[2024-05-28 15:39:57] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-28 15:39:57] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-05-28 15:39:58] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 4 ms to minimize.
[2024-05-28 15:39:58] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2024-05-28 15:39:58] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:39:58] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-28 15:39:58] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:39:58] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:39:59] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 3 ms to minimize.
[2024-05-28 15:39:59] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-28 15:39:59] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:39:59] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:39:59] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 3 ms to minimize.
[2024-05-28 15:39:59] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 3 ms to minimize.
[2024-05-28 15:39:59] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:39:59] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:40:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:40:01] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:40:01] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:40:01] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:40:01] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:40:01] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:40:01] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:40:01] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:40:01] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:40:02] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:40:02] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:40:02] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:40:02] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:40:02] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:40:02] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:40:02] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:40:03] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:40:03] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1962 variables, and 420 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:40:12] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 15:40:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:40:12] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-28 15:40:12] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:40:12] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:40:13] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:40:13] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:40:13] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-28 15:40:14] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:40:14] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:40:14] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:40:14] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:40:14] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:40:15] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:40:15] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:40:15] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-28 15:40:15] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:40:15] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-28 15:40:16] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 3 ms to minimize.
[2024-05-28 15:40:16] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:40:16] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:40:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:40:17] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:40:18] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-28 15:40:19] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:40:19] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:40:19] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:40:20] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 3 ms to minimize.
[2024-05-28 15:40:20] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 3 ms to minimize.
[2024-05-28 15:40:20] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:40:20] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-05-28 15:40:20] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-28 15:40:21] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-05-28 15:40:21] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 2 ms to minimize.
[2024-05-28 15:40:21] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:40:21] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-28 15:40:22] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:40:22] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 2 ms to minimize.
[2024-05-28 15:40:22] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-05-28 15:40:23] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:40:24] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:40:25] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:40:26] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:40:26] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 3 ms to minimize.
[2024-05-28 15:40:26] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-28 15:40:27] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:40:28] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-05-28 15:40:28] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:40:28] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 3 ms to minimize.
[2024-05-28 15:40:29] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-05-28 15:40:29] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:40:29] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-05-28 15:40:30] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
[2024-05-28 15:40:30] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 4 ms to minimize.
[2024-05-28 15:40:30] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 3 ms to minimize.
[2024-05-28 15:40:31] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 4 ms to minimize.
[2024-05-28 15:40:31] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:40:31] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:40:32] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 4 ms to minimize.
[2024-05-28 15:40:32] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 3 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 3 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-05-28 15:40:37] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 4 ms to minimize.
[2024-05-28 15:40:37] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 3 ms to minimize.
[2024-05-28 15:40:37] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:40:39] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 4 ms to minimize.
[2024-05-28 15:40:39] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1962 variables, and 490 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 130/130 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61650 ms. Remains : 1001/1001 places, 961/961 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 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 4189 steps (0 resets) in 61 ms. (67 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 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 48 reset in 725 ms.
Product exploration explored 100000 steps with 48 reset in 916 ms.
Built C files in :
/tmp/ltsmin15084199189503065614
[2024-05-28 15:40:43] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-28 15:40:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:40:43] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-28 15:40:43] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:40:43] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-28 15:40:43] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:40:43] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15084199189503065614
Running compilation step : cd /tmp/ltsmin15084199189503065614;'/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/ltsmin15084199189503065614;'/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/ltsmin15084199189503065614;'/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 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 26 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:40:46] [INFO ] Invariant cache hit.
[2024-05-28 15:40:47] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-28 15:40:47] [INFO ] Invariant cache hit.
[2024-05-28 15:40:48] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2024-05-28 15:40:48] [INFO ] Redundant transitions in 87 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-28 15:40:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:41:02] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 3 ms to minimize.
[2024-05-28 15:41:02] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 4 ms to minimize.
[2024-05-28 15:41:02] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 4 ms to minimize.
[2024-05-28 15:41:02] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-05-28 15:41:02] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 4 ms to minimize.
[2024-05-28 15:41:03] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 4 ms to minimize.
[2024-05-28 15:41:03] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-05-28 15:41:03] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:41:03] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-05-28 15:41:03] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 4 ms to minimize.
[2024-05-28 15:41:04] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 4 ms to minimize.
[2024-05-28 15:41:04] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:41:04] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:41:04] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-28 15:41:04] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-05-28 15:41:04] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-28 15:41:04] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2024-05-28 15:41:05] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-05-28 15:41:05] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:41:05] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:41:05] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-05-28 15:41:05] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 3 ms to minimize.
[2024-05-28 15:41:05] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:41:06] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 3 ms to minimize.
[2024-05-28 15:41:06] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:41:06] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:41:06] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:41:06] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:41:06] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:41:06] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:41:06] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:41:06] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:41:08] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 15:41:08] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:41:08] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:41:08] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:41:08] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:41:08] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:41:08] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:41:09] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:41:09] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:41:09] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2024-05-28 15:41:09] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:41:09] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:41:09] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:41:09] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1962 variables, and 420 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:41:19] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 15:41:19] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:41:19] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:41:19] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:41:19] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:41:20] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:41:20] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:41:20] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-28 15:41:20] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-28 15:41:21] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:41:21] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:41:21] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:41:21] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:41:21] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 15:41:22] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:41:22] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:41:22] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:41:22] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:41:23] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:41:23] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:41:23] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:41:23] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:41:23] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:41:24] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-28 15:41:25] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:41:26] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:41:26] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-28 15:41:26] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:41:27] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:41:27] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-28 15:41:27] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:41:27] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2024-05-28 15:41:27] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 3 ms to minimize.
[2024-05-28 15:41:28] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
[2024-05-28 15:41:28] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 3 ms to minimize.
[2024-05-28 15:41:28] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:41:28] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:41:29] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
[2024-05-28 15:41:29] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:41:29] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:41:31] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:41:31] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:41:32] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:41:32] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-28 15:41:32] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-28 15:41:34] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 3 ms to minimize.
[2024-05-28 15:41:34] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-28 15:41:34] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:41:35] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:41:35] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-28 15:41:35] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 3 ms to minimize.
[2024-05-28 15:41:35] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-28 15:41:36] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-05-28 15:41:36] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-05-28 15:41:37] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 4 ms to minimize.
[2024-05-28 15:41:37] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 4 ms to minimize.
[2024-05-28 15:41:37] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:41:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:41:38] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 4 ms to minimize.
[2024-05-28 15:41:38] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:41:41] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-28 15:41:42] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:41:42] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-05-28 15:41:42] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-05-28 15:41:42] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 3 ms to minimize.
[2024-05-28 15:41:43] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:41:43] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:41:43] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:41:44] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 3 ms to minimize.
[2024-05-28 15:41:45] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1962 variables, and 490 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 130/130 constraints]
After SMT, in 60210ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61611 ms. Remains : 1001/1001 places, 961/961 transitions.
Built C files in :
/tmp/ltsmin10179735792747624770
[2024-05-28 15:41:48] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-28 15:41:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:41:48] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-28 15:41:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:41:48] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-28 15:41:48] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:41:48] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10179735792747624770
Running compilation step : cd /tmp/ltsmin10179735792747624770;'/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/ltsmin10179735792747624770;'/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/ltsmin10179735792747624770;'/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:41:51] [INFO ] Flatten gal took : 32 ms
[2024-05-28 15:41:51] [INFO ] Flatten gal took : 32 ms
[2024-05-28 15:41:51] [INFO ] Time to serialize gal into /tmp/LTL13772526364673258894.gal : 5 ms
[2024-05-28 15:41:51] [INFO ] Time to serialize properties into /tmp/LTL10259586897233368832.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/LTL13772526364673258894.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13310411588845583217.hoa' '-atoms' '/tmp/LTL10259586897233368832.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...320
Loading property file /tmp/LTL10259586897233368832.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13310411588845583217.hoa
Detected timeout of ITS tools.
[2024-05-28 15:42:06] [INFO ] Flatten gal took : 30 ms
[2024-05-28 15:42:06] [INFO ] Flatten gal took : 30 ms
[2024-05-28 15:42:06] [INFO ] Time to serialize gal into /tmp/LTL2222591088638927575.gal : 5 ms
[2024-05-28 15:42:06] [INFO ] Time to serialize properties into /tmp/LTL18067697034137090677.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/LTL2222591088638927575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18067697034137090677.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 : !((F(("(p1038==0)")&&(F(G("(p1038==0)"))))))
Formula 0 simplified : GF!"(p1038==0)"
Detected timeout of ITS tools.
[2024-05-28 15:42:21] [INFO ] Flatten gal took : 30 ms
[2024-05-28 15:42:21] [INFO ] Applying decomposition
[2024-05-28 15:42:22] [INFO ] Flatten gal took : 30 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/graph9713541378954760132.txt' '-o' '/tmp/graph9713541378954760132.bin' '-w' '/tmp/graph9713541378954760132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9713541378954760132.bin' '-l' '-1' '-v' '-w' '/tmp/graph9713541378954760132.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:42:22] [INFO ] Decomposing Gal with order
[2024-05-28 15:42:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:42:22] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-28 15:42:22] [INFO ] Flatten gal took : 50 ms
[2024-05-28 15:42:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 620 labels/synchronizations in 16 ms.
[2024-05-28 15:42:22] [INFO ] Time to serialize gal into /tmp/LTL46123971379767951.gal : 11 ms
[2024-05-28 15:42:22] [INFO ] Time to serialize properties into /tmp/LTL10223026098393212311.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/LTL46123971379767951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10223026098393212311.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...253
Read 1 LTL properties
Checking formula 0 : !((F(("(i16.i2.u153.p1038==0)")&&(F(G("(i16.i2.u153.p1038==0)"))))))
Formula 0 simplified : GF!"(i16.i2.u153.p1038==0)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-06 finished in 241755 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))'
Support contains 1 out of 2128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2127 transition count 1886
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1926 transition count 1886
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1926 transition count 1685
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1725 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 809 place count 1720 transition count 1680
Iterating global reduction 2 with 5 rules applied. Total rules applied 814 place count 1720 transition count 1680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 814 place count 1720 transition count 1679
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 816 place count 1719 transition count 1679
Performed 715 Post agglomeration using F-continuation condition.Transition count delta: 715
Deduced a syphon composed of 715 places in 2 ms
Reduce places removed 715 places and 0 transitions.
Iterating global reduction 2 with 1430 rules applied. Total rules applied 2246 place count 1004 transition count 964
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2248 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2249 place count 1001 transition count 962
Applied a total of 2249 rules in 285 ms. Remains 1001 /2128 variables (removed 1127) and now considering 962/2088 (removed 1126) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2024-05-28 15:42:37] [INFO ] Computed 360 invariants in 2 ms
[2024-05-28 15:42:38] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-28 15:42:38] [INFO ] Invariant cache hit.
[2024-05-28 15:42:38] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
[2024-05-28 15:42:39] [INFO ] Redundant transitions in 111 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 959 sub problems to find dead transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 15:42:39] [INFO ] Computed 360 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 354/354 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:42:52] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 7 ms to minimize.
[2024-05-28 15:42:53] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 3 ms to minimize.
[2024-05-28 15:42:53] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 4 ms to minimize.
[2024-05-28 15:42:53] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-28 15:42:53] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 4 ms to minimize.
[2024-05-28 15:42:53] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:42:54] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-05-28 15:42:54] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-28 15:42:54] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 2 ms to minimize.
[2024-05-28 15:42:54] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:42:54] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:42:54] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 15:42:55] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 3 ms to minimize.
[2024-05-28 15:42:55] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 3 ms to minimize.
[2024-05-28 15:42:55] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-05-28 15:42:55] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:42:55] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:42:55] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-05-28 15:42:55] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:42:56] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:42:56] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:42:56] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:42:56] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:42:56] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 3 ms to minimize.
[2024-05-28 15:42:56] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-05-28 15:42:56] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:42:57] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:42:58] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:42:59] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:42:59] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-28 15:42:59] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:42:59] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:42:59] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:42:59] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:43:00] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:43:00] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:43:00] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-28 15:43:00] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-28 15:43:00] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:43:00] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1962 variables, and 414 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 354/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 354/354 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/414 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:43:10] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:43:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:43:11] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:43:11] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:43:11] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-28 15:43:11] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:43:11] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:43:12] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:43:12] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:43:12] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:43:12] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:43:13] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:43:13] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:43:13] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:43:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:43:14] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:43:14] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:43:14] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:43:14] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:43:14] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/434 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:43:15] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 15:43:15] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:43:15] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:43:15] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:43:16] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:43:17] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:43:17] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:43:18] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:43:18] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:43:18] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:43:18] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:43:19] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:43:19] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2024-05-28 15:43:19] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:43:19] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:43:19] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:43:19] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:43:20] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-28 15:43:20] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:43:20] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/454 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:43:20] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:43:22] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:43:25] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:43:25] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:43:25] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:43:25] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-28 15:43:26] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:43:26] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:43:26] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-28 15:43:26] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-05-28 15:43:27] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:43:27] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:43:30] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:43:33] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:43:34] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:43:37] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 15:43:37] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:43:38] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1962 variables, and 479 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 354/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 125/125 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2128 places, 961/2088 transitions.
Applied a total of 0 rules in 27 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62016 ms. Remains : 1001/2128 places, 961/2088 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-08
Product exploration explored 100000 steps with 27428 reset in 626 ms.
Product exploration explored 100000 steps with 27255 reset in 778 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1001 stabilizing places and 2/961 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 22 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-28 15:43:41] [INFO ] Invariant cache hit.
[2024-05-28 15:43:42] [INFO ] [Real]Absence check using 360 positive place invariants in 151 ms returned sat
[2024-05-28 15:43:43] [INFO ] [Real]Absence check using state equation in 1476 ms returned sat
[2024-05-28 15:43:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:43:44] [INFO ] [Nat]Absence check using 360 positive place invariants in 152 ms returned sat
[2024-05-28 15:43:45] [INFO ] [Nat]Absence check using state equation in 1697 ms returned sat
[2024-05-28 15:43:46] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 5 ms to minimize.
[2024-05-28 15:43:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-05-28 15:43:46] [INFO ] Computed and/alt/rep : 957/2388/957 causal constraints (skipped 2 transitions) in 51 ms.
Could not prove EG (NOT p0)
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 21 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:43:58] [INFO ] Invariant cache hit.
[2024-05-28 15:43:59] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-28 15:43:59] [INFO ] Invariant cache hit.
[2024-05-28 15:43:59] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2024-05-28 15:43:59] [INFO ] Redundant transitions in 93 ms returned []
Running 959 sub problems to find dead transitions.
[2024-05-28 15:44:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 354/354 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:44:13] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 4 ms to minimize.
[2024-05-28 15:44:13] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-05-28 15:44:14] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-05-28 15:44:14] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 4 ms to minimize.
[2024-05-28 15:44:14] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:44:14] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-05-28 15:44:14] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 4 ms to minimize.
[2024-05-28 15:44:15] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-28 15:44:15] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:44:15] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-28 15:44:15] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:44:15] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2024-05-28 15:44:15] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-05-28 15:44:15] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:44:16] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2024-05-28 15:44:16] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:44:16] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:44:16] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:44:16] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 3 ms to minimize.
[2024-05-28 15:44:16] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:44:17] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:44:17] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-28 15:44:17] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:44:17] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 3 ms to minimize.
[2024-05-28 15:44:17] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:44:17] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:44:17] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 3 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:44:18] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:44:19] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:44:19] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:44:19] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:44:19] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 15:44:19] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 15:44:19] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:44:19] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:44:19] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:44:19] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:44:20] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-28 15:44:20] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:44:20] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:44:20] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:44:20] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:44:20] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-28 15:44:21] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:44:21] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:44:21] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:44:21] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:44:21] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:44:21] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1962 variables, and 414 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 354/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 354/354 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/414 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:44:30] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 15:44:31] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:44:31] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:44:31] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-28 15:44:32] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:44:32] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 15:44:32] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-28 15:44:32] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:44:33] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:44:33] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:44:33] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:44:33] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:44:33] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:44:34] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-05-28 15:44:34] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:44:34] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:44:34] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-28 15:44:34] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:44:35] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:44:35] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/434 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:44:35] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:44:38] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:44:38] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:44:38] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/454 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:44:45] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:44:45] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:44:46] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:44:46] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:44:46] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:44:46] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:44:47] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:44:47] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:44:47] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:44:47] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:44:47] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:44:48] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:44:48] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-28 15:44:48] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:44:48] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:44:49] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:44:52] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:44:52] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:44:54] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-28 15:44:56] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1962 variables, and 476 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 354/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 122/122 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61620 ms. Remains : 1001/1001 places, 961/961 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1001 stabilizing places and 2/961 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-28 15:45:00] [INFO ] Invariant cache hit.
[2024-05-28 15:45:01] [INFO ] [Real]Absence check using 360 positive place invariants in 151 ms returned sat
[2024-05-28 15:45:02] [INFO ] [Real]Absence check using state equation in 1493 ms returned sat
[2024-05-28 15:45:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:45:03] [INFO ] [Nat]Absence check using 360 positive place invariants in 147 ms returned sat
[2024-05-28 15:45:05] [INFO ] [Nat]Absence check using state equation in 1654 ms returned sat
[2024-05-28 15:45:05] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 15:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-28 15:45:05] [INFO ] Computed and/alt/rep : 957/2388/957 causal constraints (skipped 2 transitions) in 55 ms.
[2024-05-28 15:45:17] [INFO ] Added : 640 causal constraints over 128 iterations in 12582 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27282 reset in 615 ms.
Product exploration explored 100000 steps with 27188 reset in 780 ms.
Built C files in :
/tmp/ltsmin132961813802484333
[2024-05-28 15:45:19] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-28 15:45:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:45:19] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-28 15:45:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:45:19] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-28 15:45:19] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:45:19] [INFO ] Built C files in 159ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin132961813802484333
Running compilation step : cd /tmp/ltsmin132961813802484333;'/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/ltsmin132961813802484333;'/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/ltsmin132961813802484333;'/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 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 26 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:45:22] [INFO ] Invariant cache hit.
[2024-05-28 15:45:23] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-28 15:45:23] [INFO ] Invariant cache hit.
[2024-05-28 15:45:23] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
[2024-05-28 15:45:23] [INFO ] Redundant transitions in 89 ms returned []
Running 959 sub problems to find dead transitions.
[2024-05-28 15:45:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 354/354 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:45:37] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 4 ms to minimize.
[2024-05-28 15:45:37] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 4 ms to minimize.
[2024-05-28 15:45:38] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-28 15:45:38] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 4 ms to minimize.
[2024-05-28 15:45:38] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:45:38] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-05-28 15:45:38] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:45:39] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 4 ms to minimize.
[2024-05-28 15:45:39] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:45:39] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:45:39] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:45:39] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-05-28 15:45:39] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:45:40] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:45:40] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:45:40] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:45:40] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-05-28 15:45:40] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:45:40] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 3 ms to minimize.
[2024-05-28 15:45:40] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:45:41] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2024-05-28 15:45:41] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2024-05-28 15:45:41] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:45:41] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 3 ms to minimize.
[2024-05-28 15:45:41] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:45:41] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 3 ms to minimize.
[2024-05-28 15:45:41] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:45:42] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:45:43] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:45:43] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:45:43] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:45:43] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:45:43] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 15:45:43] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:45:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:45:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:45:44] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:45:44] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:45:44] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:45:44] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:45:44] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:45:44] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:45:45] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:45:45] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:45:45] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-28 15:45:45] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:45:45] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:45:45] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-28 15:45:45] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
(s73 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0timeout
)
(s74 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1962 variables, and 414 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 354/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 354/354 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/414 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/434 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:46:02] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:46:02] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:46:03] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:46:03] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:46:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:46:03] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-28 15:46:03] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:46:03] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:46:03] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:46:04] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:46:04] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:46:04] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:46:04] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:46:04] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:46:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:46:05] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:46:05] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:46:05] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:46:05] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/454 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:46:07] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:46:08] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:46:09] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:46:09] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:46:10] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:46:10] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:46:10] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:46:10] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:46:10] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-28 15:46:10] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:46:12] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-05-28 15:46:12] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:46:12] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:46:16] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 15:46:16] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:46:17] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:46:19] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1962 variables, and 476 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 354/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 122/122 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61629 ms. Remains : 1001/1001 places, 961/961 transitions.
Built C files in :
/tmp/ltsmin6259803573355943506
[2024-05-28 15:46:24] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-28 15:46:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:46:24] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-28 15:46:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:46:24] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-28 15:46:24] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:46:24] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6259803573355943506
Running compilation step : cd /tmp/ltsmin6259803573355943506;'/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/ltsmin6259803573355943506;'/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/ltsmin6259803573355943506;'/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:46:27] [INFO ] Flatten gal took : 27 ms
[2024-05-28 15:46:27] [INFO ] Flatten gal took : 27 ms
[2024-05-28 15:46:27] [INFO ] Time to serialize gal into /tmp/LTL16520050291231359688.gal : 5 ms
[2024-05-28 15:46:27] [INFO ] Time to serialize properties into /tmp/LTL8785164678545356063.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/LTL16520050291231359688.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6697443544015227798.hoa' '-atoms' '/tmp/LTL8785164678545356063.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...318
Loading property file /tmp/LTL8785164678545356063.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6697443544015227798.hoa
Detected timeout of ITS tools.
[2024-05-28 15:46:42] [INFO ] Flatten gal took : 26 ms
[2024-05-28 15:46:42] [INFO ] Flatten gal took : 27 ms
[2024-05-28 15:46:42] [INFO ] Time to serialize gal into /tmp/LTL5050730013512483515.gal : 5 ms
[2024-05-28 15:46:42] [INFO ] Time to serialize properties into /tmp/LTL904425952411051565.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/LTL5050730013512483515.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL904425952411051565.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...274
Read 1 LTL properties
Checking formula 0 : !((F("(p1247==1)")))
Formula 0 simplified : G!"(p1247==1)"
Detected timeout of ITS tools.
[2024-05-28 15:46:57] [INFO ] Flatten gal took : 28 ms
[2024-05-28 15:46:57] [INFO ] Applying decomposition
[2024-05-28 15:46:57] [INFO ] Flatten gal took : 28 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/graph12965431743841683692.txt' '-o' '/tmp/graph12965431743841683692.bin' '-w' '/tmp/graph12965431743841683692.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12965431743841683692.bin' '-l' '-1' '-v' '-w' '/tmp/graph12965431743841683692.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:46:57] [INFO ] Decomposing Gal with order
[2024-05-28 15:46:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:46:57] [INFO ] Removed a total of 637 redundant transitions.
[2024-05-28 15:46:57] [INFO ] Flatten gal took : 45 ms
[2024-05-28 15:46:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 602 labels/synchronizations in 21 ms.
[2024-05-28 15:46:57] [INFO ] Time to serialize gal into /tmp/LTL10763828747290468147.gal : 8 ms
[2024-05-28 15:46:57] [INFO ] Time to serialize properties into /tmp/LTL2398432817780452099.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/LTL10763828747290468147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2398432817780452099.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 : !((F("(i20.i1.u186.p1247==1)")))
Formula 0 simplified : G!"(i20.i1.u186.p1247==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-08 finished in 275632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2124 transition count 2084
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2124 transition count 2084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 2123 transition count 2083
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 2123 transition count 2083
Applied a total of 10 rules in 188 ms. Remains 2123 /2128 variables (removed 5) and now considering 2083/2088 (removed 5) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2024-05-28 15:47:13] [INFO ] Computed 361 invariants in 14 ms
[2024-05-28 15:47:13] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-05-28 15:47:13] [INFO ] Invariant cache hit.
[2024-05-28 15:47:15] [INFO ] Implicit Places using invariants and state equation in 1977 ms returned []
Implicit Place search using SMT with State Equation took 2613 ms to find 0 implicit places.
Running 2082 sub problems to find dead transitions.
[2024-05-28 15:47:15] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 2082/2082 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 0/2082 constraints, Known Traps: 0/0 constraints]
After SMT, in 60539ms problems are : Problem set: 0 solved, 2082 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Starting structural reductions in LTL mode, iteration 1 : 2123/2128 places, 2083/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63366 ms. Remains : 2123/2128 places, 2083/2088 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-09
Product exploration explored 100000 steps with 27 reset in 741 ms.
Product exploration explored 100000 steps with 28 reset in 893 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 450 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 230502 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 230502 steps, saw 215338 distinct states, run finished after 3004 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-28 15:48:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2067/2123 variables, 359/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:48:22] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 4 ms to minimize.
[2024-05-28 15:48:22] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 3 ms to minimize.
[2024-05-28 15:48:22] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 4 ms to minimize.
[2024-05-28 15:48:22] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 2 ms to minimize.
[2024-05-28 15:48:22] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 3 ms to minimize.
[2024-05-28 15:48:22] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:48:23] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:48:23] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 3 ms to minimize.
[2024-05-28 15:48:23] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 3 ms to minimize.
[2024-05-28 15:48:23] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-28 15:48:23] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:48:23] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:48:23] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:48:23] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2123 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-28 15:48:25] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2123 variables, 5/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2123 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2083/4206 variables, 2123/2509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:48:26] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 6 ms to minimize.
[2024-05-28 15:48:26] [INFO ] Deduced a trap composed of 28 places in 348 ms of which 7 ms to minimize.
[2024-05-28 15:48:26] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 6 ms to minimize.
SMT process timed out in 5288ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2123/2123 places, 2083/2083 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2123 transition count 1882
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1922 transition count 1882
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1922 transition count 1681
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1721 transition count 1681
Performed 718 Post agglomeration using F-continuation condition.Transition count delta: 718
Deduced a syphon composed of 718 places in 3 ms
Reduce places removed 718 places and 0 transitions.
Iterating global reduction 2 with 1436 rules applied. Total rules applied 2240 place count 1003 transition count 963
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 278 times.
Drop transitions (Partial Free agglomeration) removed 278 transitions
Iterating global reduction 2 with 278 rules applied. Total rules applied 2518 place count 1003 transition count 963
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2519 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2520 place count 1001 transition count 962
Applied a total of 2520 rules in 391 ms. Remains 1001 /2123 variables (removed 1122) and now considering 962/2083 (removed 1121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 1001/2123 places, 962/2083 transitions.
RANDOM walk for 7550 steps (0 resets) in 122 ms. (61 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 15:48:27] [INFO ] Invariant cache hit.
[2024-05-28 15:48:28] [INFO ] [Real]Absence check using 361 positive place invariants in 421 ms returned sat
[2024-05-28 15:48:39] [INFO ] [Real]Absence check using state equation in 10924 ms returned sat
[2024-05-28 15:48:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:48:41] [INFO ] [Nat]Absence check using 361 positive place invariants in 453 ms returned sat
[2024-05-28 15:48:54] [INFO ] [Nat]Absence check using state equation in 13034 ms returned sat
[2024-05-28 15:48:54] [INFO ] Computed and/alt/rep : 2082/4683/2082 causal constraints (skipped 0 transitions) in 101 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
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 15:48:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 2123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2123/2123 places, 2083/2083 transitions.
Applied a total of 0 rules in 92 ms. Remains 2123 /2123 variables (removed 0) and now considering 2083/2083 (removed 0) transitions.
[2024-05-28 15:48:55] [INFO ] Invariant cache hit.
[2024-05-28 15:48:55] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-05-28 15:48:55] [INFO ] Invariant cache hit.
[2024-05-28 15:48:57] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 2815 ms to find 0 implicit places.
Running 2082 sub problems to find dead transitions.
[2024-05-28 15:48:57] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 2082/2082 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 0/2082 constraints, Known Traps: 0/0 constraints]
After SMT, in 60593ms problems are : Problem set: 0 solved, 2082 unsolved
Search for dead transitions found 0 dead transitions in 60611ms
Finished structural reductions in LTL mode , in 1 iterations and 63525 ms. Remains : 2123/2123 places, 2083/2083 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 36626 steps (7 resets) in 514 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 15:49:59] [INFO ] Invariant cache hit.
[2024-05-28 15:50:00] [INFO ] [Real]Absence check using 361 positive place invariants in 387 ms returned sat
[2024-05-28 15:50:11] [INFO ] [Real]Absence check using state equation in 10855 ms returned sat
[2024-05-28 15:50:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:50:12] [INFO ] [Nat]Absence check using 361 positive place invariants in 458 ms returned sat
[2024-05-28 15:50:25] [INFO ] [Nat]Absence check using state equation in 12987 ms returned sat
[2024-05-28 15:50:26] [INFO ] Computed and/alt/rep : 2082/4683/2082 causal constraints (skipped 0 transitions) in 106 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
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 15:50:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27 reset in 772 ms.
Product exploration explored 100000 steps with 28 reset in 979 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2123/2123 places, 2083/2083 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2123 transition count 2083
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 200 place count 2123 transition count 2085
Deduced a syphon composed of 281 places in 3 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 281 place count 2123 transition count 2085
Performed 839 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1120 places in 2 ms
Iterating global reduction 1 with 839 rules applied. Total rules applied 1120 place count 2123 transition count 2085
Renaming transitions due to excessive name length > 1024 char.
Discarding 281 places :
Symmetric choice reduction at 1 with 281 rule applications. Total rules 1401 place count 1842 transition count 1804
Deduced a syphon composed of 839 places in 2 ms
Iterating global reduction 1 with 281 rules applied. Total rules applied 1682 place count 1842 transition count 1804
Deduced a syphon composed of 839 places in 1 ms
Applied a total of 1682 rules in 1111 ms. Remains 1842 /2123 variables (removed 281) and now considering 1804/2083 (removed 279) transitions.
[2024-05-28 15:50:29] [INFO ] Redundant transitions in 218 ms returned [1803]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1802 sub problems to find dead transitions.
// Phase 1: matrix 1803 rows 1842 cols
[2024-05-28 15:50:29] [INFO ] Computed 361 invariants in 18 ms
[2024-05-28 15:50:29] [INFO ] State equation strengthened by 3 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1841/3645 variables, and 0 constraints, problems are : Problem set: 0 solved, 1802 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/1842 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1802/1802 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1802 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1841/3645 variables, and 0 constraints, problems are : Problem set: 0 solved, 1802 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/1842 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1802 constraints, Known Traps: 0/0 constraints]
After SMT, in 61936ms problems are : Problem set: 0 solved, 1802 unsolved
Search for dead transitions found 0 dead transitions in 61950ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1842/2123 places, 1803/2083 transitions.
Deduced a syphon composed of 839 places in 2 ms
Applied a total of 0 rules in 54 ms. Remains 1842 /1842 variables (removed 0) and now considering 1803/1803 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63345 ms. Remains : 1842/2123 places, 1803/2083 transitions.
Built C files in :
/tmp/ltsmin4819346085696980698
[2024-05-28 15:51:31] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4819346085696980698
Running compilation step : cd /tmp/ltsmin4819346085696980698;'/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/ltsmin4819346085696980698;'/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/ltsmin4819346085696980698;'/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 2 out of 2123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2123/2123 places, 2083/2083 transitions.
Applied a total of 0 rules in 80 ms. Remains 2123 /2123 variables (removed 0) and now considering 2083/2083 (removed 0) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2024-05-28 15:51:35] [INFO ] Computed 361 invariants in 12 ms
[2024-05-28 15:51:35] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-28 15:51:35] [INFO ] Invariant cache hit.
[2024-05-28 15:51:37] [INFO ] Implicit Places using invariants and state equation in 1969 ms returned []
Implicit Place search using SMT with State Equation took 2622 ms to find 0 implicit places.
Running 2082 sub problems to find dead transitions.
[2024-05-28 15:51:37] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 2082/2082 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2082 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 1)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 1)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 1)
(s1789 1)
(s1790 1)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 1)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 1)
(s1803 1)
(s1804 1)
(s1805 1)
(s1806 1)
(s1807 1)
(s1808 1)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 1)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 1)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 1)
(s1842 1)
(s1843 timeout
1)
(s1844 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 0/2082 constraints, Known Traps: 0/0 constraints]
After SMT, in 60534ms problems are : Problem set: 0 solved, 2082 unsolved
Search for dead transitions found 0 dead transitions in 60551ms
Finished structural reductions in LTL mode , in 1 iterations and 63258 ms. Remains : 2123/2123 places, 2083/2083 transitions.
Built C files in :
/tmp/ltsmin12977110968987374895
[2024-05-28 15:52:38] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12977110968987374895
Running compilation step : cd /tmp/ltsmin12977110968987374895;'/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/ltsmin12977110968987374895;'/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/ltsmin12977110968987374895;'/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:52:41] [INFO ] Flatten gal took : 51 ms
[2024-05-28 15:52:41] [INFO ] Flatten gal took : 45 ms
[2024-05-28 15:52:41] [INFO ] Time to serialize gal into /tmp/LTL11392562554570773209.gal : 7 ms
[2024-05-28 15:52:41] [INFO ] Time to serialize properties into /tmp/LTL5340306869515463542.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/LTL11392562554570773209.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10603063897444551544.hoa' '-atoms' '/tmp/LTL5340306869515463542.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/LTL5340306869515463542.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10603063897444551544.hoa
Detected timeout of ITS tools.
[2024-05-28 15:52:56] [INFO ] Flatten gal took : 45 ms
[2024-05-28 15:52:56] [INFO ] Flatten gal took : 45 ms
[2024-05-28 15:52:56] [INFO ] Time to serialize gal into /tmp/LTL6021066902393800389.gal : 7 ms
[2024-05-28 15:52:56] [INFO ] Time to serialize properties into /tmp/LTL17507308855413021272.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/LTL6021066902393800389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17507308855413021272.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(X(F("((p1089==0)&&(p465==1))")))))
Formula 0 simplified : XXG!"((p1089==0)&&(p465==1))"
Detected timeout of ITS tools.
[2024-05-28 15:53:11] [INFO ] Flatten gal took : 45 ms
[2024-05-28 15:53:11] [INFO ] Applying decomposition
[2024-05-28 15:53:11] [INFO ] Flatten gal took : 47 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/graph5152702706645495647.txt' '-o' '/tmp/graph5152702706645495647.bin' '-w' '/tmp/graph5152702706645495647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5152702706645495647.bin' '-l' '-1' '-v' '-w' '/tmp/graph5152702706645495647.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:53:11] [INFO ] Decomposing Gal with order
[2024-05-28 15:53:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:53:12] [INFO ] Removed a total of 920 redundant transitions.
[2024-05-28 15:53:12] [INFO ] Flatten gal took : 106 ms
[2024-05-28 15:53:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-28 15:53:12] [INFO ] Time to serialize gal into /tmp/LTL7597268259152360378.gal : 22 ms
[2024-05-28 15:53:12] [INFO ] Time to serialize properties into /tmp/LTL12402116321604678659.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/LTL7597268259152360378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12402116321604678659.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 : !((X(X(F("((i17.i6.u364.p1089==0)&&(i7.i1.u158.p465==1))")))))
Formula 0 simplified : XXG!"((i17.i6.u364.p1089==0)&&(i7.i1.u158.p465==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-09 finished in 374300 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((p1&&G(p2)))))'
Support contains 3 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2123 transition count 2083
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2123 transition count 2083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 2122 transition count 2082
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 2122 transition count 2082
Applied a total of 12 rules in 216 ms. Remains 2122 /2128 variables (removed 6) and now considering 2082/2088 (removed 6) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-28 15:53:27] [INFO ] Computed 361 invariants in 12 ms
[2024-05-28 15:53:28] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-05-28 15:53:28] [INFO ] Invariant cache hit.
[2024-05-28 15:53:30] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2621 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:53:30] [INFO ] Invariant cache hit.
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 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60710ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60732ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2128 places, 2082/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63574 ms. Remains : 2122/2128 places, 2082/2088 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-10
Product exploration explored 100000 steps with 289 reset in 410 ms.
Product exploration explored 100000 steps with 278 reset in 468 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 121 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1327 steps (0 resets) in 13 ms. (94 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 139 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 15:54:32] [INFO ] Invariant cache hit.
[2024-05-28 15:54:33] [INFO ] [Real]Absence check using 361 positive place invariants in 417 ms returned sat
[2024-05-28 15:54:46] [INFO ] [Real]Absence check using state equation in 12944 ms returned sat
[2024-05-28 15:54:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:54:48] [INFO ] [Nat]Absence check using 361 positive place invariants in 432 ms returned sat
[2024-05-28 15:55:00] [INFO ] [Nat]Absence check using state equation in 11754 ms returned sat
[2024-05-28 15:55:00] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:55:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2024-05-28 15:55:00] [INFO ] Computed and/alt/rep : 2081/4682/2081 causal constraints (skipped 0 transitions) in 95 ms.
Could not prove EG (NOT p0)
Support contains 2 out of 2122 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 63 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
[2024-05-28 15:55:02] [INFO ] Invariant cache hit.
[2024-05-28 15:55:02] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-05-28 15:55:02] [INFO ] Invariant cache hit.
[2024-05-28 15:55:04] [INFO ] Implicit Places using invariants and state equation in 1888 ms returned []
Implicit Place search using SMT with State Equation took 2474 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:55:04] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60534ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60553ms
Finished structural reductions in LTL mode , in 1 iterations and 63096 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1251 steps (0 resets) in 8 ms. (139 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 15:56:05] [INFO ] Invariant cache hit.
[2024-05-28 15:56:07] [INFO ] [Real]Absence check using 361 positive place invariants in 417 ms returned sat
[2024-05-28 15:56:19] [INFO ] [Real]Absence check using state equation in 12869 ms returned sat
[2024-05-28 15:56:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:56:21] [INFO ] [Nat]Absence check using 361 positive place invariants in 439 ms returned sat
[2024-05-28 15:56:33] [INFO ] [Nat]Absence check using state equation in 11726 ms returned sat
[2024-05-28 15:56:33] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2024-05-28 15:56:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-28 15:56:33] [INFO ] Computed and/alt/rep : 2081/4682/2081 causal constraints (skipped 0 transitions) in 95 ms.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 287 reset in 364 ms.
Product exploration explored 100000 steps with 288 reset in 407 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2122 transition count 2082
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 80 Pre rules applied. Total rules applied 200 place count 2122 transition count 2084
Deduced a syphon composed of 280 places in 4 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 280 place count 2122 transition count 2084
Performed 838 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1118 places in 1 ms
Iterating global reduction 1 with 838 rules applied. Total rules applied 1118 place count 2122 transition count 2084
Renaming transitions due to excessive name length > 1024 char.
Discarding 280 places :
Symmetric choice reduction at 1 with 280 rule applications. Total rules 1398 place count 1842 transition count 1804
Deduced a syphon composed of 838 places in 1 ms
Iterating global reduction 1 with 280 rules applied. Total rules applied 1678 place count 1842 transition count 1804
Deduced a syphon composed of 838 places in 2 ms
Applied a total of 1678 rules in 418 ms. Remains 1842 /2122 variables (removed 280) and now considering 1804/2082 (removed 278) transitions.
[2024-05-28 15:56:36] [INFO ] Redundant transitions in 289 ms returned [1803]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1802 sub problems to find dead transitions.
// Phase 1: matrix 1803 rows 1842 cols
[2024-05-28 15:56:36] [INFO ] Computed 361 invariants in 16 ms
[2024-05-28 15:56:36] [INFO ] State equation strengthened by 3 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1841/3645 variables, and 0 constraints, problems are : Problem set: 0 solved, 1802 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/1842 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1802/1802 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1802 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1841/3645 variables, and 0 constraints, problems are : Problem set: 0 solved, 1802 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/1842 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1802 constraints, Known Traps: 0/0 constraints]
After SMT, in 61857ms problems are : Problem set: 0 solved, 1802 unsolved
Search for dead transitions found 0 dead transitions in 61871ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1842/2122 places, 1803/2082 transitions.
Deduced a syphon composed of 838 places in 2 ms
Applied a total of 0 rules in 51 ms. Remains 1842 /1842 variables (removed 0) and now considering 1803/1803 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62637 ms. Remains : 1842/2122 places, 1803/2082 transitions.
Built C files in :
/tmp/ltsmin2176570310313959676
[2024-05-28 15:57:38] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2176570310313959676
Running compilation step : cd /tmp/ltsmin2176570310313959676;'/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/ltsmin2176570310313959676;'/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/ltsmin2176570310313959676;'/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 2 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 92 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-28 15:57:41] [INFO ] Computed 361 invariants in 9 ms
[2024-05-28 15:57:42] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-28 15:57:42] [INFO ] Invariant cache hit.
[2024-05-28 15:57:44] [INFO ] Implicit Places using invariants and state equation in 1916 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:57:44] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60506ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60523ms
Finished structural reductions in LTL mode , in 1 iterations and 63142 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Built C files in :
/tmp/ltsmin7896480421223139851
[2024-05-28 15:58:45] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7896480421223139851
Running compilation step : cd /tmp/ltsmin7896480421223139851;'/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/ltsmin7896480421223139851;'/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/ltsmin7896480421223139851;'/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:58:48] [INFO ] Flatten gal took : 46 ms
[2024-05-28 15:58:48] [INFO ] Flatten gal took : 46 ms
[2024-05-28 15:58:48] [INFO ] Time to serialize gal into /tmp/LTL13238425604255071559.gal : 8 ms
[2024-05-28 15:58:48] [INFO ] Time to serialize properties into /tmp/LTL6662646974272994473.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/LTL13238425604255071559.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1767520092774727413.hoa' '-atoms' '/tmp/LTL6662646974272994473.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...318
Loading property file /tmp/LTL6662646974272994473.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1767520092774727413.hoa
Detected timeout of ITS tools.
[2024-05-28 15:59:03] [INFO ] Flatten gal took : 45 ms
[2024-05-28 15:59:03] [INFO ] Flatten gal took : 45 ms
[2024-05-28 15:59:03] [INFO ] Time to serialize gal into /tmp/LTL16730861122690971793.gal : 7 ms
[2024-05-28 15:59:03] [INFO ] Time to serialize properties into /tmp/LTL4371015801243242687.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/LTL16730861122690971793.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4371015801243242687.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 : !(((F("((p152==0)&&(p1438==1))"))||(X(("(p1137==0)")&&(G("(p1137==1)"))))))
Formula 0 simplified : G!"((p152==0)&&(p1438==1))" & X(!"(p1137==0)" | F!"(p1137==1)")
Detected timeout of ITS tools.
[2024-05-28 15:59:18] [INFO ] Flatten gal took : 52 ms
[2024-05-28 15:59:18] [INFO ] Applying decomposition
[2024-05-28 15:59:18] [INFO ] Flatten gal took : 49 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/graph6093516632952955948.txt' '-o' '/tmp/graph6093516632952955948.bin' '-w' '/tmp/graph6093516632952955948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6093516632952955948.bin' '-l' '-1' '-v' '-w' '/tmp/graph6093516632952955948.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:59:18] [INFO ] Decomposing Gal with order
[2024-05-28 15:59:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:59:18] [INFO ] Removed a total of 920 redundant transitions.
[2024-05-28 15:59:18] [INFO ] Flatten gal took : 77 ms
[2024-05-28 15:59:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-28 15:59:18] [INFO ] Time to serialize gal into /tmp/LTL13014254329431538407.gal : 21 ms
[2024-05-28 15:59:18] [INFO ] Time to serialize properties into /tmp/LTL17252160643514415042.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/LTL13014254329431538407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17252160643514415042.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 : !(((F("((i2.i5.u55.p152==0)&&(i23.i4.u481.p1438==1))"))||(X(("(i18.i3.u382.p1137==0)")&&(G("(i18.i3.u382.p1137==1)"))))))
Formula 0 simplified : G!"((i2.i5.u55.p152==0)&&(i23.i4.u481.p1438==1))" & X(!"(i18.i3.u382.p1137==0)" | F!"(i18.i3.u382.p1137==1)")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-10 finished in 366726 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))'
Support contains 1 out of 2128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2127 transition count 1886
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1926 transition count 1886
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1926 transition count 1685
Deduced a syphon composed of 201 places in 2 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1725 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 809 place count 1720 transition count 1680
Iterating global reduction 2 with 5 rules applied. Total rules applied 814 place count 1720 transition count 1680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 814 place count 1720 transition count 1679
Deduced a syphon composed of 1 places in 24 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 816 place count 1719 transition count 1679
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 2 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2248 place count 1003 transition count 963
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2250 place count 1001 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2251 place count 1000 transition count 961
Applied a total of 2251 rules in 254 ms. Remains 1000 /2128 variables (removed 1128) and now considering 961/2088 (removed 1127) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-28 15:59:34] [INFO ] Computed 360 invariants in 4 ms
[2024-05-28 15:59:34] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-28 15:59:34] [INFO ] Invariant cache hit.
[2024-05-28 15:59:35] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
[2024-05-28 15:59:35] [INFO ] Redundant transitions in 84 ms returned [960]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 959 sub problems to find dead transitions.
// Phase 1: matrix 960 rows 1000 cols
[2024-05-28 15:59:35] [INFO ] Computed 360 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:59:49] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 3 ms to minimize.
[2024-05-28 15:59:49] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
[2024-05-28 15:59:49] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
[2024-05-28 15:59:50] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-28 15:59:50] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:59:50] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 3 ms to minimize.
[2024-05-28 15:59:50] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 4 ms to minimize.
[2024-05-28 15:59:50] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-28 15:59:50] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-05-28 15:59:51] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:59:51] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-05-28 15:59:51] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:59:51] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 4 ms to minimize.
[2024-05-28 15:59:51] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:59:52] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2024-05-28 15:59:52] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:59:52] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2024-05-28 15:59:52] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-05-28 15:59:52] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:59:52] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 3 ms to minimize.
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:59:53] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:59:54] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:59:55] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:59:56] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:59:56] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-28 15:59:56] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:59:56] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:59:56] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:59:56] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:59:56] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:59:56] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:59:57] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:59:57] [INFO ] Deduced a trap composed of 14 places in 57 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 420 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:00:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 16:00:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:00:06] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:00:06] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:00:07] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:00:07] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:00:07] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:00:08] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-28 16:00:08] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:00:08] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:00:08] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:00:08] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:00:08] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:00:08] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:00:09] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:00:09] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:00:09] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:00:09] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:00:09] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:00:10] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:00:10] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 16:00:11] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:00:11] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:00:11] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:00:12] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:00:12] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:00:13] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:00:13] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:00:13] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:00:13] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:00:14] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:00:14] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:00:14] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 3 ms to minimize.
[2024-05-28 16:00:14] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:00:15] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2024-05-28 16:00:15] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:00:15] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 3 ms to minimize.
[2024-05-28 16:00:16] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:00:16] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:00:16] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:00:18] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 4 ms to minimize.
[2024-05-28 16:00:19] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:00:21] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:00:21] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:00:22] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:00:22] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:00:22] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:00:22] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:00:23] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:00:23] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:00:23] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:00:24] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 4 ms to minimize.
[2024-05-28 16:00:24] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:00:24] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 3 ms to minimize.
[2024-05-28 16:00:25] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 4 ms to minimize.
[2024-05-28 16:00:25] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 3 ms to minimize.
[2024-05-28 16:00:26] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:00:30] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:00:30] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 16:00:30] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:00:30] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:00:33] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:00:33] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:00:33] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:00:34] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:00:34] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:00:35] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:00:35] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:00:35] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:00:35] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 490 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 130/130 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/2128 places, 960/2088 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61871 ms. Remains : 1000/2128 places, 960/2088 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-11
Product exploration explored 100000 steps with 85 reset in 721 ms.
Product exploration explored 100000 steps with 85 reset in 938 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 4667 steps (0 resets) in 46 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-28 16:00:37] [INFO ] Invariant cache hit.
[2024-05-28 16:00:38] [INFO ] [Real]Absence check using 360 positive place invariants in 150 ms returned sat
[2024-05-28 16:00:39] [INFO ] [Real]Absence check using state equation in 1426 ms returned sat
[2024-05-28 16:00:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:00:40] [INFO ] [Nat]Absence check using 360 positive place invariants in 145 ms returned sat
[2024-05-28 16:00:42] [INFO ] [Nat]Absence check using state equation in 1500 ms returned sat
[2024-05-28 16:00:42] [INFO ] Computed and/alt/rep : 959/2388/959 causal constraints (skipped 0 transitions) in 45 ms.
Could not prove EG (NOT p0)
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Applied a total of 0 rules in 36 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-05-28 16:00:55] [INFO ] Invariant cache hit.
[2024-05-28 16:00:55] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-28 16:00:55] [INFO ] Invariant cache hit.
[2024-05-28 16:00:56] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
[2024-05-28 16:00:56] [INFO ] Redundant transitions in 86 ms returned []
Running 959 sub problems to find dead transitions.
[2024-05-28 16:00:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:01:10] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 4 ms to minimize.
[2024-05-28 16:01:10] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 4 ms to minimize.
[2024-05-28 16:01:10] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:01:10] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:01:10] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:01:10] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:01:11] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 4 ms to minimize.
[2024-05-28 16:01:11] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:01:11] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 4 ms to minimize.
[2024-05-28 16:01:11] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:01:11] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:01:12] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:01:12] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:01:12] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:01:12] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:01:12] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:01:12] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:01:13] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:01:13] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-05-28 16:01:13] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:01:13] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:01:13] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:01:13] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 3 ms to minimize.
[2024-05-28 16:01:13] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:01:14] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:01:14] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:01:14] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:01:14] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:01:14] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:01:14] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:01:14] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:01:14] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:01:15] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:01:15] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:01:15] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:01:15] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:01:15] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-28 16:01:15] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:01:15] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:01:15] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:01:15] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:01:15] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:01:16] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:01:16] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:01:16] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:01:16] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:01:16] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 16:01:16] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:01:16] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:01:16] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:01:16] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:01:16] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:01:16] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:01:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:01:17] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-28 16:01:17] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:01:17] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:01:17] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:01:17] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:01:17] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 420 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:01:27] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 16:01:27] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-28 16:01:28] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:01:28] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:01:28] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:01:28] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:01:29] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:01:29] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:01:29] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:01:29] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:01:29] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:01:29] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:01:29] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:01:29] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:01:30] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:01:30] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:01:30] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:01:30] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-28 16:01:30] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:01:30] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:01:31] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:01:32] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:01:33] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:01:33] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:01:33] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:01:33] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:01:33] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-05-28 16:01:34] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:01:34] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:01:34] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:01:34] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:01:34] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:01:35] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:01:35] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:01:35] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:01:35] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:01:36] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:01:36] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:01:36] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:01:37] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:01:38] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:01:38] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:01:38] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:01:39] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:01:40] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 3 ms to minimize.
[2024-05-28 16:01:41] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:01:41] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:01:42] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:01:42] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:01:42] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:01:42] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:01:43] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:01:43] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:01:43] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 4 ms to minimize.
[2024-05-28 16:01:44] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:01:44] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 4 ms to minimize.
[2024-05-28 16:01:44] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 4 ms to minimize.
[2024-05-28 16:01:45] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 5 ms to minimize.
[2024-05-28 16:01:45] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 4 ms to minimize.
[2024-05-28 16:01:45] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:01:46] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 16:01:46] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:01:48] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:01:48] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:01:49] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:01:49] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:01:50] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:01:51] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 4 ms to minimize.
[2024-05-28 16:01:52] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 4 ms to minimize.
[2024-05-28 16:01:53] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 4 ms to minimize.
[2024-05-28 16:01:53] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 491 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 131/131 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61643 ms. Remains : 1000/1000 places, 960/960 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 4591 steps (0 resets) in 49 ms. (91 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-28 16:01:57] [INFO ] Invariant cache hit.
[2024-05-28 16:01:57] [INFO ] [Real]Absence check using 360 positive place invariants in 133 ms returned sat
[2024-05-28 16:01:59] [INFO ] [Real]Absence check using state equation in 1456 ms returned sat
[2024-05-28 16:01:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:01:59] [INFO ] [Nat]Absence check using 360 positive place invariants in 149 ms returned sat
[2024-05-28 16:02:01] [INFO ] [Nat]Absence check using state equation in 1587 ms returned sat
[2024-05-28 16:02:01] [INFO ] Computed and/alt/rep : 959/2388/959 causal constraints (skipped 0 transitions) in 45 ms.
[2024-05-28 16:02:14] [INFO ] Added : 605 causal constraints over 121 iterations in 12719 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 85 reset in 735 ms.
Product exploration explored 100000 steps with 86 reset in 887 ms.
Built C files in :
/tmp/ltsmin16916469547569822213
[2024-05-28 16:02:15] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-28 16:02:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:02:15] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-28 16:02:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:02:16] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-28 16:02:16] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:02:16] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16916469547569822213
Running compilation step : cd /tmp/ltsmin16916469547569822213;'/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/ltsmin16916469547569822213;'/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/ltsmin16916469547569822213;'/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 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-05-28 16:02:19] [INFO ] Invariant cache hit.
[2024-05-28 16:02:19] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-28 16:02:19] [INFO ] Invariant cache hit.
[2024-05-28 16:02:20] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
[2024-05-28 16:02:20] [INFO ] Redundant transitions in 90 ms returned []
Running 959 sub problems to find dead transitions.
[2024-05-28 16:02:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:02:34] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 4 ms to minimize.
[2024-05-28 16:02:34] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 4 ms to minimize.
[2024-05-28 16:02:34] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:02:35] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:02:35] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:02:35] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 4 ms to minimize.
[2024-05-28 16:02:35] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:02:35] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:02:36] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:02:36] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:02:36] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:02:36] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:02:36] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:02:36] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:02:37] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:02:37] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 4 ms to minimize.
[2024-05-28 16:02:37] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:02:37] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:02:37] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:02:37] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:02:38] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 3 ms to minimize.
[2024-05-28 16:02:38] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:02:38] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:02:38] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 3 ms to minimize.
[2024-05-28 16:02:38] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:02:38] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:02:38] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:02:38] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:02:39] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:02:39] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:02:39] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:02:39] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:02:39] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:02:39] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:02:39] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:02:39] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:02:39] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:02:39] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:02:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:02:41] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:02:41] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:02:41] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:02:41] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:02:41] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:02:41] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:02:41] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:02:41] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:02:42] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:02:42] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 420 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:02:51] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 16:02:51] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:02:52] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:02:52] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:02:52] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:02:52] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:02:53] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:02:53] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:02:53] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:02:53] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:02:53] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:02:53] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:02:53] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:02:53] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:02:54] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:02:54] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:02:54] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:02:54] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:02:54] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:02:54] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:02:55] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:02:56] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:02:57] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:02:57] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:02:57] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:02:57] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:02:57] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:02:58] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:02:58] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:02:58] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:02:58] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:02:58] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:02:59] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:02:59] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:02:59] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-28 16:02:59] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:03:00] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:03:00] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:03:00] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:03:01] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:03:02] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:03:02] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:03:02] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:03:05] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:03:05] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:03:06] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:03:06] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:03:06] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:03:06] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:03:07] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:03:07] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:03:07] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 4 ms to minimize.
[2024-05-28 16:03:08] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 4 ms to minimize.
[2024-05-28 16:03:08] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:03:08] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 4 ms to minimize.
[2024-05-28 16:03:09] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 4 ms to minimize.
[2024-05-28 16:03:09] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:03:09] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:03:10] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 16:03:10] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:03:12] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:03:12] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:03:13] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:03:13] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:03:14] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:03:15] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 4 ms to minimize.
[2024-05-28 16:03:16] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:03:17] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 4 ms to minimize.
[2024-05-28 16:03:17] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 491 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 131/131 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61581 ms. Remains : 1000/1000 places, 960/960 transitions.
Built C files in :
/tmp/ltsmin2537582159834223346
[2024-05-28 16:03:20] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-28 16:03:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:03:20] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-28 16:03:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:03:20] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-28 16:03:20] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:03:20] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2537582159834223346
Running compilation step : cd /tmp/ltsmin2537582159834223346;'/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/ltsmin2537582159834223346;'/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/ltsmin2537582159834223346;'/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:23] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:03:23] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:03:23] [INFO ] Time to serialize gal into /tmp/LTL8537949271399969004.gal : 4 ms
[2024-05-28 16:03:23] [INFO ] Time to serialize properties into /tmp/LTL11362582277896788611.prop : 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/LTL8537949271399969004.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17230983255482702266.hoa' '-atoms' '/tmp/LTL11362582277896788611.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/LTL11362582277896788611.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17230983255482702266.hoa
Detected timeout of ITS tools.
[2024-05-28 16:03:39] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:03:39] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:03:39] [INFO ] Time to serialize gal into /tmp/LTL11865017196629136575.gal : 5 ms
[2024-05-28 16:03:39] [INFO ] Time to serialize properties into /tmp/LTL273384743885033091.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/LTL11865017196629136575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL273384743885033091.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...275
Read 1 LTL properties
Checking formula 0 : !((F("(p954==1)")))
Formula 0 simplified : G!"(p954==1)"
Detected timeout of ITS tools.
[2024-05-28 16:03:54] [INFO ] Flatten gal took : 31 ms
[2024-05-28 16:03:54] [INFO ] Applying decomposition
[2024-05-28 16:03:54] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16277418704875894425.txt' '-o' '/tmp/graph16277418704875894425.bin' '-w' '/tmp/graph16277418704875894425.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16277418704875894425.bin' '-l' '-1' '-v' '-w' '/tmp/graph16277418704875894425.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:03:54] [INFO ] Decomposing Gal with order
[2024-05-28 16:03:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:03:54] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-28 16:03:54] [INFO ] Flatten gal took : 40 ms
[2024-05-28 16:03:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 7 ms.
[2024-05-28 16:03:54] [INFO ] Time to serialize gal into /tmp/LTL8948456781415421429.gal : 7 ms
[2024-05-28 16:03:54] [INFO ] Time to serialize properties into /tmp/LTL10048623091460967738.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/LTL8948456781415421429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10048623091460967738.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 : !((F("(i15.i2.u141.p954==1)")))
Formula 0 simplified : G!"(i15.i2.u141.p954==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-11 finished in 275404 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||X(F(p1))))))'
Support contains 4 out of 2128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2127 transition count 1887
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1927 transition count 1887
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 400 place count 1927 transition count 1688
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 798 place count 1728 transition count 1688
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 802 place count 1724 transition count 1684
Iterating global reduction 2 with 4 rules applied. Total rules applied 806 place count 1724 transition count 1684
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 806 place count 1724 transition count 1683
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 808 place count 1723 transition count 1683
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 2 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2240 place count 1007 transition count 967
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2242 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2243 place count 1004 transition count 965
Applied a total of 2243 rules in 248 ms. Remains 1004 /2128 variables (removed 1124) and now considering 965/2088 (removed 1123) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2024-05-28 16:04:09] [INFO ] Computed 360 invariants in 4 ms
[2024-05-28 16:04:10] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-28 16:04:10] [INFO ] Invariant cache hit.
[2024-05-28 16:04:10] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2024-05-28 16:04:11] [INFO ] Redundant transitions in 90 ms returned [964]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 961 sub problems to find dead transitions.
// Phase 1: matrix 964 rows 1004 cols
[2024-05-28 16:04:11] [INFO ] Computed 360 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:04:24] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 4 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 4 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 4 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 4 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:04:28] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:04:28] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:04:28] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2024-05-28 16:04:28] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:04:28] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 3 ms to minimize.
[2024-05-28 16:04:28] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:04:29] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:04:29] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:04:29] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 3 ms to minimize.
[2024-05-28 16:04:29] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:04:29] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:04:29] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:04:29] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:04:29] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:04:29] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:04:30] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:04:30] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:04:30] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:04:30] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:04:30] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:04:30] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:04:30] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:04:30] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:04:30] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:04:30] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:04:30] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:04:31] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:04:31] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:04:31] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:04:31] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:04:31] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:04:31] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-28 16:04:31] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:04:32] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-28 16:04:32] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:04:32] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:04:32] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:04:32] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:04:32] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:04:32] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:04:33] [INFO ] Deduced a trap composed of 16 places in 64 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1002/1968 variables, and 412 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 352/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 60/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:04:41] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:04:42] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:04:42] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:04:42] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 16:04:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:04:42] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:04:43] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:04:43] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:04:43] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:04:44] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:04:44] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:04:44] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:04:44] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:04:44] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:04:45] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:04:45] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:04:45] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:04:46] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:04:46] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:04:46] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:04:46] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:04:46] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:04:47] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:04:47] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:04:48] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:04:48] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:04:48] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:04:48] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:04:49] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:04:49] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:04:49] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:04:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:04:50] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:04:50] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:04:50] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:04:51] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:04:51] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:04:51] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:04:51] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:04:51] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:04:52] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:04:54] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:04:54] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:04:54] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:04:55] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:04:55] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:04:56] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:04:56] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:04:56] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:04:56] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:04:56] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:04:57] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:04:57] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:04:57] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:04:57] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:04:57] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:04:58] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:04:58] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:04:58] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-28 16:04:58] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1002 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:05:00] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:05:00] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:05:01] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:05:04] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:05:08] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:05:08] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:05:08] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:05:08] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:05:09] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:05:09] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 16:05:09] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 16:05:09] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:05:10] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:05:10] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:05:10] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:05:10] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:05:11] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1002/1968 variables, and 489 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 352/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 137/137 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/2128 places, 964/2088 transitions.
Applied a total of 0 rules in 18 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61889 ms. Remains : 1004/2128 places, 964/2088 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-12
Product exploration explored 100000 steps with 2600 reset in 643 ms.
Product exploration explored 100000 steps with 2787 reset in 817 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 431 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 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 499 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 16:05:14] [INFO ] Invariant cache hit.
[2024-05-28 16:05:14] [INFO ] [Real]Absence check using 360 positive place invariants in 148 ms returned sat
[2024-05-28 16:05:16] [INFO ] [Real]Absence check using state equation in 2070 ms returned sat
[2024-05-28 16:05:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:05:17] [INFO ] [Nat]Absence check using 360 positive place invariants in 147 ms returned sat
[2024-05-28 16:05:19] [INFO ] [Nat]Absence check using state equation in 1520 ms returned sat
[2024-05-28 16:05:19] [INFO ] Computed and/alt/rep : 959/2395/959 causal constraints (skipped 2 transitions) in 52 ms.
[2024-05-28 16:05:28] [INFO ] Added : 536 causal constraints over 108 iterations in 9064 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 25 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2024-05-28 16:05:28] [INFO ] Invariant cache hit.
[2024-05-28 16:05:28] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-28 16:05:28] [INFO ] Invariant cache hit.
[2024-05-28 16:05:29] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
[2024-05-28 16:05:29] [INFO ] Redundant transitions in 88 ms returned []
Running 961 sub problems to find dead transitions.
[2024-05-28 16:05:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:05:43] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 4 ms to minimize.
[2024-05-28 16:05:43] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 4 ms to minimize.
[2024-05-28 16:05:43] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-05-28 16:05:44] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:05:44] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 4 ms to minimize.
[2024-05-28 16:05:44] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:05:44] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:05:44] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:05:44] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:05:45] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:05:45] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:05:45] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 4 ms to minimize.
[2024-05-28 16:05:45] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:05:45] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:05:45] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:05:46] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:05:46] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:05:46] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:05:46] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:05:46] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:05:47] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 3 ms to minimize.
[2024-05-28 16:05:47] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:05:47] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 3 ms to minimize.
[2024-05-28 16:05:47] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 3 ms to minimize.
[2024-05-28 16:05:47] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:05:47] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:05:47] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:05:47] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:05:47] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:05:48] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:05:48] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:05:48] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:05:48] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:05:48] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:05:48] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-28 16:05:48] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:05:48] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:05:48] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:05:48] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:05:48] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:05:49] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:05:49] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:05:49] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:05:49] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:05:49] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:05:49] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:05:49] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:05:49] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:05:49] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:05:49] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:05:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:05:50] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:05:50] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:05:50] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:05:50] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:05:50] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:05:51] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:05:51] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:05:51] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:05:51] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.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 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 1.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 1.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 1.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 1.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 1.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 0.0)
(s735 1.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 1.0)
(s740 0.0)
(s741 1.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 1.0)
(s747 1.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 1.0)
(s753 0.0)
(s754 0.0)
(s755 1.0)
(s756 0.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 1.0)
(s761 0.0)
(s762 1.0)
(s763 0.0)
(s764 1.0)
(s765 0.0)
(s766 1.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 1.0)
(s772 1.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1002/1968 variables, and 412 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 352/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 60/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:06:00] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:06:00] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 16:06:00] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:06:00] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:06:00] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:06:01] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:06:01] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:06:01] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:06:01] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:06:02] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:06:02] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:06:02] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:06:02] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-28 16:06:02] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:06:03] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:06:03] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:06:03] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:06:03] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:06:03] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:06:04] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:06:04] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 16:06:05] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:06:06] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:06:06] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:06:07] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:06:07] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:06:07] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:06:07] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:06:08] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:06:08] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:06:08] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:06:08] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:06:08] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:06:08] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:06:08] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:06:09] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:06:09] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:06:09] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:06:09] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:06:09] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:06:10] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:06:11] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:06:11] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:06:13] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:06:13] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:06:14] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:06:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:06:14] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:06:14] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:06:15] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:06:15] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:06:15] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:06:15] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:06:15] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:06:15] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:06:16] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:06:16] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:06:16] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:06:16] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:06:20] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1002 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:06:22] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:06:23] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:06:23] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:06:24] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:06:24] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:06:29] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:06:29] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1002/1968 variables, and 479 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 352/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 127/127 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61608 ms. Remains : 1004/1004 places, 964/964 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 413 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 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 495 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 16:06:30] [INFO ] Invariant cache hit.
[2024-05-28 16:06:31] [INFO ] [Real]Absence check using 360 positive place invariants in 152 ms returned sat
[2024-05-28 16:06:33] [INFO ] [Real]Absence check using state equation in 2057 ms returned sat
[2024-05-28 16:06:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:06:34] [INFO ] [Nat]Absence check using 360 positive place invariants in 158 ms returned sat
[2024-05-28 16:06:36] [INFO ] [Nat]Absence check using state equation in 1469 ms returned sat
[2024-05-28 16:06:36] [INFO ] Computed and/alt/rep : 959/2395/959 causal constraints (skipped 2 transitions) in 45 ms.
[2024-05-28 16:06:44] [INFO ] Added : 536 causal constraints over 108 iterations in 8742 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2859 reset in 634 ms.
Product exploration explored 100000 steps with 2651 reset in 833 ms.
Built C files in :
/tmp/ltsmin16096969982196706812
[2024-05-28 16:06:46] [INFO ] Computing symmetric may disable matrix : 964 transitions.
[2024-05-28 16:06:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:06:46] [INFO ] Computing symmetric may enable matrix : 964 transitions.
[2024-05-28 16:06:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:06:46] [INFO ] Computing Do-Not-Accords matrix : 964 transitions.
[2024-05-28 16:06:46] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:06:46] [INFO ] Built C files in 174ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16096969982196706812
Running compilation step : cd /tmp/ltsmin16096969982196706812;'/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/ltsmin16096969982196706812;'/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/ltsmin16096969982196706812;'/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 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 17 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2024-05-28 16:06:49] [INFO ] Invariant cache hit.
[2024-05-28 16:06:49] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-28 16:06:49] [INFO ] Invariant cache hit.
[2024-05-28 16:06:50] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2024-05-28 16:06:50] [INFO ] Redundant transitions in 89 ms returned []
Running 961 sub problems to find dead transitions.
[2024-05-28 16:06:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:07:04] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 3 ms to minimize.
[2024-05-28 16:07:04] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 4 ms to minimize.
[2024-05-28 16:07:04] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 4 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 4 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 3 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 3 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 3 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:07:10] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:07:10] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:07:10] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:07:10] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:07:10] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:07:10] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 16:07:10] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:07:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:07:10] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:07:10] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:07:11] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:07:11] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:07:11] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:07:11] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:07:11] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:07:11] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:07:11] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:07:12] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:07:12] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:07:12] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:07:12] [INFO ] Deduced a trap composed of 22 places in 64 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1002/1968 variables, and 412 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 352/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 60/412 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:07:21] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:07:21] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 16:07:21] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:07:22] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:07:22] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:07:22] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:07:22] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:07:23] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:07:23] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:07:23] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:07:23] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-28 16:07:23] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-28 16:07:23] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:07:24] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:07:24] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:07:24] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:07:24] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-28 16:07:24] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:07:25] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:07:25] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:07:25] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:07:27] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:07:27] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:07:28] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:07:28] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:07:28] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:07:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:07:29] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:07:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:07:29] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:07:29] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:07:29] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:07:29] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:07:30] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:07:30] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:07:30] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:07:30] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:07:30] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:07:30] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:07:31] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1002 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:07:32] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:07:32] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:07:32] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-28 16:07:34] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:07:34] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:07:35] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:07:35] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:07:35] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:07:36] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:07:36] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:07:36] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:07:36] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:07:36] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:07:37] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:07:37] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:07:37] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:07:37] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:07:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:07:37] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-28 16:07:41] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1002 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:07:43] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:07:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:07:44] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:07:45] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:07:45] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:07:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:07:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1002/1968 variables, and 479 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 352/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 127/127 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61610 ms. Remains : 1004/1004 places, 964/964 transitions.
Built C files in :
/tmp/ltsmin7166092549581546541
[2024-05-28 16:07:51] [INFO ] Computing symmetric may disable matrix : 964 transitions.
[2024-05-28 16:07:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:07:51] [INFO ] Computing symmetric may enable matrix : 964 transitions.
[2024-05-28 16:07:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:07:51] [INFO ] Computing Do-Not-Accords matrix : 964 transitions.
[2024-05-28 16:07:51] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:07:51] [INFO ] Built C files in 161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7166092549581546541
Running compilation step : cd /tmp/ltsmin7166092549581546541;'/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/ltsmin7166092549581546541;'/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/ltsmin7166092549581546541;'/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:07:54] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:07:54] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:07:54] [INFO ] Time to serialize gal into /tmp/LTL7473621603186395056.gal : 5 ms
[2024-05-28 16:07:54] [INFO ] Time to serialize properties into /tmp/LTL10600901989947980093.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/LTL7473621603186395056.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11749345869031425241.hoa' '-atoms' '/tmp/LTL10600901989947980093.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/LTL10600901989947980093.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11749345869031425241.hoa
Detected timeout of ITS tools.
[2024-05-28 16:08:09] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:08:09] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:08:09] [INFO ] Time to serialize gal into /tmp/LTL13109266860072350288.gal : 4 ms
[2024-05-28 16:08:09] [INFO ] Time to serialize properties into /tmp/LTL1357541613575190933.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/LTL13109266860072350288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1357541613575190933.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 : !((F(G((X(F("((p1499==0)&&(p2154==1))")))||("((p53==0)&&(p1257==1))")))))
Formula 0 simplified : G(F!"((p53==0)&&(p1257==1))" & FG!"((p1499==0)&&(p2154==1))")
Detected timeout of ITS tools.
[2024-05-28 16:08:24] [INFO ] Flatten gal took : 32 ms
[2024-05-28 16:08:24] [INFO ] Applying decomposition
[2024-05-28 16:08:24] [INFO ] Flatten gal took : 27 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/graph6701128317909898001.txt' '-o' '/tmp/graph6701128317909898001.bin' '-w' '/tmp/graph6701128317909898001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6701128317909898001.bin' '-l' '-1' '-v' '-w' '/tmp/graph6701128317909898001.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:08:24] [INFO ] Decomposing Gal with order
[2024-05-28 16:08:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:08:24] [INFO ] Removed a total of 637 redundant transitions.
[2024-05-28 16:08:24] [INFO ] Flatten gal took : 37 ms
[2024-05-28 16:08:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 606 labels/synchronizations in 7 ms.
[2024-05-28 16:08:24] [INFO ] Time to serialize gal into /tmp/LTL7393592878124996604.gal : 7 ms
[2024-05-28 16:08:24] [INFO ] Time to serialize properties into /tmp/LTL4641934769638356655.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/LTL7393592878124996604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4641934769638356655.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G((X(F("((i24.i1.u224.p1499==0)&&(i35.i2.u323.p2154==1))")))||("((i0.i0.u1.p53==0)&&(i20.i1.u187.p1257==1))")))))
Formula 0 simplified : G(F!"((i0.i0.u1.p53==0)&&(i20.i1.u187.p1257==1))" & FG!"((i24.i1.u224.p1499==0)&&(i35.i2.u323.p2154==1))")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-12 finished in 270438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p1) U G(!p2))))'
Support contains 5 out of 2128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2127 transition count 1888
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 1928 transition count 1887
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 1927 transition count 1887
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 400 place count 1927 transition count 1687
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 800 place count 1727 transition count 1687
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 803 place count 1724 transition count 1684
Iterating global reduction 3 with 3 rules applied. Total rules applied 806 place count 1724 transition count 1684
Performed 714 Post agglomeration using F-continuation condition.Transition count delta: 714
Deduced a syphon composed of 714 places in 2 ms
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 3 with 1428 rules applied. Total rules applied 2234 place count 1010 transition count 970
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2236 place count 1008 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2237 place count 1007 transition count 968
Applied a total of 2237 rules in 299 ms. Remains 1007 /2128 variables (removed 1121) and now considering 968/2088 (removed 1120) transitions.
// Phase 1: matrix 968 rows 1007 cols
[2024-05-28 16:08:40] [INFO ] Computed 360 invariants in 4 ms
[2024-05-28 16:08:40] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-28 16:08:40] [INFO ] Invariant cache hit.
[2024-05-28 16:08:41] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2024-05-28 16:08:41] [INFO ] Redundant transitions in 88 ms returned [967]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 963 sub problems to find dead transitions.
// Phase 1: matrix 967 rows 1007 cols
[2024-05-28 16:08:41] [INFO ] Computed 360 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1004 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-28 16:08:54] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 16:08:54] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 16:08:58] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:09:08] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1004 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 963 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1004/1974 variables, and 24 constraints, problems are : Problem set: 0 solved, 963 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/360 constraints, State Equation: 0/1007 constraints, PredecessorRefiner: 963/963 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 963 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1004 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1004 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1004 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 3 (OVERLAPS) 3/1007 variables, 340/364 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-28 16:09:26] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 4 ms to minimize.
[2024-05-28 16:09:26] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:09:26] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:09:26] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:09:27] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:09:27] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:09:27] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:09:27] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 4 ms to minimize.
[2024-05-28 16:09:27] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:09:28] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 4 ms to minimize.
[2024-05-28 16:09:28] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:09:28] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 4 ms to minimize.
[2024-05-28 16:09:28] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:09:28] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:09:28] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:09:29] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:09:29] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:09:29] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:09:29] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:09:29] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 3 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1007 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:09:33] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:09:33] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:09:33] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-28 16:09:33] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:09:33] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-28 16:09:33] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:09:33] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:09:33] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:09:33] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:09:34] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:09:34] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:09:35] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:09:35] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:09:35] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:09:35] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:09:35] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:09:36] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:09:36] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:09:36] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:09:36] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:09:36] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:09:36] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:09:37] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:09:37] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:09:37] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2024-05-28 16:09:37] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:09:38] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:09:39] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:09:39] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:09:39] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:09:40] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:09:40] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:09:40] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2024-05-28 16:09:41] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:09:41] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:09:41] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:09:41] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 1)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 1)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 1)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 0)
(s304 1)
(s305 0)
(s306 1)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 1)
(s330 0)
(s331 1)
(s332 0)
(s333 1)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 1)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 0)
(s352 1)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 1)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 1)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 0)
(s423 1)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 0)
(s442 1)
(s443 0)
(s444 1)
(s445 0)
(s446 0)
(s447 0)
(s448 1)
(s449 0)
(s450 0)
(s451 0)
(s452 1)
(s453 0)
(s454 1)
(s455 0)
(s456 1)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 0)
(s467 1)
(s468 0)
(s469 1)
(s470 0)
(s471 0)
(s472 0)
(s473 1)
(s474 0)
(s475 0)
(s476 0)
(s477 1)
(s478 0)
(s479 1)
(s480 0)
(s481 0)
(s482 1)
(s483 1)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 0)
(s492 1)
(s493 0)
(s494 1)
(s495 0)
(s496 0)
(s497 0)
(s498 1)
(s499 0)
(s500 0)
(s501 0)
(s502 1)
(s503 0)
(s504 1)
(s505 0)
(s506 1)
(s507 0)
(s508 0)
(s509 1)
(s510 0)
(s511 1)
(s512 1)
(s513 0)
(s514 0)
(s515 0)
(s516 1)
(s517 0)
(s518 0)
(s519 1)
(s520 0)
(s521 0)
(s522 0)
(s523 1)
(s524 0)
(s525 0)
(s526 0)
(s527 1)
(s528 0)
(s529 1)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 0)
(s541 0)
(s542 1)
(s543 0)
(s544 1)
(s545 0)
(s546 0)
(s547 0)
(s548 1)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 1)
(s554 0)
(s555 0)
(s556 1)
(s557 0)
(s558 1)
(s559 0)
(s560 0)
(s561 1)
(s562 0)
(s563 1)
(s564 0)
(s565 0)
(s566 1)
(s567 0)
(s568 0)
(s569 1)
(s570 0)
(s571 0)
(s572 1)
(s573 0)
(s574 0)
(s575 0)
(s576 1)
(s577 0)
(s578 1)
(s579 0)
(s580 0)
(s581 1)
(s582 0)
(s583 1)
(s584 0)
(s585 0)
(s586 1)
(s587 0)
(s588 1)
(s589 0)
(s590 0)
(s591 1)
(s592 0)
(s593 0)
(s594 1)
(s595 0)
(s596 0)
(s597 1)
(s598 0)
(s599 0)
(s600 0)
(s601 1)
(s602 0)
(s603 0)
(s604 1)
(s605 1)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 1)
(s614 0)
(s615 0)
(s616 1)
(s617 0)
(s618 0)
(s619 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1974 variables, and 456 constraints, problems are : Problem set: 0 solved, 963 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1007 constraints, PredecessorRefiner: 0/963 constraints, Known Traps: 96/96 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 963 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1007/2128 places, 967/2088 transitions.
Applied a total of 0 rules in 26 ms. Remains 1007 /1007 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62016 ms. Remains : 1007/2128 places, 967/2088 transitions.
Stuttering acceptance computed with spot in 95 ms :[p2, (NOT p1), p2]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-13
Stuttering criterion allowed to conclude after 2064 steps with 0 reset in 15 ms.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-13 finished in 62151 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((G(F(p0))||(p1&&F(G(p1)))))))'
Support contains 3 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2124 transition count 2084
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2124 transition count 2084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 2123 transition count 2083
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 2123 transition count 2083
Applied a total of 10 rules in 202 ms. Remains 2123 /2128 variables (removed 5) and now considering 2083/2088 (removed 5) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2024-05-28 16:09:42] [INFO ] Computed 361 invariants in 9 ms
[2024-05-28 16:09:42] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-28 16:09:42] [INFO ] Invariant cache hit.
[2024-05-28 16:09:44] [INFO ] Implicit Places using invariants and state equation in 1915 ms returned []
Implicit Place search using SMT with State Equation took 2506 ms to find 0 implicit places.
Running 2082 sub problems to find dead transitions.
[2024-05-28 16:09:44] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.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 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 2082/2082 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 0/2082 constraints, Known Traps: 0/0 constraints]
After SMT, in 60531ms problems are : Problem set: 0 solved, 2082 unsolved
Search for dead transitions found 0 dead transitions in 60549ms
Starting structural reductions in LTL mode, iteration 1 : 2123/2128 places, 2083/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63262 ms. Remains : 2123/2128 places, 2083/2088 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-14
Product exploration explored 100000 steps with 26 reset in 743 ms.
Product exploration explored 100000 steps with 25 reset in 911 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 29947 steps (5 resets) in 302 ms. (98 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 96 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2123 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 : 2123/2123 places, 2083/2083 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2122 transition count 1881
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1921 transition count 1881
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1921 transition count 1680
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1720 transition count 1680
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 2 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2236 place count 1004 transition count 964
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2238 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2239 place count 1001 transition count 962
Applied a total of 2239 rules in 209 ms. Remains 1001 /2123 variables (removed 1122) and now considering 962/2083 (removed 1121) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2024-05-28 16:10:48] [INFO ] Computed 360 invariants in 3 ms
[2024-05-28 16:10:48] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-28 16:10:48] [INFO ] Invariant cache hit.
[2024-05-28 16:10:49] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
[2024-05-28 16:10:49] [INFO ] Redundant transitions in 89 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 960 sub problems to find dead transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 16:10:49] [INFO ] Computed 360 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:11:03] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 4 ms to minimize.
[2024-05-28 16:11:03] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 4 ms to minimize.
[2024-05-28 16:11:03] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:11:03] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:11:04] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 4 ms to minimize.
[2024-05-28 16:11:04] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:11:04] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:11:04] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:11:04] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 4 ms to minimize.
[2024-05-28 16:11:05] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 4 ms to minimize.
[2024-05-28 16:11:05] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:11:05] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 4 ms to minimize.
[2024-05-28 16:11:05] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 4 ms to minimize.
[2024-05-28 16:11:05] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:11:06] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:11:06] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 4 ms to minimize.
[2024-05-28 16:11:06] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 4 ms to minimize.
[2024-05-28 16:11:06] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 4 ms to minimize.
[2024-05-28 16:11:06] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:11:07] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:11:07] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:11:07] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:11:07] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 3 ms to minimize.
[2024-05-28 16:11:07] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:11:07] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:11:07] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 3 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:11:11] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:11:11] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:11:11] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:11:11] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:11:11] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1962 variables, and 420 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:11:20] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 16:11:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:11:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:11:21] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:11:21] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:11:21] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:11:21] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:11:21] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:11:22] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:11:22] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:11:22] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:11:22] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:11:22] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:11:22] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:11:23] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-28 16:11:23] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:11:23] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:11:23] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:11:24] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:11:24] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:11:24] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 16:11:25] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-28 16:11:26] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:11:26] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:11:27] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:11:27] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:11:28] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:11:28] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 3 ms to minimize.
[2024-05-28 16:11:28] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:11:28] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:11:29] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:11:29] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:11:29] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:11:29] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:11:30] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:11:30] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:11:30] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:11:31] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:11:31] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:11:31] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:11:31] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:11:33] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:11:34] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:11:35] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:11:37] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:11:37] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 4 ms to minimize.
[2024-05-28 16:11:37] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:11:38] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 4 ms to minimize.
[2024-05-28 16:11:38] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:11:38] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 4 ms to minimize.
[2024-05-28 16:11:39] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 4 ms to minimize.
[2024-05-28 16:11:39] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:11:39] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 3 ms to minimize.
[2024-05-28 16:11:43] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:11:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:11:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:11:44] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:11:44] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 16:11:44] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:11:45] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:11:47] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1962 variables, and 481 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 121/121 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2123 places, 961/2083 transitions.
Applied a total of 0 rules in 16 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61806 ms. Remains : 1001/2123 places, 961/2083 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 72 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 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7924 steps (1 resets) in 76 ms. (102 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 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 62 reset in 714 ms.
Product exploration explored 100000 steps with 60 reset in 906 ms.
Built C files in :
/tmp/ltsmin15454059294284987493
[2024-05-28 16:11:51] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-28 16:11:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:51] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-28 16:11:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:51] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-28 16:11:51] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:51] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15454059294284987493
Running compilation step : cd /tmp/ltsmin15454059294284987493;'/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/ltsmin15454059294284987493;'/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/ltsmin15454059294284987493;'/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 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1000 transition count 960
Applied a total of 2 rules in 37 ms. Remains 1000 /1001 variables (removed 1) and now considering 960/961 (removed 1) transitions.
// Phase 1: matrix 960 rows 1000 cols
[2024-05-28 16:11:54] [INFO ] Computed 360 invariants in 2 ms
[2024-05-28 16:11:55] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-28 16:11:55] [INFO ] Invariant cache hit.
[2024-05-28 16:11:56] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
[2024-05-28 16:11:56] [INFO ] Redundant transitions in 86 ms returned []
Running 959 sub problems to find dead transitions.
[2024-05-28 16:11:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:12:09] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 4 ms to minimize.
[2024-05-28 16:12:10] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:12:10] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 4 ms to minimize.
[2024-05-28 16:12:10] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 4 ms to minimize.
[2024-05-28 16:12:10] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:12:10] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:12:11] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:12:11] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:12:11] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 4 ms to minimize.
[2024-05-28 16:12:11] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:12:11] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:12:11] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:12:12] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:12:12] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:12:12] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:12:12] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:12:12] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:12:12] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 3 ms to minimize.
[2024-05-28 16:12:12] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
[2024-05-28 16:12:13] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:12:13] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:12:13] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:12:13] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 3 ms to minimize.
[2024-05-28 16:12:13] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:12:13] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:12:13] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 420 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:12:27] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 16:12:27] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:12:27] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:12:28] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:12:28] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:12:28] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-28 16:12:28] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:12:28] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:12:28] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-28 16:12:29] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:12:29] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:12:29] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:12:29] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:12:29] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:12:30] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:12:30] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:12:30] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:12:30] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:12:31] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:12:31] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:12:31] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 16:12:32] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:12:32] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:12:33] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:12:33] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:12:34] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:12:34] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:12:34] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 3 ms to minimize.
[2024-05-28 16:12:35] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:12:35] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:12:35] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-05-28 16:12:35] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:12:36] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 3 ms to minimize.
[2024-05-28 16:12:36] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:12:36] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:12:36] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:12:37] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:12:37] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:12:37] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:12:38] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:12:42] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 4 ms to minimize.
[2024-05-28 16:12:43] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 4 ms to minimize.
[2024-05-28 16:12:43] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 4 ms to minimize.
[2024-05-28 16:12:43] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 4 ms to minimize.
[2024-05-28 16:12:44] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:12:44] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 4 ms to minimize.
[2024-05-28 16:12:44] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 4 ms to minimize.
[2024-05-28 16:12:45] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:12:45] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 5 ms to minimize.
[2024-05-28 16:12:45] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 4 ms to minimize.
[2024-05-28 16:12:46] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:12:46] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 4 ms to minimize.
[2024-05-28 16:12:46] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 4 ms to minimize.
[2024-05-28 16:12:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:12:50] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:12:50] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:12:51] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 16:12:51] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:12:51] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:12:52] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 16:12:53] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:12:53] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:12:53] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:12:53] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:12:53] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:12:54] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:12:55] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:12:56] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 488 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 128/128 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1001 places, 960/961 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61632 ms. Remains : 1000/1001 places, 960/961 transitions.
Built C files in :
/tmp/ltsmin6572711060598033901
[2024-05-28 16:12:56] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-28 16:12:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:12:56] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-28 16:12:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:12:56] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-28 16:12:56] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:12:56] [INFO ] Built C files in 150ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6572711060598033901
Running compilation step : cd /tmp/ltsmin6572711060598033901;'/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/ltsmin6572711060598033901;'/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/ltsmin6572711060598033901;'/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:12:59] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:12:59] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:12:59] [INFO ] Time to serialize gal into /tmp/LTL11229302783512928580.gal : 4 ms
[2024-05-28 16:12:59] [INFO ] Time to serialize properties into /tmp/LTL1958873455404740904.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/LTL11229302783512928580.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5946118339093105928.hoa' '-atoms' '/tmp/LTL1958873455404740904.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...318
Loading property file /tmp/LTL1958873455404740904.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5946118339093105928.hoa
Detected timeout of ITS tools.
[2024-05-28 16:13:14] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:13:14] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:13:14] [INFO ] Time to serialize gal into /tmp/LTL2132664236294507909.gal : 5 ms
[2024-05-28 16:13:14] [INFO ] Time to serialize properties into /tmp/LTL16425964858988509927.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/LTL2132664236294507909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16425964858988509927.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(X((G(F("((p745==0)||(p2269==1))")))||(("(p537==1)")&&(F(G("(p537==1)"))))))))
Formula 0 simplified : XX(FG!"((p745==0)||(p2269==1))" & (!"(p537==1)" | GF!"(p537==1)"))
Detected timeout of ITS tools.
[2024-05-28 16:13:29] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:13:29] [INFO ] Applying decomposition
[2024-05-28 16:13:30] [INFO ] Flatten gal took : 27 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/graph5796785435086442329.txt' '-o' '/tmp/graph5796785435086442329.bin' '-w' '/tmp/graph5796785435086442329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5796785435086442329.bin' '-l' '-1' '-v' '-w' '/tmp/graph5796785435086442329.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:13:30] [INFO ] Decomposing Gal with order
[2024-05-28 16:13:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:13:30] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-28 16:13:30] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:13:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 620 labels/synchronizations in 9 ms.
[2024-05-28 16:13:30] [INFO ] Time to serialize gal into /tmp/LTL14026538953960686552.gal : 6 ms
[2024-05-28 16:13:30] [INFO ] Time to serialize properties into /tmp/LTL5148543839468190722.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/LTL14026538953960686552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5148543839468190722.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 : !((X(X((G(F("((i11.i2.u108.p745==0)||(i37.i2.u341.p2269==1))")))||(("(i8.i0.u77.p537==1)")&&(F(G("(i8.i0.u77.p537==1)"))))))))
Formula 0 simplified : XX(FG!"((i11.i2.u108.p745==0)||(i37.i2.u341.p2269==1))" & (!"(i8.i0.u77.p537==1)" | GF!"(i8.i0.u77.p537==1)"))
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-14 finished in 243261 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((X(p1)||p0))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-040B-LTLCardinality-03
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2127 transition count 1886
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1926 transition count 1886
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 402 place count 1926 transition count 1687
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 800 place count 1727 transition count 1687
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 805 place count 1722 transition count 1682
Iterating global reduction 2 with 5 rules applied. Total rules applied 810 place count 1722 transition count 1682
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 810 place count 1722 transition count 1681
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 812 place count 1721 transition count 1681
Performed 713 Post agglomeration using F-continuation condition.Transition count delta: 713
Deduced a syphon composed of 713 places in 2 ms
Reduce places removed 713 places and 0 transitions.
Iterating global reduction 2 with 1426 rules applied. Total rules applied 2238 place count 1008 transition count 968
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2240 place count 1006 transition count 966
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2241 place count 1005 transition count 966
Applied a total of 2241 rules in 293 ms. Remains 1005 /2128 variables (removed 1123) and now considering 966/2088 (removed 1122) transitions.
// Phase 1: matrix 966 rows 1005 cols
[2024-05-28 16:13:45] [INFO ] Computed 360 invariants in 2 ms
[2024-05-28 16:13:46] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-28 16:13:46] [INFO ] Invariant cache hit.
[2024-05-28 16:13:47] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
Running 961 sub problems to find dead transitions.
[2024-05-28 16:13:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 344/344 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:14:00] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:14:01] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:14:01] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:14:01] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:14:01] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:14:01] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:14:01] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:14:02] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:14:02] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:14:02] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:14:02] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:14:02] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:14:02] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:14:02] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:14:03] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:14:03] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 3 ms to minimize.
[2024-05-28 16:14:03] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:14:03] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 3 ms to minimize.
[2024-05-28 16:14:03] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:14:03] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:14:05] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 16:14:06] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:14:06] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 16:14:06] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:14:06] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:14:06] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:14:06] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:14:06] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:14:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:14:06] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:14:07] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-28 16:14:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:14:07] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:14:07] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:14:07] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:14:07] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:14:08] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1971 variables, and 404 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 344/360 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 344/344 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/404 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:14:17] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:14:18] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:14:18] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 16:14:18] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:14:18] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:14:18] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:14:19] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:14:19] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:14:19] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:14:19] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:14:20] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:14:20] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:14:20] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:14:22] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:14:22] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 16:14:22] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-28 16:14:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:14:23] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:14:25] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:14:25] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:14:25] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:14:25] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:14:26] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:14:26] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:14:26] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:14:26] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:14:26] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:14:27] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:14:27] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:14:27] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:14:27] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:14:28] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:14:28] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:14:29] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:14:29] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 16:14:29] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:14:31] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:14:32] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:14:32] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:14:33] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:14:33] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:14:33] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:14:33] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:14:34] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:14:34] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:14:34] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:14:34] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:14:38] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:14:38] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 16:14:38] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 16:14:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:14:38] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 16:14:39] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:14:39] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:14:39] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:14:39] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:14:40] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:14:40] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:14:41] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:14:41] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-28 16:14:44] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:14:44] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s293 1)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 1)
(s309 0)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 1)
(s334 0)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 0)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 0)
(s371 1)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 1)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 1)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 0)
(s433 1)
(s434 0)
(s435 1)
(s436 0)
(s437 0)
(s438 1)
(s439 1)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 1)
(s449 0)
(s450 1)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 1)
(s459 0)
(s460 0)
(s461 1)
(s462 1)
(s463 0)
(s464 1)
(s465 0)
(s466 1)
(s467 0)
(s468 0)
(s469 1)
(s470 0)
(s471 0)
(s472 0)
(s473 1)
(s474 0)
(s475 1)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 1)
(s482 0)
(s483 1)
(s484 0)
(s485 1)
(s486 0)
(s487 0)
(s488 1)
(s489 1)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 0)
(s497 0)
(s498 1)
(s499 0)
(s500 1)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 1)
(s507 0)
(s508 1)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 1)
(s515 0)
(s516 1)
(s517 0)
(s518 0)
(s519 1)
(s520 0)
(s521 0)
(s523 1)
(s524 1)
(s525 0)
(s526 1)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 0)
(s536 1)
(s537 0)
(s538 0)
(s539 1)
(s540 1)
(s541 0)
(s542 1)
(s543 0)
(s544 0)
(s545 1)
(s546 0)
(s547 0)
(s548 0)
(s549 1)
(s550 0)
(s551 1)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 1)
(s558 0)
(s559 1)
(s560 0)
(s561 0)
(s562 1)
(s563 0)
(s564 1)
(s565 1)
(s566 0)
(s567 1)
(s568 0)
(s569 0)
(s570 1)
(s571 0)
(s572 0)
(s573 0)
(s574 1)
(s575 0)
(s576 1)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 1)
(s583 0)
(s584 1)
(s585 0)
(s586 0)
(s587 1)
(s588 0)
(s589 1)
(s590 1)
(s591 0)
(s592 1)
(s593 0)
(s594 0)
(s595 1)
(s596 0)
(s597 0)
(s598 0)
(s599 1)
(s600 0)
(s601 1)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 1)
(s608 0)
(s609 1)
(s610 0)
(s611 0)
(s612 1)
(s613 0)
(s614 1)
(s615 1)
(s616 0)
(s617 1)
(s618 0)
(s619 0)
(s620 1)
(s621 0)
(s622 0)
(s623 0)
(s624 1)
(s625 0)
(s626 1)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 1)
(s633 0)
(s634 1)
(s635 0)
(s636 0)
(s637 1)
(s638 0)
(s639 1)
(s640 1)
(s641 0)
(s642 1)
(s643 0)
(s644 0)
(s645 1)
(s646 0)
(s647 0)
(s648 0)
(s649 1)
(s650 0)
(s651 1)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 1)
(s658 0)
(s659 1)
(s660 0)
(s661 0)
(s662 1)
(s663 0)
(s664 1)
(s665 1)
(s666 0)
(s667 1)
(s668 0)
(s669 0)
(s670 1)
(s671 0)
(s672 0)
(s673 0)
(s674 1)
(s675 0)
(s676 1)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 1)
(s683 0)
(s684 1)
(s685 0)
(s686 1)
(s687 0)
(s688 0)
(s689 1)
(s690 1)
(s691 0)
(s692 1)
(s693 0)
(s694 0)
(s695 1)
(s696 0)
(s697 0)
(s698 0)
(s699 1)
(s700 0)
(s701 1)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 1)
(s708 0)
(s709 1)
(s710 0)
(s711 1)
(s712 0)
(s713 0)
(s714 1)
(s715 1)
(s716 0)
(s717 1)
(s718 0)
(s719 0)
(s720 1)
(s721 0)
(s722 0)
(s723 0)
(s724 1)
(s725 0)
(s726 1)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 1)
(s733 0)
(s734 1)
(s735 0)
(s736 1)
(s737 0)
(s738 0)
(s739 1)
(s740 1)
(s741 0)
(s742 1)
(s743 0)
(s744 0)
(s745 1)
(s746 0)
(s747 0)
(s748 0)
(s749 1)
(s750 0)
(s751 1)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 1)
(s758 0)
(s759 1)
(s760 0)
(s761 0)
(s762 1)
(s763 0)
(s764 1)
(s765 1)
(s766 0)
(s767 1)
(s768 0)
(s769 0)
(s770 1)
(s771 0)
(s772 0)
(s773 0)
(s774 1)
(s775 0)
(s776 1)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 1)
(s783 0)
(s784 1)
(s785 0)
(s786 0)
(s787 1)
(s788 0)
(s789 1)
(s790 1)
(s791 0)
(s792 1)
(s793 0)
(s794 0)
(s795 1)
(s796 0)
(s797 0)
(s798 0)
(s799 1)
(s800 0)
(s801 1)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 1)
(s808 0)
(s809 1)
(s810 0)
(s811 0)
(s812 1)
(s813 0)
(s814 1)
(s815 1)
(s816 0)
(s817 1)
(s818 0)
(s819 0)
(s820 1)
(s821 0)
(s822 0)
(s823 0)
(s824 1)
(s825 0)
(s826 1)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 1)
(s833 0)
(s834 1)
(s835 0)
(s836 0)
(s837 1)
(s838 0)
(s839 1)
(s840 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1971 variables, and 473 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 344/360 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 129/129 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1005/2128 places, 966/2088 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61816 ms. Remains : 1005/2128 places, 966/2088 transitions.
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 4140 steps with 2 reset in 31 ms.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-03 finished in 62097 ms.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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&&F(G(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ShieldIIPs-PT-040B-LTLCardinality-09
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2127 transition count 1886
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1926 transition count 1886
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1926 transition count 1685
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1725 transition count 1685
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 808 place count 1721 transition count 1681
Iterating global reduction 2 with 4 rules applied. Total rules applied 812 place count 1721 transition count 1681
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 812 place count 1721 transition count 1680
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 814 place count 1720 transition count 1680
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 2 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2246 place count 1004 transition count 964
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2248 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2249 place count 1001 transition count 962
Applied a total of 2249 rules in 268 ms. Remains 1001 /2128 variables (removed 1127) and now considering 962/2088 (removed 1126) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2024-05-28 16:14:48] [INFO ] Computed 360 invariants in 4 ms
[2024-05-28 16:14:48] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-28 16:14:48] [INFO ] Invariant cache hit.
[2024-05-28 16:14:49] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
Running 961 sub problems to find dead transitions.
[2024-05-28 16:14:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:15:03] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:15:03] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-05-28 16:15:04] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 4 ms to minimize.
[2024-05-28 16:15:04] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:15:04] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:15:04] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 3 ms to minimize.
[2024-05-28 16:15:05] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:15:05] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 4 ms to minimize.
[2024-05-28 16:15:05] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:15:05] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 4 ms to minimize.
[2024-05-28 16:15:05] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 4 ms to minimize.
[2024-05-28 16:15:05] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 4 ms to minimize.
[2024-05-28 16:15:06] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 4 ms to minimize.
[2024-05-28 16:15:06] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:15:06] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:15:06] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:15:06] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:15:07] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:15:07] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:15:07] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:15:07] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:15:07] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:15:07] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:15:08] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:15:08] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:15:08] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 3 ms to minimize.
[2024-05-28 16:15:08] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:15:08] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:15:08] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:15:08] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:15:09] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 3 ms to minimize.
[2024-05-28 16:15:09] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:15:09] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:15:09] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:15:09] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 3 ms to minimize.
[2024-05-28 16:15:09] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:15:09] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:15:09] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:15:10] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:15:10] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:15:10] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:15:10] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:15:10] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:15:10] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:15:10] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-28 16:15:10] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:15:10] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:15:10] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:15:10] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:15:11] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:15:11] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:15:11] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:15:11] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:15:11] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:15:11] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:15:11] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:15:11] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:15:11] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:15:12] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:15:12] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1963 variables, and 420 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:15:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:15:20] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:15:20] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-28 16:15:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:15:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:15:20] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:15:21] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-28 16:15:21] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:15:21] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:15:21] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:15:21] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:15:22] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:15:22] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:15:22] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:15:22] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:15:22] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:15:22] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:15:23] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:15:23] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:15:23] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:15:24] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:15:24] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:15:25] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:15:25] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:15:25] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:15:26] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:15:26] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:15:26] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:15:26] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:15:27] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:15:27] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:15:27] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-05-28 16:15:27] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:15:27] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:15:28] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:15:28] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 3 ms to minimize.
[2024-05-28 16:15:28] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:15:29] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:15:29] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:15:29] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:15:29] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:15:30] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:15:31] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:15:31] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:15:33] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:15:33] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:15:34] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:15:34] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:15:34] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 11 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:15:36] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:15:36] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:15:36] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:15:37] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:15:37] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 4 ms to minimize.
[2024-05-28 16:15:37] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:15:38] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:15:43] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:15:43] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 4 ms to minimize.
[2024-05-28 16:15:44] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 4 ms to minimize.
[2024-05-28 16:15:45] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 4 ms to minimize.
[2024-05-28 16:15:45] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 3 ms to minimize.
[2024-05-28 16:15:45] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 4 ms to minimize.
[2024-05-28 16:15:46] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1963 variables, and 487 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 127/127 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1001/2128 places, 962/2088 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61747 ms. Remains : 1001/2128 places, 962/2088 transitions.
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-09
Product exploration explored 100000 steps with 66 reset in 706 ms.
Product exploration explored 100000 steps with 65 reset in 909 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 6253 steps (0 resets) in 61 ms. (100 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 16:15:51] [INFO ] Invariant cache hit.
[2024-05-28 16:15:52] [INFO ] [Real]Absence check using 360 positive place invariants in 149 ms returned sat
[2024-05-28 16:15:53] [INFO ] [Real]Absence check using state equation in 1582 ms returned sat
[2024-05-28 16:15:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:15:54] [INFO ] [Nat]Absence check using 360 positive place invariants in 146 ms returned sat
[2024-05-28 16:15:56] [INFO ] [Nat]Absence check using state equation in 1516 ms returned sat
[2024-05-28 16:15:56] [INFO ] Computed and/alt/rep : 961/2394/961 causal constraints (skipped 0 transitions) in 45 ms.
Could not prove EG (NOT p0)
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 962/962 transitions.
Applied a total of 0 rules in 14 ms. Remains 1001 /1001 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2024-05-28 16:16:09] [INFO ] Invariant cache hit.
[2024-05-28 16:16:09] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-28 16:16:09] [INFO ] Invariant cache hit.
[2024-05-28 16:16:10] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
Running 961 sub problems to find dead transitions.
[2024-05-28 16:16:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:16:23] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:16:24] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-05-28 16:16:24] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:16:24] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-05-28 16:16:24] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:16:24] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 4 ms to minimize.
[2024-05-28 16:16:24] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:16:25] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:16:25] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 4 ms to minimize.
[2024-05-28 16:16:25] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:16:25] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:16:25] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:16:26] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:16:26] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:16:26] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:16:26] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:16:26] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:16:26] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:16:27] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:16:27] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:16:27] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:16:27] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2024-05-28 16:16:27] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:16:28] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:16:28] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2024-05-28 16:16:28] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:16:28] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:16:28] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:16:28] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-05-28 16:16:28] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:16:29] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:16:29] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:16:29] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:16:29] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 3 ms to minimize.
[2024-05-28 16:16:29] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:16:29] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:16:29] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:16:29] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:16:29] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:16:30] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:16:31] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 16:16:31] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:16:31] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:16:31] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:16:31] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:16:31] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:16:31] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-28 16:16:31] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1963 variables, and 420 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:16:42] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:16:42] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:16:42] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:16:42] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:16:42] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:16:42] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:16:43] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:16:43] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:16:43] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:16:43] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:16:43] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:16:43] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:16:44] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:16:44] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:16:45] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:16:45] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-28 16:16:46] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:16:46] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:16:46] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:16:47] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:16:47] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:16:47] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:16:47] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:16:47] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:16:48] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:16:48] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:16:48] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:16:48] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:16:49] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 3 ms to minimize.
[2024-05-28 16:16:49] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:16:49] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:16:49] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:16:50] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:16:50] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:16:50] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-28 16:16:51] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:16:51] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:16:52] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:16:54] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:16:54] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:16:54] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:16:55] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:16:55] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:16:55] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:16:56] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:16:56] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:16:56] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:16:56] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:16:57] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-28 16:16:57] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:16:57] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:16:58] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 4 ms to minimize.
[2024-05-28 16:16:58] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
[2024-05-28 16:16:58] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:17:03] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:17:04] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 4 ms to minimize.
[2024-05-28 16:17:04] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 4 ms to minimize.
[2024-05-28 16:17:05] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:17:05] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 4 ms to minimize.
[2024-05-28 16:17:05] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 4 ms to minimize.
[2024-05-28 16:17:06] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 4 ms to minimize.
[2024-05-28 16:17:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:17:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:17:10] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1963 variables, and 490 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 130/130 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in LTL mode , in 1 iterations and 61465 ms. Remains : 1001/1001 places, 962/962 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 6153 steps (0 resets) in 73 ms. (83 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 16:17:11] [INFO ] Invariant cache hit.
[2024-05-28 16:17:11] [INFO ] [Real]Absence check using 360 positive place invariants in 148 ms returned sat
[2024-05-28 16:17:13] [INFO ] [Real]Absence check using state equation in 1572 ms returned sat
[2024-05-28 16:17:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:17:14] [INFO ] [Nat]Absence check using 360 positive place invariants in 143 ms returned sat
[2024-05-28 16:17:15] [INFO ] [Nat]Absence check using state equation in 1389 ms returned sat
[2024-05-28 16:17:15] [INFO ] Computed and/alt/rep : 961/2394/961 causal constraints (skipped 0 transitions) in 50 ms.
[2024-05-28 16:17:28] [INFO ] Added : 680 causal constraints over 136 iterations in 12903 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 66 reset in 715 ms.
Product exploration explored 100000 steps with 65 reset in 923 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 962/962 transitions.
Applied a total of 0 rules in 21 ms. Remains 1001 /1001 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2024-05-28 16:17:30] [INFO ] Redundant transitions in 90 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 960 sub problems to find dead transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 16:17:30] [INFO ] Computed 360 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:17:44] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 4 ms to minimize.
[2024-05-28 16:17:44] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 4 ms to minimize.
[2024-05-28 16:17:44] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 4 ms to minimize.
[2024-05-28 16:17:44] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:17:44] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:17:44] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 4 ms to minimize.
[2024-05-28 16:17:45] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 4 ms to minimize.
[2024-05-28 16:17:45] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:17:45] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:17:45] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:17:45] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:17:45] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:17:46] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:17:46] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:17:46] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:17:46] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:17:46] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 3 ms to minimize.
[2024-05-28 16:17:46] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 3 ms to minimize.
[2024-05-28 16:17:46] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:17:47] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:17:47] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:17:47] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:17:47] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:17:47] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 3 ms to minimize.
[2024-05-28 16:17:47] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:17:47] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:17:48] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:17:48] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:17:48] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:17:48] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:17:48] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:17:48] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:17:48] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:17:48] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:17:48] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:17:48] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-05-28 16:17:48] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:17:49] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:17:50] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:17:50] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:17:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:17:50] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:17:50] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:17:50] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:17:50] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:17:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:17:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:17:51] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:17:51] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1962 variables, and 420 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:18:01] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:18:02] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:18:02] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:18:02] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:18:02] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:18:02] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:18:03] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:18:03] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:18:03] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:18:03] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:18:04] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:18:04] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:18:04] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:18:04] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:18:04] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:18:04] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:18:05] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:18:06] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:18:07] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:18:07] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:18:07] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:18:08] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:18:08] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:18:08] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:18:08] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:18:08] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 3 ms to minimize.
[2024-05-28 16:18:09] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:18:09] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:18:09] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:18:10] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:18:10] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:18:10] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:18:10] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:18:10] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:18:11] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:18:11] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:18:11] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:18:12] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:18:12] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:18:13] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:18:14] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:18:16] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:18:16] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:18:16] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:18:17] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:18:17] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:18:17] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:18:17] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 4 ms to minimize.
[2024-05-28 16:18:18] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:18:18] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 4 ms to minimize.
[2024-05-28 16:18:18] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:18:19] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 4 ms to minimize.
[2024-05-28 16:18:19] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:18:19] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 3 ms to minimize.
[2024-05-28 16:18:20] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:18:20] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:18:20] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 16:18:22] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:18:23] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:18:23] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:18:23] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:18:24] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:18:26] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:18:26] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:18:27] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 4 ms to minimize.
[2024-05-28 16:18:28] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1962 variables, and 489 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 129/129 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/1001 places, 961/962 transitions.
Applied a total of 0 rules in 16 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60358 ms. Remains : 1001/1001 places, 961/962 transitions.
Built C files in :
/tmp/ltsmin542041594709138857
[2024-05-28 16:18:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin542041594709138857
Running compilation step : cd /tmp/ltsmin542041594709138857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2069 ms.
Running link step : cd /tmp/ltsmin542041594709138857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin542041594709138857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9965393090962760031.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 962/962 transitions.
Applied a total of 0 rules in 20 ms. Remains 1001 /1001 variables (removed 0) and now considering 962/962 (removed 0) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2024-05-28 16:18:45] [INFO ] Computed 360 invariants in 3 ms
[2024-05-28 16:18:46] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-28 16:18:46] [INFO ] Invariant cache hit.
[2024-05-28 16:18:46] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
Running 961 sub problems to find dead transitions.
[2024-05-28 16:18:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:19:00] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 3 ms to minimize.
[2024-05-28 16:19:00] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 4 ms to minimize.
[2024-05-28 16:19:00] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 4 ms to minimize.
[2024-05-28 16:19:01] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:19:01] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 4 ms to minimize.
[2024-05-28 16:19:01] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 3 ms to minimize.
[2024-05-28 16:19:01] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:19:02] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:19:02] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:19:02] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 4 ms to minimize.
[2024-05-28 16:19:02] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:19:02] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:19:03] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:19:03] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:19:03] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:19:03] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:19:03] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:19:03] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:19:04] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:19:04] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:19:04] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:19:04] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:19:04] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:19:05] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:19:05] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:19:05] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 3 ms to minimize.
[2024-05-28 16:19:05] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:19:05] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:19:05] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:19:06] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:19:06] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 3 ms to minimize.
[2024-05-28 16:19:06] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
[2024-05-28 16:19:06] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:19:06] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 3 ms to minimize.
[2024-05-28 16:19:06] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:19:06] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:19:06] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 3 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:19:09] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:19:09] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:19:09] [INFO ] Deduced a trap composed of 19 places in 45 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1963 variables, and 420 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:19:18] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:19:18] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:19:18] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:19:18] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:19:18] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:19:18] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:19:18] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:19:20] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:19:20] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:19:20] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:19:20] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:19:20] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:19:21] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:19:21] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:19:22] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:19:22] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:19:23] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:19:23] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:19:23] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:19:24] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:19:24] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:19:24] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:19:24] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:19:25] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 3 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:19:26] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:19:27] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:19:27] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:19:27] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:19:27] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:19:28] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:19:29] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:19:30] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:19:31] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:19:32] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:19:32] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:19:32] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:19:33] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:19:33] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:19:33] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:19:33] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:19:34] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:19:34] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 4 ms to minimize.
[2024-05-28 16:19:34] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 4 ms to minimize.
[2024-05-28 16:19:35] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 3 ms to minimize.
[2024-05-28 16:19:35] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 4 ms to minimize.
[2024-05-28 16:19:35] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:19:36] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 4 ms to minimize.
[2024-05-28 16:19:36] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 16:19:41] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:19:42] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 4 ms to minimize.
[2024-05-28 16:19:42] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 4 ms to minimize.
[2024-05-28 16:19:43] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 4 ms to minimize.
[2024-05-28 16:19:43] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 4 ms to minimize.
[2024-05-28 16:19:44] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:19:44] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 1)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 1)
(s259 0)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 1)
(s284 0)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 1)
(s296 0)
(s297 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1963 variables, and 487 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 127/127 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Finished structural reductions in LTL mode , in 1 iterations and 61546 ms. Remains : 1001/1001 places, 962/962 transitions.
Built C files in :
/tmp/ltsmin17298105051658757737
[2024-05-28 16:19:47] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17298105051658757737
Running compilation step : cd /tmp/ltsmin17298105051658757737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2218 ms.
Running link step : cd /tmp/ltsmin17298105051658757737;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17298105051658757737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2784317143292464054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 16:20:02] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:20:02] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:20:02] [INFO ] Time to serialize gal into /tmp/LTL5388230397556637097.gal : 4 ms
[2024-05-28 16:20:02] [INFO ] Time to serialize properties into /tmp/LTL4586098360168395256.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/LTL5388230397556637097.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16661869649452911702.hoa' '-atoms' '/tmp/LTL4586098360168395256.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...318
Loading property file /tmp/LTL4586098360168395256.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16661869649452911702.hoa
Detected timeout of ITS tools.
[2024-05-28 16:20:17] [INFO ] Flatten gal took : 25 ms
[2024-05-28 16:20:17] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:20:17] [INFO ] Time to serialize gal into /tmp/LTL5455532528257106112.gal : 4 ms
[2024-05-28 16:20:17] [INFO ] Time to serialize properties into /tmp/LTL11681907024478828674.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/LTL5455532528257106112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11681907024478828674.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(X(F("((p1089==0)&&(p465==1))")))))
Formula 0 simplified : XXG!"((p1089==0)&&(p465==1))"
Detected timeout of ITS tools.
[2024-05-28 16:20:32] [INFO ] Flatten gal took : 28 ms
[2024-05-28 16:20:32] [INFO ] Applying decomposition
[2024-05-28 16:20:32] [INFO ] Flatten gal took : 27 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/graph4301604199455503261.txt' '-o' '/tmp/graph4301604199455503261.bin' '-w' '/tmp/graph4301604199455503261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4301604199455503261.bin' '-l' '-1' '-v' '-w' '/tmp/graph4301604199455503261.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:20:32] [INFO ] Decomposing Gal with order
[2024-05-28 16:20:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:20:32] [INFO ] Removed a total of 637 redundant transitions.
[2024-05-28 16:20:32] [INFO ] Flatten gal took : 37 ms
[2024-05-28 16:20:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 608 labels/synchronizations in 6 ms.
[2024-05-28 16:20:32] [INFO ] Time to serialize gal into /tmp/LTL15891768525540629773.gal : 7 ms
[2024-05-28 16:20:32] [INFO ] Time to serialize properties into /tmp/LTL14312618032886193590.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/LTL15891768525540629773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14312618032886193590.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(X(F("((i17.i1.u161.p1089==0)&&(i7.i2.u64.p465==1))")))))
Formula 0 simplified : XXG!"((i17.i1.u161.p1089==0)&&(i7.i2.u64.p465==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-09 finished in 360259 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((p1&&G(p2)))))'
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))'
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||X(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||(p1&&F(G(p1)))))))'
[2024-05-28 16:20:48] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6084969491169168366
[2024-05-28 16:20:48] [INFO ] Too many transitions (2088) to apply POR reductions. Disabling POR matrices.
[2024-05-28 16:20:48] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6084969491169168366
[2024-05-28 16:20:48] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin6084969491169168366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '102' '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:20:48] [INFO ] Flatten gal took : 48 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/graph10434491020573517408.txt' '-o' '/tmp/graph10434491020573517408.bin' '-w' '/tmp/graph10434491020573517408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10434491020573517408.bin' '-l' '-1' '-v' '-w' '/tmp/graph10434491020573517408.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:20:48] [INFO ] Decomposing Gal with order
[2024-05-28 16:20:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:20:48] [INFO ] Removed a total of 920 redundant transitions.
[2024-05-28 16:20:48] [INFO ] Flatten gal took : 72 ms
[2024-05-28 16:20:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-28 16:20:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality7453307246913742316.gal : 17 ms
[2024-05-28 16:20:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality18130537935935185414.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/LTLCardinality7453307246913742316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18130537935935185414.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 7 LTL properties
Checking formula 0 : !((F(("(i16.i4.u347.p1038==0)")&&(F(G("(i16.i4.u347.p1038==0)"))))))
Formula 0 simplified : GF!"(i16.i4.u347.p1038==0)"
Compilation finished in 5395 ms.
Running link step : cd /tmp/ltsmin6084969491169168366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6084969491169168366;'/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)&&<>([]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>64 s) on command cd /tmp/ltsmin6084969491169168366;'/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)&&<>([]((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6084969491169168366;'/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' '<>((LTLAPp3==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>64 s) on command cd /tmp/ltsmin6084969491169168366;'/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' '<>((LTLAPp3==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6084969491169168366;'/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(X(<>((LTLAPp4==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>64 s) on command cd /tmp/ltsmin6084969491169168366;'/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(X(<>((LTLAPp4==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6084969491169168366;'/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' '(<>((LTLAPp5==true))||X(((LTLAPp6==true)&&[]((LTLAPp7==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>64 s) on command cd /tmp/ltsmin6084969491169168366;'/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' '(<>((LTLAPp5==true))||X(((LTLAPp6==true)&&[]((LTLAPp7==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6084969491169168366;'/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' '<>((LTLAPp8==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>64 s) on command cd /tmp/ltsmin6084969491169168366;'/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' '<>((LTLAPp8==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6084969491169168366;'/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' '<>([](((LTLAPp9==true)||X(<>((LTLAPp10==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>64 s) on command cd /tmp/ltsmin6084969491169168366;'/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' '<>([](((LTLAPp9==true)||X(<>((LTLAPp10==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6084969491169168366;'/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(X(([](<>((LTLAPp11==true)))||((LTLAPp12==true)&&<>([]((LTLAPp12==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>64 s) on command cd /tmp/ltsmin6084969491169168366;'/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(X(([](<>((LTLAPp11==true)))||((LTLAPp12==true)&&<>([]((LTLAPp12==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4112 s
Running LTSmin : cd /tmp/ltsmin6084969491169168366;'/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)&&<>([]((LTLAPp2==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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600