About the Execution of LTSMin+red for DatabaseWithMutex-COL-20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5234.783 | 3600000.00 | 12467617.00 | 3741.80 | TF?FT?F?TF?FFFFF | normal |
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.r488-tall-171631131800028.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 ltsminxred
Input is DatabaseWithMutex-COL-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631131800028
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.1K Apr 11 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 11 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 20:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 19:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K May 18 16:42 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 DatabaseWithMutex-COL-20-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-COL-20-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717179681209
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:21:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:21:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:21:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 18:21:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 18:21:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 555 ms
[2024-05-31 18:21:23] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 3260 PT places and 3200.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 18:21:23] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 5 ms.
[2024-05-31 18:21:23] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-20-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 13 to 10
RANDOM walk for 3675 steps (0 resets) in 33 ms. (108 steps per ms) remains 0/10 properties
[2024-05-31 18:21:23] [INFO ] Flatten gal took : 17 ms
[2024-05-31 18:21:23] [INFO ] Flatten gal took : 3 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2024-05-31 18:21:23] [INFO ] Unfolded HLPN to a Petri net with 3260 places and 3200 transitions 23200 arcs in 80 ms.
[2024-05-31 18:21:23] [INFO ] Unfolded 14 HLPN properties in 4 ms.
[2024-05-31 18:21:23] [INFO ] Reduced 380 identical enabling conditions.
[2024-05-31 18:21:23] [INFO ] Reduced 380 identical enabling conditions.
Support contains 3260 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 34 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-31 18:21:24] [INFO ] Computed 460 invariants in 151 ms
[2024-05-31 18:21:25] [INFO ] Implicit Places using invariants in 920 ms returned []
[2024-05-31 18:21:25] [INFO ] Invariant cache hit.
[2024-05-31 18:21:27] [INFO ] Implicit Places using invariants and state equation in 1998 ms returned []
Implicit Place search using SMT with State Equation took 2954 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:21:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32346ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32399ms
Finished structural reductions in LTL mode , in 1 iterations and 35424 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Support contains 3260 out of 3260 places after structural reductions.
[2024-05-31 18:22:01] [INFO ] Flatten gal took : 693 ms
[2024-05-31 18:22:05] [INFO ] Flatten gal took : 645 ms
[2024-05-31 18:22:09] [INFO ] Input system was already deterministic with 3200 transitions.
Reduction of identical properties reduced properties to check from 16 to 11
RANDOM walk for 3592 steps (0 resets) in 831 ms. (4 steps per ms) remains 0/11 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)||X(!p2)) U (G(((p0 U p1)||X(!p2)))||(((p0 U p1)||X(!p2))&&X(!p1)))))'
Support contains 1600 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 161 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:22:11] [INFO ] Invariant cache hit.
[2024-05-31 18:22:12] [INFO ] Implicit Places using invariants in 1378 ms returned []
[2024-05-31 18:22:12] [INFO ] Invariant cache hit.
[2024-05-31 18:22:17] [INFO ] Implicit Places using invariants and state equation in 5165 ms returned []
Implicit Place search using SMT with State Equation took 6548 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:22:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32323ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32351ms
Finished structural reductions in LTL mode , in 1 iterations and 39073 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 347 ms :[true, p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 4438 ms.
Product exploration explored 100000 steps with 50000 reset in 4165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0 p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-20-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-00 finished in 58623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((p1&&(F(G(p3))||p2)))))'
Support contains 820 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 339 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:23:10] [INFO ] Invariant cache hit.
[2024-05-31 18:23:16] [INFO ] Implicit Places using invariants in 6384 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 6430 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 88 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6859 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 486 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 2897 ms.
Product exploration explored 100000 steps with 1 reset in 2975 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 p2 p3))), (X (NOT p3)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p2) p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))), (X (AND p1 (NOT p2) (NOT p0))), (X (OR (NOT p1) (NOT p2))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p2) p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 919 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND p1 (NOT p0)), (AND p1 (NOT p0) p2 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (8 resets) in 1731 ms. (23 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1122 ms. (35 steps per ms) remains 1/1 properties
// Phase 1: matrix 3200 rows 2860 cols
[2024-05-31 18:23:37] [INFO ] Computed 60 invariants in 307 ms
Problem apf15 is UNSAT
After SMT solving in domain Real declared 420/6060 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 0/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 656ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 p2 p3))), (X (NOT p3)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p2) p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))), (X (AND p1 (NOT p2) (NOT p0))), (X (OR (NOT p1) (NOT p2))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p2) p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p1) p3 (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (AND (OR p1 (NOT p0)) (OR p2 (NOT p0))))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F (NOT (AND (OR p1 (NOT p3) (NOT p0)) (OR (NOT p3) p2 (NOT p0))))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (F p2), (F (NOT p1)), (F p3), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (NOT (AND (OR p1 p3 (NOT p0)) (OR p3 p2 (NOT p0))))), (F (NOT (OR p1 p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 (NOT p0))))
Knowledge based reduction with 25 factoid took 1140 ms. Reduced automaton from 8 states, 25 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-20-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-01 finished in 29368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Support contains 420 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 155 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-31 18:23:39] [INFO ] Computed 460 invariants in 51 ms
[2024-05-31 18:23:45] [INFO ] Implicit Places using invariants in 6074 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 6089 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 114 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6358 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-02
Product exploration explored 100000 steps with 3424 reset in 3478 ms.
Product exploration explored 100000 steps with 3418 reset in 3561 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 78 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 114 steps (0 resets) in 25 ms. (4 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 94 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 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 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 3200 rows 2860 cols
[2024-05-31 18:23:56] [INFO ] Computed 60 invariants in 433 ms
[2024-05-31 18:24:09] [INFO ] [Real]Absence check using 53 positive place invariants in 311 ms returned sat
[2024-05-31 18:24:09] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 111 ms returned sat
[2024-05-31 18:24:11] [INFO ] [Real]Absence check using state equation in 1279 ms returned unknown
Could not prove EG (NOT p0)
Support contains 420 out of 2860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Applied a total of 0 rules in 119 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:24:11] [INFO ] Invariant cache hit.
[2024-05-31 18:24:13] [INFO ] Implicit Places using invariants in 2436 ms returned []
[2024-05-31 18:24:13] [INFO ] Invariant cache hit.
[2024-05-31 18:24:47] [INFO ] Performed 1831/2860 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:25:06] [INFO ] Implicit Places using invariants and state equation in 53020 ms returned []
Implicit Place search using SMT with State Equation took 55459 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:25:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6060 variables, and 39 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 39/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 2800/2800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-31 18:25:41] [INFO ] Deduced a trap composed of 31 places in 853 ms of which 75 ms to minimize.
[2024-05-31 18:25:42] [INFO ] Deduced a trap composed of 31 places in 745 ms of which 8 ms to minimize.
[2024-05-31 18:25:43] [INFO ] Deduced a trap composed of 31 places in 614 ms of which 7 ms to minimize.
[2024-05-31 18:25:43] [INFO ] Deduced a trap composed of 31 places in 554 ms of which 6 ms to minimize.
[2024-05-31 18:25:44] [INFO ] Deduced a trap composed of 31 places in 531 ms of which 6 ms to minimize.
[2024-05-31 18:25:44] [INFO ] Deduced a trap composed of 31 places in 492 ms of which 6 ms to minimize.
[2024-05-31 18:25:45] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 5 ms to minimize.
[2024-05-31 18:25:45] [INFO ] Deduced a trap composed of 31 places in 368 ms of which 5 ms to minimize.
[2024-05-31 18:25:46] [INFO ] Deduced a trap composed of 31 places in 372 ms of which 5 ms to minimize.
[2024-05-31 18:25:46] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 5 ms to minimize.
[2024-05-31 18:25:46] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 5 ms to minimize.
[2024-05-31 18:25:47] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 5 ms to minimize.
[2024-05-31 18:25:47] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 5 ms to minimize.
[2024-05-31 18:25:48] [INFO ] Deduced a trap composed of 31 places in 367 ms of which 4 ms to minimize.
[2024-05-31 18:25:48] [INFO ] Deduced a trap composed of 31 places in 369 ms of which 5 ms to minimize.
[2024-05-31 18:25:48] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 4 ms to minimize.
[2024-05-31 18:25:49] [INFO ] Deduced a trap composed of 31 places in 330 ms of which 5 ms to minimize.
[2024-05-31 18:25:49] [INFO ] Deduced a trap composed of 31 places in 300 ms of which 3 ms to minimize.
[2024-05-31 18:25:49] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 4 ms to minimize.
[2024-05-31 18:25:50] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2840 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-31 18:25:51] [INFO ] Deduced a trap composed of 31 places in 751 ms of which 7 ms to minimize.
[2024-05-31 18:25:52] [INFO ] Deduced a trap composed of 31 places in 726 ms of which 9 ms to minimize.
[2024-05-31 18:25:53] [INFO ] Deduced a trap composed of 31 places in 723 ms of which 8 ms to minimize.
[2024-05-31 18:25:54] [INFO ] Deduced a trap composed of 31 places in 668 ms of which 8 ms to minimize.
[2024-05-31 18:25:54] [INFO ] Deduced a trap composed of 31 places in 683 ms of which 7 ms to minimize.
[2024-05-31 18:25:55] [INFO ] Deduced a trap composed of 31 places in 674 ms of which 7 ms to minimize.
[2024-05-31 18:25:56] [INFO ] Deduced a trap composed of 31 places in 607 ms of which 6 ms to minimize.
[2024-05-31 18:25:56] [INFO ] Deduced a trap composed of 31 places in 611 ms of which 7 ms to minimize.
[2024-05-31 18:25:57] [INFO ] Deduced a trap composed of 31 places in 631 ms of which 7 ms to minimize.
[2024-05-31 18:25:58] [INFO ] Deduced a trap composed of 31 places in 604 ms of which 7 ms to minimize.
[2024-05-31 18:25:58] [INFO ] Deduced a trap composed of 31 places in 613 ms of which 6 ms to minimize.
[2024-05-31 18:25:59] [INFO ] Deduced a trap composed of 31 places in 619 ms of which 7 ms to minimize.
[2024-05-31 18:26:00] [INFO ] Deduced a trap composed of 31 places in 603 ms of which 6 ms to minimize.
[2024-05-31 18:26:00] [INFO ] Deduced a trap composed of 62 places in 607 ms of which 6 ms to minimize.
[2024-05-31 18:26:01] [INFO ] Deduced a trap composed of 31 places in 613 ms of which 7 ms to minimize.
[2024-05-31 18:26:02] [INFO ] Deduced a trap composed of 31 places in 597 ms of which 7 ms to minimize.
[2024-05-31 18:26:02] [INFO ] Deduced a trap composed of 31 places in 608 ms of which 7 ms to minimize.
[2024-05-31 18:26:03] [INFO ] Deduced a trap composed of 31 places in 613 ms of which 6 ms to minimize.
[2024-05-31 18:26:04] [INFO ] Deduced a trap composed of 31 places in 601 ms of which 6 ms to minimize.
[2024-05-31 18:26:04] [INFO ] Deduced a trap composed of 31 places in 610 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2840 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-31 18:26:06] [INFO ] Deduced a trap composed of 31 places in 712 ms of which 7 ms to minimize.
[2024-05-31 18:26:06] [INFO ] Deduced a trap composed of 31 places in 723 ms of which 8 ms to minimize.
[2024-05-31 18:26:07] [INFO ] Deduced a trap composed of 31 places in 724 ms of which 8 ms to minimize.
[2024-05-31 18:26:08] [INFO ] Deduced a trap composed of 31 places in 743 ms of which 9 ms to minimize.
[2024-05-31 18:26:09] [INFO ] Deduced a trap composed of 31 places in 723 ms of which 8 ms to minimize.
SMT process timed out in 62546ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 62580ms
Finished structural reductions in LTL mode , in 1 iterations and 118165 ms. Remains : 2860/2860 places, 3200/3200 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 69 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 102 steps (0 resets) in 9 ms. (10 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 90 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 18:26:12] [INFO ] Invariant cache hit.
[2024-05-31 18:26:26] [INFO ] [Real]Absence check using 53 positive place invariants in 301 ms returned sat
[2024-05-31 18:26:26] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 319 ms returned sat
[2024-05-31 18:26:27] [INFO ] [Real]Absence check using state equation in 704 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3411 reset in 3541 ms.
Product exploration explored 100000 steps with 3409 reset in 3645 ms.
Support contains 420 out of 2860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Applied a total of 0 rules in 89 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:26:34] [INFO ] Invariant cache hit.
[2024-05-31 18:26:37] [INFO ] Implicit Places using invariants in 2657 ms returned []
[2024-05-31 18:26:37] [INFO ] Invariant cache hit.
[2024-05-31 18:27:11] [INFO ] Performed 1831/2860 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:27:30] [INFO ] Implicit Places using invariants and state equation in 53383 ms returned []
Implicit Place search using SMT with State Equation took 56045 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:27:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6060 variables, and 39 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 39/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 2800/2800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-31 18:28:05] [INFO ] Deduced a trap composed of 31 places in 703 ms of which 7 ms to minimize.
[2024-05-31 18:28:06] [INFO ] Deduced a trap composed of 31 places in 645 ms of which 7 ms to minimize.
[2024-05-31 18:28:07] [INFO ] Deduced a trap composed of 31 places in 582 ms of which 7 ms to minimize.
[2024-05-31 18:28:07] [INFO ] Deduced a trap composed of 31 places in 559 ms of which 7 ms to minimize.
[2024-05-31 18:28:08] [INFO ] Deduced a trap composed of 31 places in 507 ms of which 6 ms to minimize.
[2024-05-31 18:28:08] [INFO ] Deduced a trap composed of 31 places in 459 ms of which 6 ms to minimize.
[2024-05-31 18:28:09] [INFO ] Deduced a trap composed of 31 places in 442 ms of which 6 ms to minimize.
[2024-05-31 18:28:09] [INFO ] Deduced a trap composed of 31 places in 488 ms of which 5 ms to minimize.
[2024-05-31 18:28:10] [INFO ] Deduced a trap composed of 31 places in 405 ms of which 4 ms to minimize.
[2024-05-31 18:28:10] [INFO ] Deduced a trap composed of 31 places in 381 ms of which 4 ms to minimize.
[2024-05-31 18:28:11] [INFO ] Deduced a trap composed of 31 places in 368 ms of which 5 ms to minimize.
[2024-05-31 18:28:11] [INFO ] Deduced a trap composed of 31 places in 380 ms of which 4 ms to minimize.
[2024-05-31 18:28:11] [INFO ] Deduced a trap composed of 31 places in 407 ms of which 6 ms to minimize.
[2024-05-31 18:28:12] [INFO ] Deduced a trap composed of 31 places in 408 ms of which 4 ms to minimize.
[2024-05-31 18:28:12] [INFO ] Deduced a trap composed of 31 places in 378 ms of which 5 ms to minimize.
[2024-05-31 18:28:13] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 4 ms to minimize.
[2024-05-31 18:28:13] [INFO ] Deduced a trap composed of 31 places in 339 ms of which 4 ms to minimize.
[2024-05-31 18:28:13] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 4 ms to minimize.
[2024-05-31 18:28:14] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 4 ms to minimize.
[2024-05-31 18:28:14] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2840 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-31 18:28:16] [INFO ] Deduced a trap composed of 31 places in 732 ms of which 7 ms to minimize.
[2024-05-31 18:28:16] [INFO ] Deduced a trap composed of 31 places in 733 ms of which 8 ms to minimize.
[2024-05-31 18:28:17] [INFO ] Deduced a trap composed of 31 places in 734 ms of which 8 ms to minimize.
[2024-05-31 18:28:18] [INFO ] Deduced a trap composed of 31 places in 669 ms of which 7 ms to minimize.
[2024-05-31 18:28:19] [INFO ] Deduced a trap composed of 31 places in 667 ms of which 7 ms to minimize.
[2024-05-31 18:28:19] [INFO ] Deduced a trap composed of 31 places in 664 ms of which 7 ms to minimize.
[2024-05-31 18:28:20] [INFO ] Deduced a trap composed of 31 places in 630 ms of which 7 ms to minimize.
[2024-05-31 18:28:21] [INFO ] Deduced a trap composed of 31 places in 615 ms of which 7 ms to minimize.
[2024-05-31 18:28:21] [INFO ] Deduced a trap composed of 31 places in 607 ms of which 7 ms to minimize.
[2024-05-31 18:28:22] [INFO ] Deduced a trap composed of 31 places in 616 ms of which 7 ms to minimize.
[2024-05-31 18:28:23] [INFO ] Deduced a trap composed of 31 places in 608 ms of which 7 ms to minimize.
[2024-05-31 18:28:23] [INFO ] Deduced a trap composed of 31 places in 614 ms of which 7 ms to minimize.
[2024-05-31 18:28:24] [INFO ] Deduced a trap composed of 31 places in 623 ms of which 8 ms to minimize.
[2024-05-31 18:28:25] [INFO ] Deduced a trap composed of 62 places in 622 ms of which 7 ms to minimize.
[2024-05-31 18:28:25] [INFO ] Deduced a trap composed of 31 places in 605 ms of which 7 ms to minimize.
[2024-05-31 18:28:26] [INFO ] Deduced a trap composed of 31 places in 615 ms of which 7 ms to minimize.
[2024-05-31 18:28:27] [INFO ] Deduced a trap composed of 31 places in 605 ms of which 7 ms to minimize.
[2024-05-31 18:28:27] [INFO ] Deduced a trap composed of 31 places in 609 ms of which 7 ms to minimize.
[2024-05-31 18:28:28] [INFO ] Deduced a trap composed of 31 places in 624 ms of which 6 ms to minimize.
[2024-05-31 18:28:29] [INFO ] Deduced a trap composed of 31 places in 598 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2840 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-31 18:28:30] [INFO ] Deduced a trap composed of 31 places in 716 ms of which 7 ms to minimize.
[2024-05-31 18:28:31] [INFO ] Deduced a trap composed of 31 places in 716 ms of which 8 ms to minimize.
[2024-05-31 18:28:32] [INFO ] Deduced a trap composed of 31 places in 725 ms of which 7 ms to minimize.
[2024-05-31 18:28:32] [INFO ] Deduced a trap composed of 31 places in 719 ms of which 7 ms to minimize.
[2024-05-31 18:28:33] [INFO ] Deduced a trap composed of 31 places in 716 ms of which 8 ms to minimize.
SMT process timed out in 62703ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 62729ms
Finished structural reductions in LTL mode , in 1 iterations and 118871 ms. Remains : 2860/2860 places, 3200/3200 transitions.
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-02 finished in 296052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(!p1)&&p0))))'
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 74 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-31 18:28:35] [INFO ] Computed 460 invariants in 49 ms
[2024-05-31 18:28:36] [INFO ] Implicit Places using invariants in 1361 ms returned []
[2024-05-31 18:28:36] [INFO ] Invariant cache hit.
[2024-05-31 18:28:41] [INFO ] Implicit Places using invariants and state equation in 5208 ms returned []
Implicit Place search using SMT with State Equation took 6571 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:28:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32140ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32167ms
Finished structural reductions in LTL mode , in 1 iterations and 38820 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 3310 ms.
Product exploration explored 100000 steps with 50000 reset in 3253 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-20-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-04 finished in 52649 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)))'
Support contains 400 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2860 transition count 2800
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 800 place count 2860 transition count 2000
Deduced a syphon composed of 800 places in 1 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 2400 place count 2060 transition count 2000
Applied a total of 2400 rules in 584 ms. Remains 2060 /3260 variables (removed 1200) and now considering 2000/3200 (removed 1200) transitions.
// Phase 1: matrix 2000 rows 2060 cols
[2024-05-31 18:29:28] [INFO ] Computed 460 invariants in 27 ms
[2024-05-31 18:29:32] [INFO ] Implicit Places using invariants in 3861 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 3872 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1660/3260 places, 2000/3200 transitions.
Applied a total of 0 rules in 72 ms. Remains 1660 /1660 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4530 ms. Remains : 1660/3260 places, 2000/3200 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 1146 ms.
Product exploration explored 100000 steps with 0 reset in 1311 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 90 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 31 ms :[(NOT p0)]
RANDOM walk for 82 steps (0 resets) in 7 ms. (10 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 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
// Phase 1: matrix 2000 rows 1660 cols
[2024-05-31 18:29:36] [INFO ] Computed 60 invariants in 180 ms
[2024-05-31 18:29:39] [INFO ] [Real]Absence check using 54 positive place invariants in 97 ms returned sat
[2024-05-31 18:29:39] [INFO ] [Real]Absence check using 54 positive and 6 generalized place invariants in 45 ms returned sat
[2024-05-31 18:29:44] [INFO ] [Real]Absence check using state equation in 4247 ms returned sat
[2024-05-31 18:29:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:29:48] [INFO ] [Nat]Absence check using 54 positive place invariants in 958 ms returned sat
[2024-05-31 18:29:48] [INFO ] [Nat]Absence check using 54 positive and 6 generalized place invariants in 117 ms returned sat
[2024-05-31 18:29:59] [INFO ] [Nat]Absence check using state equation in 11064 ms returned unknown
Could not prove EG (NOT p0)
Support contains 400 out of 1660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1660/1660 places, 2000/2000 transitions.
Applied a total of 0 rules in 70 ms. Remains 1660 /1660 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2024-05-31 18:29:59] [INFO ] Invariant cache hit.
[2024-05-31 18:30:01] [INFO ] Implicit Places using invariants in 2037 ms returned []
[2024-05-31 18:30:01] [INFO ] Invariant cache hit.
[2024-05-31 18:30:15] [INFO ] Implicit Places using invariants and state equation in 13758 ms returned []
Implicit Place search using SMT with State Equation took 15796 ms to find 0 implicit places.
[2024-05-31 18:30:15] [INFO ] Redundant transitions in 152 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-31 18:30:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1640/3660 variables, and 39 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/1660 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-31 18:30:56] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-31 18:30:56] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-31 18:30:56] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-31 18:30:56] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-31 18:30:57] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-31 18:30:58] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-31 18:30:58] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-31 18:30:58] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1640 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-31 18:31:08] [INFO ] Deduced a trap composed of 7 places in 1000 ms of which 10 ms to minimize.
[2024-05-31 18:31:09] [INFO ] Deduced a trap composed of 7 places in 975 ms of which 10 ms to minimize.
[2024-05-31 18:31:10] [INFO ] Deduced a trap composed of 7 places in 999 ms of which 10 ms to minimize.
[2024-05-31 18:31:11] [INFO ] Deduced a trap composed of 7 places in 986 ms of which 10 ms to minimize.
[2024-05-31 18:31:12] [INFO ] Deduced a trap composed of 7 places in 989 ms of which 9 ms to minimize.
[2024-05-31 18:31:13] [INFO ] Deduced a trap composed of 7 places in 970 ms of which 10 ms to minimize.
[2024-05-31 18:31:14] [INFO ] Deduced a trap composed of 7 places in 982 ms of which 10 ms to minimize.
[2024-05-31 18:31:15] [INFO ] Deduced a trap composed of 7 places in 984 ms of which 10 ms to minimize.
[2024-05-31 18:31:16] [INFO ] Deduced a trap composed of 7 places in 969 ms of which 9 ms to minimize.
[2024-05-31 18:31:17] [INFO ] Deduced a trap composed of 7 places in 996 ms of which 9 ms to minimize.
SMT process timed out in 62253ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 62269ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78306 ms. Remains : 1660/1660 places, 2000/2000 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 71 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 80 steps (0 resets) in 7 ms. (10 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 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-31 18:31:19] [INFO ] Invariant cache hit.
[2024-05-31 18:31:22] [INFO ] [Real]Absence check using 54 positive place invariants in 103 ms returned sat
[2024-05-31 18:31:22] [INFO ] [Real]Absence check using 54 positive and 6 generalized place invariants in 50 ms returned sat
[2024-05-31 18:31:28] [INFO ] [Real]Absence check using state equation in 5854 ms returned sat
[2024-05-31 18:31:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:31:31] [INFO ] [Nat]Absence check using 54 positive place invariants in 742 ms returned sat
[2024-05-31 18:31:33] [INFO ] [Nat]Absence check using 54 positive and 6 generalized place invariants in 1510 ms returned sat
[2024-05-31 18:31:43] [INFO ] [Nat]Absence check using state equation in 10013 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1171 ms.
Product exploration explored 100000 steps with 0 reset in 1401 ms.
Support contains 400 out of 1660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1660/1660 places, 2000/2000 transitions.
Applied a total of 0 rules in 61 ms. Remains 1660 /1660 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2024-05-31 18:31:46] [INFO ] Invariant cache hit.
[2024-05-31 18:31:48] [INFO ] Implicit Places using invariants in 2108 ms returned []
[2024-05-31 18:31:48] [INFO ] Invariant cache hit.
[2024-05-31 18:32:02] [INFO ] Implicit Places using invariants and state equation in 14097 ms returned []
Implicit Place search using SMT with State Equation took 16210 ms to find 0 implicit places.
[2024-05-31 18:32:02] [INFO ] Redundant transitions in 29 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-31 18:32:02] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1640/3660 variables, and 39 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/1660 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-31 18:32:43] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-31 18:32:43] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-31 18:32:43] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2024-05-31 18:32:45] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-31 18:32:45] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-05-31 18:32:45] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1640 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-31 18:32:55] [INFO ] Deduced a trap composed of 7 places in 988 ms of which 9 ms to minimize.
[2024-05-31 18:32:56] [INFO ] Deduced a trap composed of 7 places in 1034 ms of which 9 ms to minimize.
[2024-05-31 18:32:57] [INFO ] Deduced a trap composed of 7 places in 1007 ms of which 9 ms to minimize.
[2024-05-31 18:32:58] [INFO ] Deduced a trap composed of 7 places in 1016 ms of which 9 ms to minimize.
[2024-05-31 18:32:59] [INFO ] Deduced a trap composed of 7 places in 992 ms of which 8 ms to minimize.
[2024-05-31 18:33:00] [INFO ] Deduced a trap composed of 7 places in 991 ms of which 9 ms to minimize.
[2024-05-31 18:33:01] [INFO ] Deduced a trap composed of 7 places in 1007 ms of which 9 ms to minimize.
[2024-05-31 18:33:02] [INFO ] Deduced a trap composed of 7 places in 980 ms of which 9 ms to minimize.
[2024-05-31 18:33:03] [INFO ] Deduced a trap composed of 7 places in 953 ms of which 9 ms to minimize.
[2024-05-31 18:33:04] [INFO ] Deduced a trap composed of 7 places in 968 ms of which 9 ms to minimize.
SMT process timed out in 62101ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 62117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78430 ms. Remains : 1660/1660 places, 2000/2000 transitions.
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-05 finished in 217464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((p1&&F(p0))))))'
Support contains 820 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 87 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-31 18:33:05] [INFO ] Computed 460 invariants in 43 ms
[2024-05-31 18:33:11] [INFO ] Implicit Places using invariants in 5982 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5994 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 62 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6143 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-06
Entered a terminal (fully accepting) state of product in 81082 steps with 84 reset in 3191 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-06 finished in 9545 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)&&(!p1||X((X(!p0)&&p2)))))))'
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 72 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:33:14] [INFO ] Invariant cache hit.
[2024-05-31 18:33:16] [INFO ] Implicit Places using invariants in 1256 ms returned []
[2024-05-31 18:33:16] [INFO ] Invariant cache hit.
[2024-05-31 18:33:21] [INFO ] Implicit Places using invariants and state equation in 5311 ms returned []
Implicit Place search using SMT with State Equation took 6568 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:33:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32287ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32313ms
Finished structural reductions in LTL mode , in 1 iterations and 38960 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-07
Product exploration explored 100000 steps with 2587 reset in 1930 ms.
Product exploration explored 100000 steps with 2576 reset in 1974 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 106 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 3738 steps (0 resets) in 219 ms. (16 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 176 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
[2024-05-31 18:34:05] [INFO ] Invariant cache hit.
[2024-05-31 18:34:09] [INFO ] [Real]Absence check using 59 positive place invariants in 103 ms returned sat
[2024-05-31 18:34:10] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 1295 ms returned sat
[2024-05-31 18:34:20] [INFO ] [Real]Absence check using state equation in 9355 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 79 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:34:20] [INFO ] Invariant cache hit.
[2024-05-31 18:34:21] [INFO ] Implicit Places using invariants in 1288 ms returned []
[2024-05-31 18:34:21] [INFO ] Invariant cache hit.
[2024-05-31 18:34:26] [INFO ] Implicit Places using invariants and state equation in 5280 ms returned []
Implicit Place search using SMT with State Equation took 6570 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:34:26] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32210ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32237ms
Finished structural reductions in LTL mode , in 1 iterations and 38896 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 108 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 3425 steps (0 resets) in 187 ms. (18 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 141 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
[2024-05-31 18:35:06] [INFO ] Invariant cache hit.
[2024-05-31 18:35:10] [INFO ] [Real]Absence check using 59 positive place invariants in 109 ms returned sat
[2024-05-31 18:35:12] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 1401 ms returned sat
[2024-05-31 18:35:21] [INFO ] [Real]Absence check using state equation in 9237 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Product exploration explored 100000 steps with 2578 reset in 1954 ms.
Product exploration explored 100000 steps with 2586 reset in 1991 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 400 Pre rules applied. Total rules applied 0 place count 3260 transition count 3200
Deduced a syphon composed of 400 places in 1 ms
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 3200
Deduced a syphon composed of 400 places in 0 ms
Applied a total of 400 rules in 373 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:35:26] [INFO ] Redundant transitions in 162 ms returned []
Running 2800 sub problems to find dead transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-31 18:35:26] [INFO ] Computed 460 invariants in 55 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32788ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32814ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3260/3260 places, 3200/3200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33358 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 106 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-31 18:35:59] [INFO ] Computed 460 invariants in 53 ms
[2024-05-31 18:36:00] [INFO ] Implicit Places using invariants in 1318 ms returned []
[2024-05-31 18:36:00] [INFO ] Invariant cache hit.
[2024-05-31 18:36:05] [INFO ] Implicit Places using invariants and state equation in 5136 ms returned []
Implicit Place search using SMT with State Equation took 6456 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:36:05] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(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 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(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 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 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 0.0)
(s1239 1.0)
(s1240 1.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 1.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 1.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 1.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 1.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 1.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 1.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 1.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 1.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 1.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 1.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 1.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 1.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 1.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 1.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 1.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 1.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 1.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 1.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 1.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.0)
(s2021 0.0)
(s2022 0.0)
(s2023 0.0)
(s2024 0.0)
(s2025 0.0)
(s2026 0.0)
(s2027 0.0)
(s2028 0.0)
(s2029 0.0)
(s2030 0.0)
(s2031 0.0)
(s2032 0.0)
(s2033 0.0)
(s2034 0.0)
(s2035 0.0)
(s2036 0.0)
(s2037 0.0)
(s2038 0.0)
(s2039 0.0)
(s2040 1.0)
(s2041 1.0)
(s2042 1.0)
(s2043 1.0)
(s2044 1.0)
(s2045 1.0)
(s2046 1.0)
(s2047 1.0)
(s2048 1.0)
(s2049 1.0)
(s2050 1.0)
(s2051 1.0)
(s2052 1.0)
(s2053 1.0)
(s2054 1.0)
(s2055 1.0)
(s2056 1.0)
(s2057 1.0)
(s2058 1.0)
(s2059 1.0)
(s2060 1.0)
(s2061 1.0)
(s2062 1.0)
(s2063 1.0)
(s2064 1.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 1.0)
(s2073 1.0)
(s2074 1.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 1.0)
(s2081 1.0)
(s2082 1.0)
(s2083 1.0)
(s2084 1.0)
(s2085 1.0)
(s2086 1.0)
(s2087 1.0)
(s2088 1.0)
(s2089 1.0)
(s2090 1.0)
(s2091 1.0)
(s2092 1.0)
(s2093 1.0)
(s2094 1.0)
(s2095 1.0)
(s2096 1.0)
(s2097 1.0)
(s2098 1.0)
(s2099 1.0)
(s2100 1.0)
(s2101 1.0)
(s2102 1.0)
(s2103 1.0)
(s2104 1.0)
(s2105 1.0)
(s2106 1.0)
(s2107 1.0)
(s2108 1.0)
(s2109 1.0)
(s2110 1.0)
(s2111 1.0)
(s2112 1.0)
(s2113 1.0)
(s2114 1.0)
(s2115 1.0)
(s2116 1.0)
(s2117 1.0)
(s2118 1.0)
(s2119 1.0)
(s2120 1.0)
(s2121 1.0)
(s2122 1.0)
(s2123 1.0)
(s2124 1.0)
(s2125 1.0)
(s2126 1.0)
(s2127 1.0)
(s2128 1.0)
(s2129 1.0)
(s2130 1.0)
(s2131 1.0)
(s2132 1.0)
(s2133 1.0)
(s2134 1.0)
(s2135 1.0)
(s2136 1.0)
(s2137 1.0)
(s2138 1.0)
(s2139 1.0)
(s2140 1.0)
(s2141 1.0)
(s2142 1.0)
(s2143 1.0)
(s2144 1.0)
(s2145 1.0)
(s2146 1.0)
(s2147 1.0)
(s2148 1.0)
(s2149 1.0)
(s2150 1.0)
(s2151 1.0)
(s2152 1.0)
(s2153 1.0)
(s2154 1.0)
(s2155 1.0)
(s2156 1.0)
(s2157 1.0)
(s2158 1.0)
(s2159 1.0)
(s2160 1.0)
(s2161 1.0)
(s2162 1.0)
(s2163 1.0)
(s2164 1.0)
(s2165 1.0)
(s2166 1.0)
(s2167 1.0)
(s2168 1.0)
(s2169 1.0)
(s2170 1.0)
(s2171 1.0)
(s2172 1.0)
(s2173 1.0)
(s2174 1.0)
(s2175 1.0)
(s2176 1.0)
(s2177 1.0)
(s2178 1.0)
(s2179 1.0)
(s2180 1.0)
(s2181 1.0)
(s2182 1.0)
(s2183 1.0)
(s2184 1.0)
(s2185 1.0)
(s2186 1.0)
(s2187 1.0)
(s2188 1.0)
(s2189 1.0)
(s2190 1.0)
(s2191 1.0)
(s2192 1.0)
(s2193 1.0)
(s2194 1.0)
(s2195 1.0)
(s2196 1.0)
(s2197 1.0)
(s2198 1.0)
(s2199 1.0)
(s2200 1.0)
(s2201 1.0)
(s2202 1.0)
(s2203 1.0)
(s2204 1.0)
(s2205 1.0)
(s2206 1.0)
(s2207 1.0)
(s2208 1.0)
(s2209 1.0)
(s2210 1.0)
(s2211 1.0)
(s2212 1.0)
(s2213 1.0)
(s2214 1.0)
(s2215 1.0)
(s2216 1.0)
(s2217 1.0)
(s2218 1.0)
(s2219 1.0)
(s2220 1.0)
(s2221 1.0)
(s2222 1.0)
(s2223 1.0)
(s2224 1.0)
(s2225 1.0)
(s2226 1.0)
(s2227 1.0)
(s2228 1.0)
(s2229 1.0)
(s2230 1.0)
(s2231 1.0)
(s2232 1.0)
(s2233 1.0)
(s2234 1.0)
(s2235 1.0)
(s2236 1.0)
(s2237 1.0)
(s2238 1.0)
(s2239 1.0)
(s2240 1.0)
(s2241 1.0)
(s2242 1.0)
(s2243 1.0)
(s2244 1.0)
(s2245 1.0)
(s2246 1.0)
(s2247 1.0)
(s2248 1.0)
(s2249 1.0)
(s2250 1.0)
(s2251 1.0)
(s2252 1.0)
(s2253 1.0)
(s2254 1.0)
(s2255 1.0)
(s2256 1.0)
(s2257 1.0)
(s2258 1.0)
(s2259 1.0)
(s2260 1.0)
(s2261 1.0)
(s2262 1.0)
(s2263 1.0)
(s2264 1.0)
(s2265 1.0)
(s2266 1.0)
(s2267 1.0)
(s2268 1.0)
(s2269 1.0)
(s2270 1.0)
(s2271 1.0)
(s2272 1.0)
(s2273 1.0)
(s2274 1.0)
(s2275 1.0)
(s2276 1.0)
(s2277 1.0)
(s2278 1.0)
(s2279 1.0)
(s2280 1.0)
(s2281 1.0)
(s2282 1.0)
(s2283 1.0)
(s2284 1.0)
(s2285 1.0)
(s2286 1.0)
(s2287 1.0)
(s2288 1.0)
(s2289 1.0)
(s2290 1.0)
(s2291 1.0)
(s2292 1.0)
(s2293 1.0)
(s2294 1.0)
(s2295 1.0)
(s2296 1.0)
(s2297 1.0)
(s2298 1.0)
(s2299 1.0)
(s2300 1.0)
(s2301 1.0)
(s2302 1.0)
(s2303 1.0)
(s2304 1.0)
(s2305 1.0)
(s2306 1.0)
(s2307 1.0)
(s2308 1.0)
(s2309 1.0)
(s2310 1.0)
(s2311 1.0)
(s2312 1.0)
(s2313 1.0)
(s2314 1.0)
(s2315 1.0)
(s2316 1.0)
(s2317 1.0)
(s2318 1.0)
(s2319 1.0)
(s2320 1.0)
(s2321 1.0)
(s2322 1.0)
(s2323 1.0)
(s2324 1.0)
(s2325 1.0)
(s2326 1.0)
(s2327 1.0)
(s2328 1.0)
(s2329 1.0)
(s2330 1.0)
(s2331 1.0)
(s2332 1.0)
(s2333 1.0)
(s2334 1.0)
(s2335 1.0)
(s2336 1.0)
(s2337 1.0)
(s2338 1.0)
(s2339 1.0)
(s2340 1.0)
(s2341 1.0)
(s2342 1.0)
(s2343 1.0)
(s2344 1.0)
(s2345 1.0)
(s2346 1.0)
(s2347 1.0)
(s2348 1.0)
(s2349 1.0)
(s2350 1.0)
(s2351 1.0)
(s2352 1.0)
(s2353 1.0)
(s2354 1.0)
(s2355 1.0)
(s2356 1.0)
(s2357 1.0)
(s2358 1.0)
(s2359 1.0)
(s2360 1.0)
(s2361 1.0)
(s2362 1.0)
(s2363 1.0)
(s2364 1.0)
(s2365 1.0)
(s2366 1.0)
(s2367 1.0)
(s2368 1.0)
(s2369 1.0)
(s2370 1.0)
(s2371 1.0)
(s2372 1.0)
(s2373 1.0)
(s2374 1.0)
(s2375 1.0)
(s2376 1.0)
(s2377 1.0)
(s2378 1.0)
(s2379 1.0)
(s2380 1.0)
(s2381 1.0)
(s2382 1.0)
(s2383 1.0)
(s2384 1.0)
(s2385 1.0)
(s2386 1.0)
(s2387 1.0)
(s2388 1.0)
(s2389 1.0)
(s2390 1.0)
(s2391 1.0)
(s2392 1.0)
(s2393 1.0)
(s2394 1.0)
(s2395 1.0)
(s2396 1.0)
(s2397 1.0)
(s2398 1.0)
(s2399 1.0)
(s2400 1.0)
(s2401 1.0)
(s2402 1.0)
(s2403 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32201ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32225ms
Finished structural reductions in LTL mode , in 1 iterations and 38793 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-07 finished in 204047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(F((X(!p2)&&p1)))))'
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 91 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:36:38] [INFO ] Invariant cache hit.
[2024-05-31 18:36:40] [INFO ] Implicit Places using invariants in 1219 ms returned []
[2024-05-31 18:36:40] [INFO ] Invariant cache hit.
[2024-05-31 18:36:45] [INFO ] Implicit Places using invariants and state equation in 5456 ms returned []
Implicit Place search using SMT with State Equation took 6677 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:36:45] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(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 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(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 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 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 0.0)
(s1239 1.0)
(s1240 1.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 1.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 1.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 1.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 1.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 1.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 1.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 1.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 1.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 1.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 1.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 1.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 1.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 1.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 1.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 1.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 1.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 1.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 1.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 1.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.0)
(s2021 0.0)
(s2022 0.0)
(s2023 0.0)
(s2024 0.0)
(s2025 0.0)
(s2026 0.0)
(s2027 0.0)
(s2028 0.0)
(s2029 0.0)
(s2030 0.0)
(s2031 0.0)
(s2032 0.0)
(s2033 0.0)
(s2034 0.0)
(s2035 0.0)
(s2036 0.0)
(s2037 0.0)
(s2038 0.0)
(s2039 0.0)
(s2040 1.0)
(s2041 1.0)
(s2042 1.0)
(s2043 1.0)
(s2044 1.0)
(s2045 1.0)
(s2046 1.0)
(s2047 1.0)
(s2048 1.0)
(s2049 1.0)
(s2050 1.0)
(s2051 1.0)
(s2052 1.0)
(s2053 1.0)
(s2054 1.0)
(s2055 1.0)
(s2056 1.0)
(s2057 1.0)
(s2058 1.0)
(s2059 1.0)
(s2060 1.0)
(s2061 1.0)
(s2062 1.0)
(s2063 1.0)
(s2064 1.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 1.0)
(s2073 1.0)
(s2074 1.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 1.0)
(s2081 1.0)
(s2082 1.0)
(s2083 1.0)
(s2084 1.0)
(s2085 1.0)
(s2086 1.0)
(s2087 1.0)
(s2088 1.0)
(s2089 1.0)
(s2090 1.0)
(s2091 1.0)
(s2092 1.0)
(s2093 1.0)
(s2094 1.0)
(s2095 1.0)
(s2096 1.0)
(s2097 1.0)
(s2098 1.0)
(s2099 1.0)
(s2100 1.0)
(s2101 1.0)
(s2102 1.0)
(s2103 1.0)
(s2104 1.0)
(s2105 1.0)
(s2106 1.0)
(s2107 1.0)
(s2108 1.0)
(s2109 1.0)
(s2110 1.0)
(s2111 1.0)
(s2112 1.0)
(s2113 1.0)
(s2114 1.0)
(s2115 1.0)
(s2116 1.0)
(s2117 1.0)
(s2118 1.0)
(s2119 1.0)
(s2120 1.0)
(s2121 1.0)
(s2122 1.0)
(s2123 1.0)
(s2124 1.0)
(s2125 1.0)
(s2126 1.0)
(s2127 1.0)
(s2128 1.0)
(s2129 1.0)
(s2130 1.0)
(s2131 1.0)
(s2132 1.0)
(s2133 1.0)
(s2134 1.0)
(s2135 1.0)
(s2136 1.0)
(s2137 1.0)
(s2138 1.0)
(s2139 1.0)
(s2140 1.0)
(s2141 1.0)
(s2142 1.0)
(s2143 1.0)
(s2144 1.0)
(s2145 1.0)
(s2146 1.0)
(s2147 1.0)
(s2148 1.0)
(s2149 1.0)
(s2150 1.0)
(s2151 1.0)
(s2152 1.0)
(s2153 1.0)
(s2154 1.0)
(s2155 1.0)
(s2156 1.0)
(s2157 1.0)
(s2158 1.0)
(s2159 1.0)
(s2160 1.0)
(s2161 1.0)
(s2162 1.0)
(s2163 1.0)
(s2164 1.0)
(s2165 1.0)
(s2166 1.0)
(s2167 1.0)
(s2168 1.0)
(s2169 1.0)
(s2170 1.0)
(s2171 1.0)
(s2172 1.0)
(s2173 1.0)
(s2174 1.0)
(s2175 1.0)
(s2176 1.0)
(s2177 1.0)
(s2178 1.0)
(s2179 1.0)
(s2180 1.0)
(s2181 1.0)
(s2182 1.0)
(s2183 1.0)
(s2184 1.0)
(s2185 1.0)
(s2186 1.0)
(s2187 1.0)
(s2188 1.0)
(s2189 1.0)
(s2190 1.0)
(s2191 1.0)
(s2192 1.0)
(s2193 1.0)
(s2194 1.0)
(s2195 1.0)
(s2196 1.0)
(s2197 1.0)
(s2198 1.0)
(s2199 1.0)
(s2200 1.0)
(s2201 1.0)
(s2202 1.0)
(s2203 1.0)
(s2204 1.0)
(s2205 1.0)
(s2206 1.0)
(s2207 1.0)
(s2208 1.0)
(s2209 1.0)
(s2210 1.0)
(s2211 1.0)
(s2212 1.0)
(s2213 1.0)
(s2214 1.0)
(s2215 1.0)
(s2216 1.0)
(s2217 1.0)
(s2218 1.0)
(s2219 1.0)
(s2220 1.0)
(s2221 1.0)
(s2222 1.0)
(s2223 1.0)
(s2224 1.0)
(s2225 1.0)
(s2226 1.0)
(s2227 1.0)
(s2228 1.0)
(s2229 1.0)
(s2230 1.0)
(s2231 1.0)
(s2232 1.0)
(s2233 1.0)
(s2234 1.0)
(s2235 1.0)
(s2236 1.0)
(s2237 1.0)
(s2238 1.0)
(s2239 1.0)
(s2240 1.0)
(s2241 1.0)
(s2242 1.0)
(s2243 1.0)
(s2244 1.0)
(s2245 1.0)
(s2246 1.0)
(s2247 1.0)
(s2248 1.0)
(s2249 1.0)
(s2250 1.0)
(s2251 1.0)
(s2252 1.0)
(s2253 1.0)
(s2254 1.0)
(s2255 1.0)
(s2256 1.0)
(s2257 1.0)
(s2258 1.0)
(s2259 1.0)
(s2260 1.0)
(s2261 1.0)
(s2262 1.0)
(s2263 1.0)
(s2264 1.0)
(s2265 1.0)
(s2266 1.0)
(s2267 1.0)
(s2268 1.0)
(s2269 1.0)
(s2270 1.0)
(s2271 1.0)
(s2272 1.0)
(s2273 1.0)
(s2274 1.0)
(s2275 1.0)
(s2276 1.0)
(s2277 1.0)
(s2278 1.0)
(s2279 1.0)
(s2280 1.0)
(s2281 1.0)
(s2282 1.0)
(s2283 1.0)
(s2284 1.0)
(s2285 1.0)
(s2286 1.0)
(s2287 1.0)
(s2288 1.0)
(s2289 1.0)
(s2290 1.0)
(s2291 1.0)
(s2292 1.0)
(s2293 1.0)
(s2294 1.0)
(s2295 1.0)
(s2296 1.0)
(s2297 1.0)
(s2298 1.0)
(s2299 1.0)
(s2300 1.0)
(s2301 1.0)
(s2302 1.0)
(s2303 1.0)
(s2304 1.0)
(s2305 1.0)
(s2306 1.0)
(s2307 1.0)
(s2308 1.0)
(s2309 1.0)
(s2310 1.0)
(s2311 1.0)
(s2312 1.0)
(s2313 1.0)
(s2314 1.0)
(s2315 1.0)
(s2316 1.0)
(s2317 1.0)
(s2318 1.0)
(s2319 1.0)
(s2320 1.0)
(s2321 1.0)
(s2322 1.0)
(s2323 1.0)
(s2324 1.0)
(s2325 1.0)
(s2326 1.0)
(s2327 1.0)
(s2328 1.0)
(s2329 1.0)
(s2330 1.0)
(s2331 1.0)
(s2332 1.0)
(s2333 1.0)
(s2334 1.0)
(s2335 1.0)
(s2336 1.0)
(s2337 1.0)
(s2338 1.0)
(s2339 1.0)
(s2340 1.0)
(s2341 1.0)
(s2342 1.0)
(s2343 1.0)
(s2344 1.0)
(s2345 1.0)
(s2346 1.0)
(s2347 1.0)
(s2348 1.0)
(s2349 1.0)
(s2350 1.0)
(s2351 1.0)
(s2352 1.0)
(s2353 1.0)
(s2354 1.0)
(s2355 1.0)
(s2356 1.0)
(s2357 1.0)
(s2358 1.0)
(s2359 1.0)
(s2360 1.0)
(s2361 1.0)
(s2362 1.0)
(s2363 1.0)
(s2364 1.0)
(s2365 1.0)
(s2366 1.0)
(s2367 1.0)
(s2368 1.0)
(s2369 1.0)
(s2370 1.0)
(s2371 1.0)
(s2372 1.0)
(s2373 1.0)
(s2374 1.0)
(s2375 1.0)
(s2376 1.0)
(s2377 1.0)
(s2378 1.0)
(s2379 1.0)
(s2380 1.0)
(s2381 1.0)
(s2382 1.0)
(s2383 1.0)
(s2384 1.0)
(s2385 1.0)
(s2386 1.0)
(s2387 1.0)
(s2388 1.0)
(s2389 1.0)
(s2390 1.0)
(s2391 1.0)
(s2392 1.0)
(s2393 1.0)
(s2394 1.0)
(s2395 1.0)
(s2396 1.0)
(s2397 1.0)
(s2398 1.0)
(s2399 1.0)
(s2400 1.0)
(s2401 1.0)
(s2402 1.0)
(s2403 1.0)
(s2404 1.0)
(s2405 1.0)
(s2406 1.0)
(s2407 1.0)
(s2408 1.0)
(s2409 1.0)
(s2410 1.0)
(s2411 1.0)
(s2412 1.0)
(s2413 1.0)
(s2414 1.0)
(s2415 1.0)
(s2416 1.0)
(s2417 1.0)
(s2418 1.0)
(s2419 1.0)
(s2420 1.0)
(s2421 0.0)
(s2422 0.0)
(s2423 0.0)
(s2424 0.0)
(s2425 0.0)
(s2426 0.0)
(s2427 0.0)
(s2428 0.0)
(s2429 0.0)
(s2430 0.0)
(s2431 0.0)
(s2432 0.0)
(s2433 0.0)
(s2434 0.0)
(s2435 0.0)
(s2436 0.0)
(s2437 0.0)
(s2438 0.0)
(s2439 0.0)
(s2440 0.0)
(s2441 0.0)
(s2442 0.0)
(s2443 0.0)
(s2444 0.0)
(s2445 0.0)
(s2446 0.0)
(s2447 0.0)
(s2448 0.0)
(s2449 0.0)
(s2450 0.0)
(s2451 0.0)
(s2452 0.0)
(s2453 0.0)
(s2454 0.0)
(s2455 0.0)
(s2456 0.0)
(s2457 0.0)
(s2458 0.0)
(s2459 0.0)
(s2460 0.0)
(s2461 0.0)
(s2462 0.0)
(s2463 0.0)
(s2464 0.0)
(s2465 0.0)
(s2466 0.0)
(s2467 0.0)
(s2468 0.0)
(s2469 0.0)
(s2470 0.0)
(s2471 0.0)
(s2472 0.0)
(s2473 0.0)
(s2474 0.0)
(s2475 0.0)
(s2476 0.0)
(s2477 0.0)
(s2478 0.0)
(s2479 1.0)
(s2480 0.0)
(s2481 0.0)
(s2482 0.0)
(s2483 0.0)
(s2484 0.0)
(s2485 0.0)
(s2486 0.0)
(s2487 0.0)
(s2488 0.0)
(s2489 0.0)
(s2490 0.0)
(s2491 0.0)
(s2492 0.0)
(s2493 0.0)
(s2494 0.0)
(s2495 0.0)
(s2496 0.0)
(s2497 0.0)
(s2498 0.0)
(s2499 1.0)
(s2500 0.0)
(s2501 0.0)
(s2502 0.0)
(s2503 0.0)
(s2504 0.0)
(s2505 0.0)
(s2506 0.0)
(s2507 0.0)
(s2508 0.0)
(s2509 0.0)
(s2510 0.0)
(s2511 0.0)
(s2512 0.0)
(s2513 0.0)
(s2514 0.0)
(s2515 0.0)
(s2516 0.0)
(s2517 0.0)
(s2518 0.0)
(s2519 1.0)
(s2520 0.0)
(s2521 0.0)
(s2522 0.0)
(s2523 0.0)
(s2524 0.0)
(s2525 0.0)
(s2526 0.0)
(s2527 0.0)
(s2528 0.0)
(s2529 0.0)
(s2530 0.0)
(s2531 0.0)
(s2532 0.0)
(s2533 0.0)
(s2534 0.0)
(s2535 0.0)
(s2536 0.0)
(s2537 0.0)
(s2538 0.0)
(s2539 1.0)
(s2540 0.0)
(s2541 0.0)
(s2542 0.0)
(s2543 0.0)
(s2544 0.0)
(s2545 0.0)
(s2546 0.0)
(s2547 0.0)
(s2548 0.0)
(s2549 0.0)
(s2550 0.0)
(s2551 0.0)
(s2552 0.0)
(s2553 0.0)
(s2554 0.0)
(s2555 0.0)
(s2556 0.0)
(s2557 0.0)
(s2558 0.0)
(s2559 1.0)
(s2560 0.0)
(s2561 0.0)
(s2562 0.0)
(s2563 0.0)
(s2564 0.0)
(s2565 0.0)
(s2566 0.0)
(s2567 0.0)
(s2568 0.0)
(s2569 0.0)
(s2570 0.0)
(s2571 0.0)
(s2572 0.0)
(s2573 0.0)
(s2574 0.0)
(s2575 0.0)
(s2576 0.0)
(s2577 0.0)
(s2578 0.0)
(s2579 1.0)
(s2580 0.0)
(s2581 0.0)
(s2582 0.0)
(s2583 0.0)
(s2584 0.0)
(s2585 0.0)
(s2586 0.0)
(s2587 0.0)
(s2588 0.0)
(s2589 0.0)
(s2590 0.0)
(s2591 0.0)
(s2592 0.0)
(s2593 0.0)
(s2594 0.0)
(s2595 0.0)
(s2596 0.0)
(s2597 0.0)
(s2598 0.0)
(s2599 1.0)
(s2600 0.0)
(s2601 0.0)
(s2602 0.0)
(s2603 0.0)
(s2604 0.0)
(s2605 0.0)
(s2606 0.0)
(s2607 0.0)
(s2608 0.0)
(s2609 0.0)
(s2610 0.0)
(s2611 0.0)
(s2612 0.0)
(s2613 0.0)
(s2614 0.0)
(s2615 0.0)
(s2616 0.0)
(s2617 0.0)
(s2618 0.0)
(s2619 1.0)
(s2620 0.0)
(s2621 0.0)
(s2622 0.0)
(s2623 0.0)
(s2624 0.0)
(s2625 0.0)
(s2626 0.0)
(s2627 0.0)
(s2628 0.0)
(s2629 0.0)
(s2630 0.0)
(s2631 0.0)
(s2632 0.0)
(s2633 0.0)
(s2634 0.0)
(s2635 0.0)
(s2636 0.0)
(s2637 0.0)
(s2638 0.0)
(s2639 1.0)
(s2640 0.0)
(s2641 0.0)
(s2642 0.0)
(s2643 0.0)
(s2644 0.0)
(s2645 0.0)
(s2646 0.0)
(s2647 0.0)
(s2648 0.0)
(s2649 0.0)
(s2650 0.0)
(s2651 0.0)
(s2652 0.0)
(s2653 0.0)
(s2654 0.0)
(s2655 0.0)
(s2656 0.0)
(s2657 0.0)
(s2658 0.0)
(s2659 1.0)
(s2660 0.0)
(s2661 0.0)
(s2662 0.0)
(s2663 0.0)
(s2664 0.0)
(s2665 0.0)
(s2666 0.0)
(s2667 0.0)
(s2668 0.0)
(s2669 0.0)
(s2670 0.0)
(s2671 0.0)
(s2672 0.0)
(s2673 0.0)
(s2674 0.0)
(s2675 0.0)
(s2676 0.0)
(s2677 0.0)
(s2678 0.0)
(s2679 1.0)
(s2680 0.0)
(s2681 0.0)
(s2682 0.0)
(s2683 0.0)
(s2684 0.0)
(s2685 0.0)
(s2686 0.0)
(s2687 0.0)
(s2688 0.0)
(s2689 0.0)
(s2690 0.0)
(s2691 0.0)
(s2692 0.0)
(s2693 0.0)
(s2694 0.0)
(s2695 0.0)
(s2696 0.0)
(s2697 0.0)
(s2698 0.0)
(s2699 1.0)
(s2700 0.0)
(s2701 0.0)
(s2702 0.0)
(s2703 0.0)
(s2704 0.0)
(s2705 0.0)
(s2706 0.0)
(s2707 0.0)
(s2708 0.0)
(s2709 0.0)
(s2710 0.0)
(s2711 0.0)
(s2712 0.0)
(s2713 0.0)
(s2714 0.0)
(s2715 0.0)
(s2716 0.0)
(s2717 0.0)
(s2718 0.0)
(s2719 1.0)
(s2720 0.0)
(s2721 0.0)
(s2722 0.0)
(s2723 0.0)
(s2724 0.0)
(s2725 0.0)
(s2726 0.0)
(s2727 0.0)
(s2728 0.0)
(s2729 0.0)
(s2730 0.0)
(s2731 0.0)
(s2732 0.0)
(s2733 0.0)
(s2734 0.0)
(s2735 0.0)
(s2736 0.0)
(s2737 0.0)
(s2738 0.0)
(s2739 1.0)
(s2740 0.0)
(s2741 0.0)
(s2742 0.0)
(s2743 0.0)
(s2744 0.0)
(s2745 0.0)
(s2746 0.0)
(s2747 0.0)
(s2748 0.0)
(s2749 0.0)
(s2750 0.0)
(s2751 0.0)
(s2752 0.0)
(s2753 0.0)
(s2754 0.0)
(s2755 0.0)
(s2756 0.0)
(s2757 0.0)
(s2758 0.0)
(s2759 1.0)
(s2760 0.0)
(s2761 0.0)
(s2762 0.0)
(s2763 0.0)
(s2764 0.0)
(s2765 0.0)
(s2766 0.0)
(s2767 0.0)
(s2768 0.0)
(s2769 0.0)
(s2770 0.0)
(s2771 0.0)
(s2772 0.0)
(s2773 0.0)
(s2774 0.0)
(s2775 0.0)
(s2776 0.0)
(s2777 0.0)
(s2778 0.0)
(s2779 1.0)
(s2780 0.0)
(s2781 0.0)
(s2782 0.0)
(s2783 0.0)
(s2784 0.0)
(s2785 0.0)
(s2786 0.0)
(s2787 0.0)
(s2788 0.0)
(s2789 0.0)
(s2790 0.0)
(s2791 0.0)
(s2792 0.0)
(s2793 0.0)
(s2794 0.0)
(s2795 0.0)
(s2796 0.0)
(s2797 0.0)
(s2798 0.0)
(s2799 1.0)
(s2800 0.0)
(s2801 0.0)
(s2802 0.0)
(s2803 0.0)
(s2804 0.0)
(s2805 0.0)
(s2806 0.0)
(s2807 0.0)
(s2808 0.0)
(s2809 0.0)
(s2810 0.0)
(s2811 0.0)
(s2812 0.0)
(s2813 0.0)
(s2814 0.0)
(s2815 0.0)
(s2816 0.0)
(s2817 0.0)
(s2818 0.0)
(s2819 1.0)
(s2820 0.0)
(s2821 0.0)
(s2822 0.0)
(s2823 0.0)
(s2824 0.0)
(s2825 0.0)
(s2826 0.0)
(s2827 0.0)
(s2828 0.0)
(s2829 0.0)
(s2830 0.0)
(s2831 0.0)
(s2832 0.0)
(s2833 0.0)
(s2834 0.0)
(s2835 0.0)
(s2836 0.0)
(s2837 0.0)
(s2838 0.0)
(s2839 1.0)
(s2840 0.0)
(s2841 0.0)
(s2842 0.0)
(s2843 0.0)
(s2844 0.0)
(s2845 0.0)
(s2846 0.0)
(s2847 0.0)
(s2848 0.0)
(s2849 0.0)
(s2850 0.0)
(s2851 0.0)
(s2852 0.0)
(s2853 0.0)
(s2854 0.0)
(s2855 0.0)
(s2856 0.0)
(s2857 0.0)
(s2858 1.0)
(s2859 0.0)
(s2860 1.0)
(s2861 1.0)
(s2862 1.0)
(s2863 1.0)
(s2864 1.0)
(s2865 1.0)
(s2866 1.0)
(s2867 1.0)
(s2868 1.0)
(s2869 1.0)
(s2870 1.0)
(s2871 1.0)
(s2872 1.0)
(s2873 1.0)
(s2874 1.0)
(s2875 1.0)
(s2876 1.0)
(s2877 1.0)
(s2878 1.0)
(s2879 1.0)
(s2880 1.0)
(s2881 1.0)
(s2882 1.0)
(s2883 1.0)
(s2884 1.0)
(s2885 1.0)
(s2886 1.0)
(s2887 1.0)
(s2888 1.0)
(s2889 1.0)
(s2890 1.0)
(s2891 1.0)
(s2892 1.0)
(s2893 1.0)
(s2894 1.0)
(s2895 1.0)
(s2896 1.0)
(s2897 1.0)
(s2898 1.0)
(s2899 1.0)
(s2900 1.0)
(s2901 1.0)
(s2902 1.0)
(s2903 1.0)
(s2904 1.0)
(s2905 1.0)
(s2906 1.0)
(s2907 1.0)
(s2908 1.0)
(s2909 1.0)
(s2910 1.0)
(s2911 1.0)
(s2912 1.0)
(s2913 1.0)
(s2914 1.0)
(s2915 1.0)
(s2916 1.0)
(s2917 1.0)
(s2918 1.0)
(s2919 1.0)
(s2920 1.0)
(s2921 1.0)
(s2922 1.0)
(s2923 1.0)
(s2924 1.0)
(s2925 1.0)
(s2926 1.0)
(s2927 1.0)
(s2928 1.0)
(s2929 1.0)
(s2930 1.0)
(s2931 1.0)
(s2932 1.0)
(s2933 1.0)
(s2934 1.0)
(s2935 1.0)
(s2936 1.0)
(s2937 1.0)
(s2938 1.0)
(s2939 1.0)
(s2940 1.0)
(s2941 1.0)
(s2942 1.0)
(s2943 1.0)
(s2944 1.0)
(s2945 1.0)
(s2946 1.0)
(s2947 1.0)
(s2948 1.0)
(s2949 1.0)
(s2950 1.0)
(s2951 1.0)
(s2952 1.0)
(s2953 1.0)
(s2954 1.0)
(s2955 1.0)
(s2956 1.0)
(s2957 1.0)
(s2958 1.0)
(s2959 1.0)
(s2960 1.0)
(s2961 1.0)
(s2962 1.0)
(s2963 1.0)
(s2964 1.0)
(s2965 1.0)
(s2966 1.0)
(s2967 1.0)
(s2968 1.0)
(s2969 1.0)
(s2970 1.0)
(s2971 1.0)
(s2972 1.0)
(s2973 1.0)
(s2974 1.0)
(s2975 1.0)
(s2976 1.0)
(s2977 1.0)
(s2978 1.0)
(s2979 1.0)
(s2980 1.0)
(s2981 1.0)
(s2982 1.0)
(s2983 1.0)
(s2984 1.0)
(s2985 1.0)
(s2986 1.0)
(s2987 1.0)
(s2988 1.0)
(s2989 1.0)
(s2990 1.0)
(s2991 1.0)
(s2992 1.0)
(s2993 1.0)
(s2994 1.0)
(s2995 1.0)
(s2996 1.0)
(s2997 1.0)
(s2998 1.0)
(s2999 1.0)
(s3000 1.0)
(s3001 1.0)
(s3002 1.0)
(s3003 1.0)
(s3004 1.0)
(s3005 1.0)
(s3006 1.0)
(s3007 1.0)
(s3008 1.0)
(s3009 1.0)
(s3010 1.0)
(s3011 1.0)
(s3012 1.0)
(s3013 1.0)
(s3014 1.0)
(s3015 1.0)
(s3016 1.0)
(s3017 1.0)
(s3018 1.0)
(s3019 1.0)
(s3020 1.0)
(s3021 1.0)
(s3022 1.0)
(s3023 1.0)
(s3024 1.0)
(s3025 1.0)
(s3026 1.0)
(s3027 1.0)
(s3028 1.0)
(s3029 1.0)
(s3030 1.0)
(s3031 1.0)
(s3032 1.0)
(s3033 1.0)
(s3034 1.0)
(s3035 1.0)
(s3036 1.0)
(s3037 1.0)
(s3038 1.0)
(s3039 1.0)
(s3040 1.0)
(s3041 1.0)
(s3042 1.0)
(s3043 1.0)
(s3044 1.0)
(s3045 1.0)
(s3046 1.0)
(s3047 1.0)
(s3048 1.0)
(s3049 1.0)
(s3050 1.0)
(s3051 1.0)
(s3052 1.0)
(s3053 1.0)
(s3054 1.0)
(s3055 1.0)
(s3056 1.0)
(s3057 1.0)
(s3058 1.0)
(s3059 1.0)
(s3060 1.0)
(s3061 1.0)
(s3062 1.0)
(s3063 1.0)
(s3064 1.0)
(s3065 1.0)
(s3066 1.0)
(s3067 1.0)
(s3068 1.0)
(s3069 1.0)
(s3070 1.0)
(s3071 1.0)
(s3072 1.0)
(s3073 1.0)
(s3074 1.0)
(s3075 1.0)
(s3076 1.0)
(s3077 1.0)
(s3078 1.0)
(s3079 1.0)
(s3080 1.0)
(s3081 1.0)
(s3082 1.0)
(s3083 1.0)
(s3084 1.0)
(s3085 1.0)
(s3086 1.0)
(s3087 1.0)
(s3088 1.0)
(s3089 1.0)
(s3090 1.0)
(s3091 1.0)
(s3092 1.0)
(s3093 1.0)
(s3094 1.0)
(s3095 1.0)
(s3096 1.0)
(s3097 1.0)
(s3098 1.0)
(s3099 1.0)
(s3100 1.0)
(s3101 1.0)
(s3102 1.0)
(s3103 1.0)
(s3104 1.0)
(s3105 1.0)
(s3106 1.0)
(s3107 1.0)
(s3108 1.0)
(s3109 timeout
1.0)
(s3110 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32205ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32231ms
Finished structural reductions in LTL mode , in 1 iterations and 39008 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) p2), p2, (OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 7302 ms.
Product exploration explored 100000 steps with 33333 reset in 7279 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 119 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-20-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-08 finished in 90606 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 X(p1))||X(X(G(!p0)))))'
Support contains 800 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 104 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:38:09] [INFO ] Invariant cache hit.
[2024-05-31 18:38:15] [INFO ] Implicit Places using invariants in 6192 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 6207 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 65 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6377 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 284 ms :[true, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-09
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 2 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-09 finished in 6693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(F(!p1)&&(!p0 U (G(!p0)||(!p0&&(G(!p2)||(!p2&&F(!p3)))))))))))'
Support contains 2040 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 61 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:38:16] [INFO ] Invariant cache hit.
[2024-05-31 18:38:16] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-31 18:38:16] [INFO ] Invariant cache hit.
[2024-05-31 18:38:18] [INFO ] Implicit Places using invariants and state equation in 2027 ms returned []
Implicit Place search using SMT with State Equation took 2576 ms to find 0 implicit places.
[2024-05-31 18:38:18] [INFO ] Redundant transitions in 69 ms returned []
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:38:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32293ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32319ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35037 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 190 ms :[p0, (AND p1 p0), p0, (AND p2 p0 p3), (AND p0 p3)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-10
Product exploration explored 100000 steps with 118 reset in 9838 ms.
Product exploration explored 100000 steps with 115 reset in 9998 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3 (NOT p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0)))))]
Knowledge based reduction with 18 factoid took 236 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 279 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
RANDOM walk for 4015 steps (0 resets) in 471 ms. (8 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3 (NOT p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p2) p3))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) (NOT p3)))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F p0)]
Knowledge based reduction with 18 factoid took 605 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 207 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
Support contains 2040 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 67 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:39:38] [INFO ] Invariant cache hit.
[2024-05-31 18:39:38] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-31 18:39:38] [INFO ] Invariant cache hit.
[2024-05-31 18:39:40] [INFO ] Implicit Places using invariants and state equation in 1988 ms returned []
Implicit Place search using SMT with State Equation took 2527 ms to find 0 implicit places.
[2024-05-31 18:39:40] [INFO ] Redundant transitions in 71 ms returned []
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:39:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32225ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32256ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34930 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3))))]
Knowledge based reduction with 18 factoid took 223 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
RANDOM walk for 4272 steps (0 resets) in 871 ms. (4 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (NOT (AND (NOT p0) (NOT p2) p3))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) (NOT p3)))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F p0)]
Knowledge based reduction with 18 factoid took 600 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 281 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 187 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
Product exploration explored 100000 steps with 115 reset in 5664 ms.
Product exploration explored 100000 steps with 116 reset in 5489 ms.
Support contains 2040 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 56 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:40:50] [INFO ] Invariant cache hit.
[2024-05-31 18:40:50] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-31 18:40:50] [INFO ] Invariant cache hit.
[2024-05-31 18:40:52] [INFO ] Implicit Places using invariants and state equation in 1998 ms returned []
Implicit Place search using SMT with State Equation took 2589 ms to find 0 implicit places.
[2024-05-31 18:40:52] [INFO ] Redundant transitions in 70 ms returned []
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:40:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32271ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32298ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35024 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-10 finished in 189840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G((p1&&(G(p3)||p2))))))'
Support contains 2020 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 29 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:41:26] [INFO ] Invariant cache hit.
[2024-05-31 18:41:26] [INFO ] Implicit Places using invariants in 943 ms returned []
[2024-05-31 18:41:26] [INFO ] Invariant cache hit.
[2024-05-31 18:41:31] [INFO ] Implicit Places using invariants and state equation in 4322 ms returned []
Implicit Place search using SMT with State Equation took 5269 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-31 18:41:31] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32380ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32405ms
Finished structural reductions in LTL mode , in 1 iterations and 37718 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-11 finished in 38005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&(G(p2) U p3))))'
Support contains 1240 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 76 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:42:04] [INFO ] Invariant cache hit.
[2024-05-31 18:42:09] [INFO ] Implicit Places using invariants in 5157 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5174 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 50 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5300 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-13 finished in 5538 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(!p0)))))'
Support contains 820 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 96 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:42:09] [INFO ] Invariant cache hit.
[2024-05-31 18:42:15] [INFO ] Implicit Places using invariants in 5591 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5603 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 70 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5771 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (NOT p1) p0), p0, true]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-14
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-14 finished in 5907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((((p0 U p1)&&F(p2)) U p1) U p0)))'
Support contains 820 out of 3260 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 97 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-31 18:42:15] [INFO ] Invariant cache hit.
[2024-05-31 18:42:20] [INFO ] Implicit Places using invariants in 5223 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5236 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 70 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5404 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-15 finished in 5516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Found a Shortening insensitive property : DatabaseWithMutex-COL-20-LTLFireability-02
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 420 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2860 transition count 2800
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 800 place count 2860 transition count 2400
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1600 place count 2460 transition count 2400
Applied a total of 1600 rules in 499 ms. Remains 2460 /3260 variables (removed 800) and now considering 2400/3200 (removed 800) transitions.
// Phase 1: matrix 2400 rows 2460 cols
[2024-05-31 18:42:21] [INFO ] Computed 460 invariants in 33 ms
[2024-05-31 18:42:25] [INFO ] Implicit Places using invariants in 4173 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 4182 ms to find 400 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2060/3260 places, 2400/3200 transitions.
Applied a total of 0 rules in 77 ms. Remains 2060 /2060 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4759 ms. Remains : 2060/3260 places, 2400/3200 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-02
Product exploration explored 100000 steps with 4586 reset in 3944 ms.
Product exploration explored 100000 steps with 4610 reset in 3897 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 80 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 81 steps (0 resets) in 12 ms. (6 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 102 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 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 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2400 rows 2060 cols
[2024-05-31 18:42:37] [INFO ] Computed 60 invariants in 127 ms
[2024-05-31 18:42:49] [INFO ] [Real]Absence check using 54 positive place invariants in 194 ms returned sat
[2024-05-31 18:42:49] [INFO ] [Real]Absence check using 54 positive and 6 generalized place invariants in 143 ms returned sat
[2024-05-31 18:42:52] [INFO ] [Real]Absence check using state equation in 2434 ms returned unknown
Could not prove EG (NOT p0)
Support contains 420 out of 2060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2060/2060 places, 2400/2400 transitions.
Applied a total of 0 rules in 43 ms. Remains 2060 /2060 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-31 18:42:52] [INFO ] Invariant cache hit.
[2024-05-31 18:42:54] [INFO ] Implicit Places using invariants in 1976 ms returned []
[2024-05-31 18:42:54] [INFO ] Invariant cache hit.
[2024-05-31 18:43:18] [INFO ] Implicit Places using invariants and state equation in 24439 ms returned []
Implicit Place search using SMT with State Equation took 26416 ms to find 0 implicit places.
Running 2000 sub problems to find dead transitions.
[2024-05-31 18:43:18] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2040 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2040/4460 variables, and 39 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2060 constraints, PredecessorRefiner: 2000/2000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2040 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-31 18:43:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:43:52] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:43:52] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:43:52] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:43:52] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:43:52] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:43:52] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:43:52] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:43:52] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2040 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:43:53] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:43:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:43:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:43:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:43:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:43:54] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:43:54] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2040 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:43:54] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:43:54] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:43:55] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:43:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:43:56] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:43:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2040 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:43:56] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 13 ms to minimize.
[2024-05-31 18:43:56] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:43:56] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:43:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:43:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2040 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:43:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:43:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
[2024-05-31 18:43:58] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:43:58] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:43:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 4 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
[2024-05-31 18:43:59] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2040 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:44:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:44:00] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:00] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:44:00] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:00] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:44:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2040 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:44:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:44:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:44:02] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:02] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:03] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:44:04] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2040 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:44:04] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-31 18:44:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:44:04] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:44:04] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:44:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:44:06] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:06] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2040 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:44:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:44:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:44:06] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:44:08] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:44:08] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:08] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2040 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:44:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:44:10] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:44:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:44:10] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:44:10] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:44:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:10] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2040 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:44:11] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-31 18:44:11] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:44:11] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:44:11] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-31 18:44:11] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-31 18:44:11] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-31 18:44:11] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:11] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:44:11] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:44:12] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-31 18:44:12] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:44:12] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-31 18:44:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:12] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:44:12] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-31 18:44:12] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:44:12] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:44:12] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:44:12] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:44:12] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2040 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:44:13] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:44:13] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:44:13] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:44:13] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:44:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:44:15] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2040 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:44:16] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:44:17] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:44:17] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:44:17] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:44:17] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:44:17] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:44:17] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2040 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:44:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:44:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 5 ms to minimize.
[2024-05-31 18:44:18] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:44:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:18] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:44:18] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:44:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:18] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:44:19] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2040 variables, 20/319 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2040/4460 variables, and 319 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2060 constraints, PredecessorRefiner: 0/2000 constraints, Known Traps: 280/280 constraints]
After SMT, in 61472ms problems are : Problem set: 0 solved, 2000 unsolved
Search for dead transitions found 0 dead transitions in 61490ms
Finished structural reductions in LTL mode , in 1 iterations and 87953 ms. Remains : 2060/2060 places, 2400/2400 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 71 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 87 steps (0 resets) in 8 ms. (9 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 99 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 18:44:23] [INFO ] Invariant cache hit.
[2024-05-31 18:44:35] [INFO ] [Real]Absence check using 54 positive place invariants in 170 ms returned sat
[2024-05-31 18:44:36] [INFO ] [Real]Absence check using 54 positive and 6 generalized place invariants in 173 ms returned sat
[2024-05-31 18:44:38] [INFO ] [Real]Absence check using state equation in 2137 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4608 reset in 3902 ms.
Product exploration explored 100000 steps with 4603 reset in 3982 ms.
Support contains 420 out of 2060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2060/2060 places, 2400/2400 transitions.
Applied a total of 0 rules in 46 ms. Remains 2060 /2060 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-31 18:44:46] [INFO ] Invariant cache hit.
[2024-05-31 18:44:48] [INFO ] Implicit Places using invariants in 2013 ms returned []
[2024-05-31 18:44:48] [INFO ] Invariant cache hit.
[2024-05-31 18:45:13] [INFO ] Implicit Places using invariants and state equation in 25445 ms returned []
Implicit Place search using SMT with State Equation took 27459 ms to find 0 implicit places.
Running 2000 sub problems to find dead transitions.
[2024-05-31 18:45:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2040 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2040/4460 variables, and 39 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2060 constraints, PredecessorRefiner: 2000/2000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2040 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:45:46] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:46] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:45:46] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:45:46] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:45:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:45:46] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:45:47] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2040 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:45:48] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:45:48] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:48] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:45:48] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:45:48] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:45:48] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:45:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:45:48] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:45:48] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:45:48] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:45:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:45:49] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:45:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:45:49] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:45:49] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:45:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:45:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:45:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:45:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2040 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:45:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:45:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:45:51] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:45:51] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:45:51] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:45:51] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:45:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2040 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:45:52] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:45:53] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:45:53] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:45:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:53] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2040 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:45:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:45:53] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 5 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:45:54] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:45:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:55] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:45:55] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:45:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:45:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2040 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:45:55] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:45:56] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:45:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:45:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:45:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:45:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2040 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:45:57] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:45:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:59] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:45:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:45:59] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:45:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:45:59] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2040 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:45:59] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:00] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:46:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:01] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:46:01] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-31 18:46:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:46:01] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:46:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2040 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:02] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-31 18:46:03] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:46:03] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:46:03] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:46:03] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:46:03] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:46:03] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:46:03] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:46:03] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2040 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:46:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:46:04] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:46:04] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:46:04] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:46:04] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:46:04] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:46:04] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:46:04] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:46:05] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2040 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:46:06] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:46:06] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-31 18:46:06] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-31 18:46:06] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:46:06] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:46:06] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-31 18:46:07] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2040 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:46:08] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:46:09] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:46:10] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:46:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:46:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:46:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2040 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:46:11] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:46:11] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:46:11] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:46:11] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:46:11] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:46:11] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:46:11] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:46:11] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:46:11] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:46:11] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:46:11] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:46:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:46:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:46:12] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:46:12] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:46:12] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-31 18:46:12] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-31 18:46:12] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-31 18:46:12] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-31 18:46:12] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2040 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-31 18:46:13] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-31 18:46:13] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:46:13] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:46:14] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-31 18:46:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:46:15] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:46:15] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2040 variables, 20/319 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2040/4460 variables, and 319 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2060 constraints, PredecessorRefiner: 0/2000 constraints, Known Traps: 280/280 constraints]
After SMT, in 61574ms problems are : Problem set: 0 solved, 2000 unsolved
Search for dead transitions found 0 dead transitions in 61593ms
Finished structural reductions in LTL mode , in 1 iterations and 89103 ms. Remains : 2060/2060 places, 2400/2400 transitions.
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-02 finished in 235209 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)))'
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)&&(!p1||X((X(!p0)&&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' '!(G(F((G(!p0)||(F(!p1)&&(!p0 U (G(!p0)||(!p0&&(G(!p2)||(!p2&&F(!p3)))))))))))'
[2024-05-31 18:46:17] [INFO ] Flatten gal took : 366 ms
[2024-05-31 18:46:17] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 59 ms.
[2024-05-31 18:46:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3260 places, 3200 transitions and 23200 arcs took 22 ms.
Total runtime 1494748 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-COL-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DatabaseWithMutex-COL-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631131800028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-20.tgz
mv DatabaseWithMutex-COL-20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;