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.r468-smll-171620167200187.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 AutoFlight-PT-48a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167200187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 02:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 02:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 309K 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 AutoFlight-PT-48a-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-48a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717197851401

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:24:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:24:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:24:13] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2024-05-31 23:24:13] [INFO ] Transformed 1127 places.
[2024-05-31 23:24:13] [INFO ] Transformed 1113 transitions.
[2024-05-31 23:24:13] [INFO ] Found NUPN structural information;
[2024-05-31 23:24:13] [INFO ] Parsed PT model containing 1127 places and 1113 transitions and 3458 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 82 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 192 transitions
Reduce redundant transitions removed 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-48a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 1127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1127/1127 places, 921/921 transitions.
Applied a total of 0 rules in 209 ms. Remains 1127 /1127 variables (removed 0) and now considering 921/921 (removed 0) transitions.
// Phase 1: matrix 921 rows 1127 cols
[2024-05-31 23:24:14] [INFO ] Computed 258 invariants in 55 ms
[2024-05-31 23:24:19] [INFO ] Implicit Places using invariants in 5799 ms returned [7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 84, 91, 98, 105, 112, 119, 126, 133, 140, 147, 154, 161, 168, 175, 182, 189, 196, 203, 210, 217, 224, 231, 238, 245, 252, 255, 258, 261, 264, 267, 270, 273, 276, 279, 282, 285, 288, 291, 294, 297, 300, 303, 306, 309, 312, 315, 318, 321, 324, 327, 330, 333, 336, 339, 342, 345, 348, 351, 354, 357, 360, 363, 366, 369, 372, 375, 378, 381, 384, 387, 390, 393, 396, 518, 640, 738, 836, 842, 848, 854, 860, 866, 872, 878, 884, 896, 902, 908, 914, 920, 926, 932, 938, 944, 950, 956, 962, 968, 974, 980, 986, 992, 998, 1004, 1010, 1016, 1022, 1028, 1034, 1040, 1046, 1052, 1058, 1064, 1070, 1076, 1082, 1088, 1094, 1100, 1106, 1112, 1118, 1124, 1126]
Discarding 136 places :
Implicit Place search using SMT only with invariants took 5856 ms to find 136 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 991/1127 places, 921/921 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 941 transition count 871
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 941 transition count 871
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 115 place count 926 transition count 856
Iterating global reduction 0 with 15 rules applied. Total rules applied 130 place count 926 transition count 856
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 144 place count 912 transition count 842
Iterating global reduction 0 with 14 rules applied. Total rules applied 158 place count 912 transition count 842
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 161 place count 909 transition count 839
Iterating global reduction 0 with 3 rules applied. Total rules applied 164 place count 909 transition count 839
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 167 place count 906 transition count 836
Iterating global reduction 0 with 3 rules applied. Total rules applied 170 place count 906 transition count 836
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 173 place count 903 transition count 833
Iterating global reduction 0 with 3 rules applied. Total rules applied 176 place count 903 transition count 833
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 179 place count 900 transition count 830
Iterating global reduction 0 with 3 rules applied. Total rules applied 182 place count 900 transition count 830
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 185 place count 897 transition count 827
Iterating global reduction 0 with 3 rules applied. Total rules applied 188 place count 897 transition count 827
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 191 place count 894 transition count 824
Iterating global reduction 0 with 3 rules applied. Total rules applied 194 place count 894 transition count 824
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 197 place count 891 transition count 821
Iterating global reduction 0 with 3 rules applied. Total rules applied 200 place count 891 transition count 821
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 203 place count 888 transition count 818
Iterating global reduction 0 with 3 rules applied. Total rules applied 206 place count 888 transition count 818
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 209 place count 885 transition count 815
Iterating global reduction 0 with 3 rules applied. Total rules applied 212 place count 885 transition count 815
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 215 place count 882 transition count 812
Iterating global reduction 0 with 3 rules applied. Total rules applied 218 place count 882 transition count 812
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 221 place count 879 transition count 809
Iterating global reduction 0 with 3 rules applied. Total rules applied 224 place count 879 transition count 809
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 227 place count 876 transition count 806
Iterating global reduction 0 with 3 rules applied. Total rules applied 230 place count 876 transition count 806
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 233 place count 873 transition count 803
Iterating global reduction 0 with 3 rules applied. Total rules applied 236 place count 873 transition count 803
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 239 place count 870 transition count 800
Iterating global reduction 0 with 3 rules applied. Total rules applied 242 place count 870 transition count 800
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 245 place count 867 transition count 797
Iterating global reduction 0 with 3 rules applied. Total rules applied 248 place count 867 transition count 797
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 251 place count 864 transition count 794
Iterating global reduction 0 with 3 rules applied. Total rules applied 254 place count 864 transition count 794
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 257 place count 861 transition count 791
Iterating global reduction 0 with 3 rules applied. Total rules applied 260 place count 861 transition count 791
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 263 place count 858 transition count 788
Iterating global reduction 0 with 3 rules applied. Total rules applied 266 place count 858 transition count 788
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 269 place count 855 transition count 785
Iterating global reduction 0 with 3 rules applied. Total rules applied 272 place count 855 transition count 785
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 275 place count 852 transition count 782
Iterating global reduction 0 with 3 rules applied. Total rules applied 278 place count 852 transition count 782
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 281 place count 849 transition count 779
Iterating global reduction 0 with 3 rules applied. Total rules applied 284 place count 849 transition count 779
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 287 place count 846 transition count 776
Iterating global reduction 0 with 3 rules applied. Total rules applied 290 place count 846 transition count 776
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 293 place count 843 transition count 773
Iterating global reduction 0 with 3 rules applied. Total rules applied 296 place count 843 transition count 773
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 299 place count 840 transition count 770
Iterating global reduction 0 with 3 rules applied. Total rules applied 302 place count 840 transition count 770
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 305 place count 837 transition count 767
Iterating global reduction 0 with 3 rules applied. Total rules applied 308 place count 837 transition count 767
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 311 place count 834 transition count 764
Iterating global reduction 0 with 3 rules applied. Total rules applied 314 place count 834 transition count 764
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 317 place count 831 transition count 761
Iterating global reduction 0 with 3 rules applied. Total rules applied 320 place count 831 transition count 761
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 323 place count 828 transition count 758
Iterating global reduction 0 with 3 rules applied. Total rules applied 326 place count 828 transition count 758
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 329 place count 825 transition count 755
Iterating global reduction 0 with 3 rules applied. Total rules applied 332 place count 825 transition count 755
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 335 place count 822 transition count 752
Iterating global reduction 0 with 3 rules applied. Total rules applied 338 place count 822 transition count 752
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 341 place count 819 transition count 749
Iterating global reduction 0 with 3 rules applied. Total rules applied 344 place count 819 transition count 749
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 347 place count 816 transition count 746
Iterating global reduction 0 with 3 rules applied. Total rules applied 350 place count 816 transition count 746
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 353 place count 813 transition count 743
Iterating global reduction 0 with 3 rules applied. Total rules applied 356 place count 813 transition count 743
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 359 place count 810 transition count 740
Iterating global reduction 0 with 3 rules applied. Total rules applied 362 place count 810 transition count 740
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 364 place count 808 transition count 738
Iterating global reduction 0 with 2 rules applied. Total rules applied 366 place count 808 transition count 738
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 368 place count 806 transition count 736
Iterating global reduction 0 with 2 rules applied. Total rules applied 370 place count 806 transition count 736
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 372 place count 804 transition count 734
Iterating global reduction 0 with 2 rules applied. Total rules applied 374 place count 804 transition count 734
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 376 place count 802 transition count 732
Iterating global reduction 0 with 2 rules applied. Total rules applied 378 place count 802 transition count 732
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 380 place count 800 transition count 730
Iterating global reduction 0 with 2 rules applied. Total rules applied 382 place count 800 transition count 730
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 384 place count 798 transition count 728
Iterating global reduction 0 with 2 rules applied. Total rules applied 386 place count 798 transition count 728
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 388 place count 796 transition count 726
Iterating global reduction 0 with 2 rules applied. Total rules applied 390 place count 796 transition count 726
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 392 place count 794 transition count 724
Iterating global reduction 0 with 2 rules applied. Total rules applied 394 place count 794 transition count 724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 396 place count 792 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 398 place count 792 transition count 722
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 400 place count 790 transition count 720
Iterating global reduction 0 with 2 rules applied. Total rules applied 402 place count 790 transition count 720
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 404 place count 788 transition count 718
Iterating global reduction 0 with 2 rules applied. Total rules applied 406 place count 788 transition count 718
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 408 place count 786 transition count 716
Iterating global reduction 0 with 2 rules applied. Total rules applied 410 place count 786 transition count 716
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 412 place count 784 transition count 714
Iterating global reduction 0 with 2 rules applied. Total rules applied 414 place count 784 transition count 714
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 416 place count 782 transition count 712
Iterating global reduction 0 with 2 rules applied. Total rules applied 418 place count 782 transition count 712
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 420 place count 780 transition count 710
Iterating global reduction 0 with 2 rules applied. Total rules applied 422 place count 780 transition count 710
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 424 place count 778 transition count 708
Iterating global reduction 0 with 2 rules applied. Total rules applied 426 place count 778 transition count 708
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 428 place count 776 transition count 706
Iterating global reduction 0 with 2 rules applied. Total rules applied 430 place count 776 transition count 706
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 432 place count 774 transition count 704
Iterating global reduction 0 with 2 rules applied. Total rules applied 434 place count 774 transition count 704
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 436 place count 772 transition count 702
Iterating global reduction 0 with 2 rules applied. Total rules applied 438 place count 772 transition count 702
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 439 place count 771 transition count 701
Iterating global reduction 0 with 1 rules applied. Total rules applied 440 place count 771 transition count 701
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 441 place count 770 transition count 700
Iterating global reduction 0 with 1 rules applied. Total rules applied 442 place count 770 transition count 700
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 443 place count 769 transition count 699
Iterating global reduction 0 with 1 rules applied. Total rules applied 444 place count 769 transition count 699
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 445 place count 768 transition count 698
Iterating global reduction 0 with 1 rules applied. Total rules applied 446 place count 768 transition count 698
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 447 place count 767 transition count 697
Iterating global reduction 0 with 1 rules applied. Total rules applied 448 place count 767 transition count 697
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 449 place count 766 transition count 696
Iterating global reduction 0 with 1 rules applied. Total rules applied 450 place count 766 transition count 696
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 451 place count 765 transition count 695
Iterating global reduction 0 with 1 rules applied. Total rules applied 452 place count 765 transition count 695
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 453 place count 764 transition count 694
Iterating global reduction 0 with 1 rules applied. Total rules applied 454 place count 764 transition count 694
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 455 place count 763 transition count 693
Iterating global reduction 0 with 1 rules applied. Total rules applied 456 place count 763 transition count 693
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 457 place count 762 transition count 692
Iterating global reduction 0 with 1 rules applied. Total rules applied 458 place count 762 transition count 692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 459 place count 761 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 460 place count 761 transition count 691
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 461 place count 760 transition count 690
Iterating global reduction 0 with 1 rules applied. Total rules applied 462 place count 760 transition count 690
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 463 place count 759 transition count 689
Iterating global reduction 0 with 1 rules applied. Total rules applied 464 place count 759 transition count 689
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 465 place count 758 transition count 688
Iterating global reduction 0 with 1 rules applied. Total rules applied 466 place count 758 transition count 688
Applied a total of 466 rules in 2050 ms. Remains 758 /991 variables (removed 233) and now considering 688/921 (removed 233) transitions.
// Phase 1: matrix 688 rows 758 cols
[2024-05-31 23:24:22] [INFO ] Computed 122 invariants in 7 ms
[2024-05-31 23:24:22] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-05-31 23:24:22] [INFO ] Invariant cache hit.
[2024-05-31 23:24:23] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 758/1127 places, 688/921 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9725 ms. Remains : 758/1127 places, 688/921 transitions.
Support contains 15 out of 758 places after structural reductions.
[2024-05-31 23:24:24] [INFO ] Flatten gal took : 139 ms
[2024-05-31 23:24:24] [INFO ] Flatten gal took : 62 ms
[2024-05-31 23:24:24] [INFO ] Input system was already deterministic with 688 transitions.
RANDOM walk for 22152 steps (152 resets) in 1315 ms. (16 steps per ms) remains 0/9 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 4 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 688/688 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 755 transition count 685
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 755 transition count 685
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 753 transition count 683
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 753 transition count 683
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 751 transition count 681
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 751 transition count 681
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 749 transition count 679
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 749 transition count 679
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 747 transition count 677
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 747 transition count 677
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 745 transition count 675
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 745 transition count 675
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 743 transition count 673
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 743 transition count 673
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 741 transition count 671
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 741 transition count 671
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 739 transition count 669
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 739 transition count 669
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 737 transition count 667
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 737 transition count 667
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 735 transition count 665
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 735 transition count 665
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 733 transition count 663
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 733 transition count 663
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 731 transition count 661
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 731 transition count 661
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 729 transition count 659
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 729 transition count 659
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 727 transition count 657
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 727 transition count 657
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 725 transition count 655
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 725 transition count 655
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 723 transition count 653
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 723 transition count 653
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 722 transition count 652
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 722 transition count 652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 721 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 721 transition count 651
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 720 transition count 650
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 720 transition count 650
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 719 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 719 transition count 649
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 718 transition count 648
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 718 transition count 648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 717 transition count 647
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 717 transition count 647
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 716 transition count 646
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 716 transition count 646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 715 transition count 645
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 715 transition count 645
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 714 transition count 644
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 714 transition count 644
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 713 transition count 643
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 713 transition count 643
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 712 transition count 642
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 712 transition count 642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 711 transition count 641
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 711 transition count 641
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 710 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 710 transition count 640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 709 transition count 639
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 709 transition count 639
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 708 transition count 638
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 708 transition count 638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 707 transition count 637
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 707 transition count 637
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 706 transition count 636
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 706 transition count 636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 705 transition count 635
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 705 transition count 635
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 704 transition count 634
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 704 transition count 634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 703 transition count 633
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 703 transition count 633
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 702 transition count 632
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 702 transition count 632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 701 transition count 631
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 701 transition count 631
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 700 transition count 630
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 700 transition count 630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 699 transition count 629
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 699 transition count 629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 698 transition count 628
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 698 transition count 628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 697 transition count 627
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 697 transition count 627
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 696 transition count 626
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 696 transition count 626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 695 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 695 transition count 625
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 694 transition count 624
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 694 transition count 624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 693 transition count 623
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 693 transition count 623
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 692 transition count 622
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 692 transition count 622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 133 place count 691 transition count 621
Iterating global reduction 0 with 1 rules applied. Total rules applied 134 place count 691 transition count 621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 135 place count 690 transition count 620
Iterating global reduction 0 with 1 rules applied. Total rules applied 136 place count 690 transition count 620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 689 transition count 619
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 689 transition count 619
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 688 transition count 618
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 688 transition count 618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 687 transition count 617
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 687 transition count 617
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 686 transition count 616
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 686 transition count 616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 685 transition count 615
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 685 transition count 615
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 147 place count 684 transition count 614
Iterating global reduction 0 with 1 rules applied. Total rules applied 148 place count 684 transition count 614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 149 place count 683 transition count 613
Iterating global reduction 0 with 1 rules applied. Total rules applied 150 place count 683 transition count 613
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 151 place count 682 transition count 612
Iterating global reduction 0 with 1 rules applied. Total rules applied 152 place count 682 transition count 612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 681 transition count 611
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 681 transition count 611
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 155 place count 680 transition count 610
Iterating global reduction 0 with 1 rules applied. Total rules applied 156 place count 680 transition count 610
Applied a total of 156 rules in 904 ms. Remains 680 /758 variables (removed 78) and now considering 610/688 (removed 78) transitions.
// Phase 1: matrix 610 rows 680 cols
[2024-05-31 23:24:25] [INFO ] Computed 122 invariants in 6 ms
[2024-05-31 23:24:26] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-31 23:24:26] [INFO ] Invariant cache hit.
[2024-05-31 23:24:27] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
Running 609 sub problems to find dead transitions.
[2024-05-31 23:24:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/679 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (OVERLAPS) 1/680 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 610/1290 variables, 680/802 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1290/1290 variables, and 802 constraints, problems are : Problem set: 0 solved, 609 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, State Equation: 680/680 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/679 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (OVERLAPS) 1/680 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 3 (OVERLAPS) 610/1290 variables, 680/802 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1290 variables, 609/1411 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1290/1290 variables, and 1411 constraints, problems are : Problem set: 0 solved, 609 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, State Equation: 680/680 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 0/0 constraints]
After SMT, in 60367ms problems are : Problem set: 0 solved, 609 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Starting structural reductions in LTL mode, iteration 1 : 680/758 places, 610/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62725 ms. Remains : 680/758 places, 610/688 transitions.
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-48a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-48a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48a-LTLCardinality-03 finished in 63179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 688/688 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 754 transition count 684
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 754 transition count 684
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 751 transition count 681
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 751 transition count 681
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 748 transition count 678
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 748 transition count 678
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 745 transition count 675
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 745 transition count 675
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 742 transition count 672
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 742 transition count 672
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 739 transition count 669
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 739 transition count 669
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 736 transition count 666
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 736 transition count 666
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 733 transition count 663
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 733 transition count 663
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 730 transition count 660
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 730 transition count 660
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 727 transition count 657
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 727 transition count 657
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 724 transition count 654
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 724 transition count 654
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 721 transition count 651
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 721 transition count 651
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 718 transition count 648
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 718 transition count 648
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 715 transition count 645
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 715 transition count 645
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 712 transition count 642
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 712 transition count 642
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 710 transition count 640
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 710 transition count 640
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 708 transition count 638
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 708 transition count 638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 707 transition count 637
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 707 transition count 637
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 706 transition count 636
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 706 transition count 636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 705 transition count 635
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 705 transition count 635
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 704 transition count 634
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 704 transition count 634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 703 transition count 633
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 703 transition count 633
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 702 transition count 632
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 702 transition count 632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 701 transition count 631
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 701 transition count 631
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 700 transition count 630
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 700 transition count 630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 699 transition count 629
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 699 transition count 629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 698 transition count 628
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 698 transition count 628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 697 transition count 627
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 697 transition count 627
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 696 transition count 626
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 696 transition count 626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 695 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 695 transition count 625
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 694 transition count 624
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 694 transition count 624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 693 transition count 623
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 693 transition count 623
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 692 transition count 622
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 692 transition count 622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 133 place count 691 transition count 621
Iterating global reduction 0 with 1 rules applied. Total rules applied 134 place count 691 transition count 621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 135 place count 690 transition count 620
Iterating global reduction 0 with 1 rules applied. Total rules applied 136 place count 690 transition count 620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 689 transition count 619
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 689 transition count 619
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 688 transition count 618
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 688 transition count 618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 687 transition count 617
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 687 transition count 617
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 686 transition count 616
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 686 transition count 616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 685 transition count 615
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 685 transition count 615
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 147 place count 684 transition count 614
Iterating global reduction 0 with 1 rules applied. Total rules applied 148 place count 684 transition count 614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 149 place count 683 transition count 613
Iterating global reduction 0 with 1 rules applied. Total rules applied 150 place count 683 transition count 613
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 151 place count 682 transition count 612
Iterating global reduction 0 with 1 rules applied. Total rules applied 152 place count 682 transition count 612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 681 transition count 611
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 681 transition count 611
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 155 place count 680 transition count 610
Iterating global reduction 0 with 1 rules applied. Total rules applied 156 place count 680 transition count 610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 157 place count 679 transition count 609
Iterating global reduction 0 with 1 rules applied. Total rules applied 158 place count 679 transition count 609
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 678 transition count 608
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 678 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 677 transition count 607
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 677 transition count 607
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 163 place count 676 transition count 606
Iterating global reduction 0 with 1 rules applied. Total rules applied 164 place count 676 transition count 606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 675 transition count 605
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 675 transition count 605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 167 place count 674 transition count 604
Iterating global reduction 0 with 1 rules applied. Total rules applied 168 place count 674 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 169 place count 673 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 170 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 171 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 172 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 173 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 174 place count 671 transition count 601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 175 place count 670 transition count 600
Iterating global reduction 0 with 1 rules applied. Total rules applied 176 place count 670 transition count 600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 177 place count 669 transition count 599
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 669 transition count 599
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 179 place count 668 transition count 598
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 668 transition count 598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 181 place count 667 transition count 597
Iterating global reduction 0 with 1 rules applied. Total rules applied 182 place count 667 transition count 597
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 183 place count 666 transition count 596
Iterating global reduction 0 with 1 rules applied. Total rules applied 184 place count 666 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 185 place count 665 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 665 transition count 595
Applied a total of 186 rules in 836 ms. Remains 665 /758 variables (removed 93) and now considering 595/688 (removed 93) transitions.
// Phase 1: matrix 595 rows 665 cols
[2024-05-31 23:25:28] [INFO ] Computed 122 invariants in 5 ms
[2024-05-31 23:25:29] [INFO ] Implicit Places using invariants in 476 ms returned [531]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 478 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/758 places, 595/688 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 663 transition count 594
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 663 transition count 594
Applied a total of 2 rules in 25 ms. Remains 663 /664 variables (removed 1) and now considering 594/595 (removed 1) transitions.
// Phase 1: matrix 594 rows 663 cols
[2024-05-31 23:25:29] [INFO ] Computed 121 invariants in 4 ms
[2024-05-31 23:25:29] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-05-31 23:25:29] [INFO ] Invariant cache hit.
[2024-05-31 23:25:30] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 663/758 places, 594/688 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2702 ms. Remains : 663/758 places, 594/688 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48a-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1301 steps with 9 reset in 36 ms.
FORMULA AutoFlight-PT-48a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48a-LTLCardinality-07 finished in 2875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 688/688 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 758 transition count 451
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 521 transition count 451
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 474 place count 521 transition count 400
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 576 place count 470 transition count 400
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 579 place count 467 transition count 397
Iterating global reduction 2 with 3 rules applied. Total rules applied 582 place count 467 transition count 397
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 736 place count 390 transition count 320
Applied a total of 736 rules in 156 ms. Remains 390 /758 variables (removed 368) and now considering 320/688 (removed 368) transitions.
// Phase 1: matrix 320 rows 390 cols
[2024-05-31 23:25:31] [INFO ] Computed 122 invariants in 2 ms
[2024-05-31 23:25:31] [INFO ] Implicit Places using invariants in 539 ms returned [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, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 295]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 542 ms to find 48 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 342/758 places, 320/688 transitions.
Graph (trivial) has 171 edges and 342 vertex of which 13 / 342 are part of one of the 1 SCC in 3 ms
Free SCC test removed 12 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 330 transition count 262
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 295 transition count 262
Applied a total of 71 rules in 38 ms. Remains 295 /342 variables (removed 47) and now considering 262/320 (removed 58) transitions.
// Phase 1: matrix 262 rows 295 cols
[2024-05-31 23:25:31] [INFO ] Computed 74 invariants in 1 ms
[2024-05-31 23:25:31] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-31 23:25:31] [INFO ] Invariant cache hit.
[2024-05-31 23:25:32] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:25:32] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 295/758 places, 262/688 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1506 ms. Remains : 295/758 places, 262/688 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-48a-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 1242 ms.
Product exploration explored 100000 steps with 50000 reset in 1182 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48a-LTLCardinality-08 finished in 4014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 688/688 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 754 transition count 684
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 754 transition count 684
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 751 transition count 681
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 751 transition count 681
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 748 transition count 678
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 748 transition count 678
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 745 transition count 675
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 745 transition count 675
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 742 transition count 672
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 742 transition count 672
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 739 transition count 669
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 739 transition count 669
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 736 transition count 666
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 736 transition count 666
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 733 transition count 663
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 733 transition count 663
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 730 transition count 660
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 730 transition count 660
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 727 transition count 657
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 727 transition count 657
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 724 transition count 654
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 724 transition count 654
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 721 transition count 651
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 721 transition count 651
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 718 transition count 648
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 718 transition count 648
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 715 transition count 645
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 715 transition count 645
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 712 transition count 642
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 712 transition count 642
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 710 transition count 640
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 710 transition count 640
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 708 transition count 638
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 708 transition count 638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 707 transition count 637
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 707 transition count 637
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 706 transition count 636
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 706 transition count 636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 705 transition count 635
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 705 transition count 635
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 704 transition count 634
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 704 transition count 634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 703 transition count 633
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 703 transition count 633
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 702 transition count 632
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 702 transition count 632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 701 transition count 631
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 701 transition count 631
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 700 transition count 630
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 700 transition count 630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 699 transition count 629
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 699 transition count 629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 698 transition count 628
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 698 transition count 628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 697 transition count 627
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 697 transition count 627
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 696 transition count 626
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 696 transition count 626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 695 transition count 625
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 695 transition count 625
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 694 transition count 624
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 694 transition count 624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 693 transition count 623
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 693 transition count 623
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 692 transition count 622
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 692 transition count 622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 133 place count 691 transition count 621
Iterating global reduction 0 with 1 rules applied. Total rules applied 134 place count 691 transition count 621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 135 place count 690 transition count 620
Iterating global reduction 0 with 1 rules applied. Total rules applied 136 place count 690 transition count 620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 689 transition count 619
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 689 transition count 619
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 688 transition count 618
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 688 transition count 618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 687 transition count 617
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 687 transition count 617
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 686 transition count 616
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 686 transition count 616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 685 transition count 615
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 685 transition count 615
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 147 place count 684 transition count 614
Iterating global reduction 0 with 1 rules applied. Total rules applied 148 place count 684 transition count 614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 149 place count 683 transition count 613
Iterating global reduction 0 with 1 rules applied. Total rules applied 150 place count 683 transition count 613
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 151 place count 682 transition count 612
Iterating global reduction 0 with 1 rules applied. Total rules applied 152 place count 682 transition count 612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 681 transition count 611
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 681 transition count 611
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 155 place count 680 transition count 610
Iterating global reduction 0 with 1 rules applied. Total rules applied 156 place count 680 transition count 610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 157 place count 679 transition count 609
Iterating global reduction 0 with 1 rules applied. Total rules applied 158 place count 679 transition count 609
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 678 transition count 608
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 678 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 677 transition count 607
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 677 transition count 607
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 163 place count 676 transition count 606
Iterating global reduction 0 with 1 rules applied. Total rules applied 164 place count 676 transition count 606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 675 transition count 605
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 675 transition count 605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 167 place count 674 transition count 604
Iterating global reduction 0 with 1 rules applied. Total rules applied 168 place count 674 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 169 place count 673 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 170 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 171 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 172 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 173 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 174 place count 671 transition count 601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 175 place count 670 transition count 600
Iterating global reduction 0 with 1 rules applied. Total rules applied 176 place count 670 transition count 600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 177 place count 669 transition count 599
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 669 transition count 599
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 179 place count 668 transition count 598
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 668 transition count 598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 181 place count 667 transition count 597
Iterating global reduction 0 with 1 rules applied. Total rules applied 182 place count 667 transition count 597
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 183 place count 666 transition count 596
Iterating global reduction 0 with 1 rules applied. Total rules applied 184 place count 666 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 185 place count 665 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 665 transition count 595
Applied a total of 186 rules in 931 ms. Remains 665 /758 variables (removed 93) and now considering 595/688 (removed 93) transitions.
// Phase 1: matrix 595 rows 665 cols
[2024-05-31 23:25:35] [INFO ] Computed 122 invariants in 4 ms
[2024-05-31 23:25:36] [INFO ] Implicit Places using invariants in 424 ms returned [531]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 426 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/758 places, 595/688 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 663 transition count 594
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 663 transition count 594
Applied a total of 2 rules in 26 ms. Remains 663 /664 variables (removed 1) and now considering 594/595 (removed 1) transitions.
// Phase 1: matrix 594 rows 663 cols
[2024-05-31 23:25:36] [INFO ] Computed 121 invariants in 4 ms
[2024-05-31 23:25:36] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-31 23:25:36] [INFO ] Invariant cache hit.
[2024-05-31 23:25:37] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 663/758 places, 594/688 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2605 ms. Remains : 663/758 places, 594/688 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48a-LTLCardinality-10
Product exploration explored 100000 steps with 1562 reset in 1004 ms.
Product exploration explored 100000 steps with 1523 reset in 1062 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 156 steps (0 resets) in 6 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 23:25:40] [INFO ] Invariant cache hit.
[2024-05-31 23:25:41] [INFO ] [Real]Absence check using 121 positive place invariants in 43 ms returned sat
[2024-05-31 23:25:41] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2024-05-31 23:25:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:25:41] [INFO ] [Nat]Absence check using 121 positive place invariants in 52 ms returned sat
[2024-05-31 23:25:42] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2024-05-31 23:25:42] [INFO ] Computed and/alt/rep : 591/1174/591 causal constraints (skipped 2 transitions) in 54 ms.
[2024-05-31 23:25:48] [INFO ] Added : 561 causal constraints over 113 iterations in 6202 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 594/594 transitions.
Applied a total of 0 rules in 13 ms. Remains 663 /663 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-05-31 23:25:48] [INFO ] Invariant cache hit.
[2024-05-31 23:25:49] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-31 23:25:49] [INFO ] Invariant cache hit.
[2024-05-31 23:25:49] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
Running 593 sub problems to find dead transitions.
[2024-05-31 23:25:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/663 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 594/1257 variables, 663/784 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1257/1257 variables, and 784 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 663/663 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/663 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 3 (OVERLAPS) 594/1257 variables, 663/784 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1257 variables, 593/1377 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1257/1257 variables, and 1377 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 663/663 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Finished structural reductions in LTL mode , in 1 iterations and 61456 ms. Remains : 663/663 places, 594/594 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 284 steps (0 resets) in 7 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 23:26:50] [INFO ] Invariant cache hit.
[2024-05-31 23:26:51] [INFO ] [Real]Absence check using 121 positive place invariants in 50 ms returned sat
[2024-05-31 23:26:51] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2024-05-31 23:26:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:26:52] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2024-05-31 23:26:52] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2024-05-31 23:26:52] [INFO ] Computed and/alt/rep : 591/1174/591 causal constraints (skipped 2 transitions) in 53 ms.
[2024-05-31 23:26:58] [INFO ] Added : 561 causal constraints over 113 iterations in 6196 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1558 reset in 1014 ms.
Product exploration explored 100000 steps with 1541 reset in 1015 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 594/594 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 663 transition count 594
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 150 place count 663 transition count 594
Deduced a syphon composed of 197 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 197 place count 663 transition count 594
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 295 place count 565 transition count 496
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 393 place count 565 transition count 496
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 177 places in 1 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 471 place count 565 transition count 496
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 481 place count 555 transition count 486
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 491 place count 555 transition count 486
Deduced a syphon composed of 167 places in 0 ms
Applied a total of 491 rules in 163 ms. Remains 555 /663 variables (removed 108) and now considering 486/594 (removed 108) transitions.
[2024-05-31 23:27:01] [INFO ] Redundant transitions in 31 ms returned []
Running 485 sub problems to find dead transitions.
// Phase 1: matrix 486 rows 555 cols
[2024-05-31 23:27:01] [INFO ] Computed 121 invariants in 3 ms
[2024-05-31 23:27:01] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (OVERLAPS) 1/555 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 485 unsolved
[2024-05-31 23:27:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 5 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-31 23:27:12] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 6 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 23:27:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-31 23:27:12] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-31 23:27:12] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-31 23:27:12] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 3 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-31 23:27:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-31 23:27:12] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 4 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-31 23:27:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-31 23:27:13] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 4 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-31 23:27:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-31 23:27:13] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 4 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-31 23:27:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-31 23:27:13] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 4 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-31 23:27:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-31 23:27:13] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 4 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-31 23:27:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-31 23:27:14] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 4 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-31 23:27:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-31 23:27:14] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 20/141 constraints. Problems are: Problem set: 20 solved, 465 unsolved
[2024-05-31 23:27:14] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 7 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 4 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 5 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 20/161 constraints. Problems are: Problem set: 40 solved, 445 unsolved
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-31 23:27:21] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-31 23:27:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-31 23:27:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-31 23:27:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-05-31 23:27:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-31 23:27:22] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
[2024-05-31 23:27:22] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 20/181 constraints. Problems are: Problem set: 60 solved, 425 unsolved
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Problem TDEAD140 is UNSAT
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-31 23:27:23] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-05-31 23:27:24] [INFO ] Deduced a trap composed of 195 places in 198 ms of which 4 ms to minimize.
Problem TDEAD146 is UNSAT
[2024-05-31 23:27:24] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
[2024-05-31 23:27:24] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
[2024-05-31 23:27:24] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
[2024-05-31 23:27:24] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-05-31 23:27:24] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
[2024-05-31 23:27:24] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
[2024-05-31 23:27:24] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 20/201 constraints. Problems are: Problem set: 127 solved, 358 unsolved
[2024-05-31 23:27:25] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-31 23:27:25] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-05-31 23:27:25] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD171 is UNSAT
[2024-05-31 23:27:25] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD173 is UNSAT
[2024-05-31 23:27:25] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD175 is UNSAT
[2024-05-31 23:27:25] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD177 is UNSAT
[2024-05-31 23:27:25] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
[2024-05-31 23:27:25] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD181 is UNSAT
[2024-05-31 23:27:25] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-05-31 23:27:25] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD185 is UNSAT
[2024-05-31 23:27:25] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-05-31 23:27:26] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD256 is UNSAT
[2024-05-31 23:27:26] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD258 is UNSAT
[2024-05-31 23:27:26] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD260 is UNSAT
[2024-05-31 23:27:26] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 2 ms to minimize.
Problem TDEAD262 is UNSAT
[2024-05-31 23:27:26] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD264 is UNSAT
[2024-05-31 23:27:26] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD266 is UNSAT
[2024-05-31 23:27:26] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-05-31 23:27:26] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-05-31 23:27:26] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 20/221 constraints. Problems are: Problem set: 147 solved, 338 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/1041 variables, and 221 constraints, problems are : Problem set: 147 solved, 338 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 0/555 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 485/485 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 147 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 0/0 constraints. Problems are: Problem set: 147 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 148/555 variables, 121/121 constraints. Problems are: Problem set: 147 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 100/221 constraints. Problems are: Problem set: 147 solved, 338 unsolved
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD276 is UNSAT
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD278 is UNSAT
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD286 is UNSAT
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD288 is UNSAT
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD290 is UNSAT
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD292 is UNSAT
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD294 is UNSAT
[2024-05-31 23:27:36] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD296 is UNSAT
[2024-05-31 23:27:38] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD459 is UNSAT
[2024-05-31 23:27:38] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD460 is UNSAT
[2024-05-31 23:27:38] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD461 is UNSAT
[2024-05-31 23:27:38] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD462 is UNSAT
[2024-05-31 23:27:38] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD463 is UNSAT
[2024-05-31 23:27:38] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD464 is UNSAT
[2024-05-31 23:27:38] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD465 is UNSAT
[2024-05-31 23:27:38] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD466 is UNSAT
[2024-05-31 23:27:38] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD467 is UNSAT
[2024-05-31 23:27:38] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD469 is UNSAT
[2024-05-31 23:27:38] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 20/241 constraints. Problems are: Problem set: 167 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/241 constraints. Problems are: Problem set: 167 solved, 318 unsolved
At refinement iteration 5 (OVERLAPS) 486/1041 variables, 555/796 constraints. Problems are: Problem set: 167 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 119/915 constraints. Problems are: Problem set: 167 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 318/1233 constraints. Problems are: Problem set: 167 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1041/1041 variables, and 1233 constraints, problems are : Problem set: 167 solved, 318 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 555/555 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 318/485 constraints, Known Traps: 120/120 constraints]
After SMT, in 60277ms problems are : Problem set: 167 solved, 318 unsolved
Search for dead transitions found 167 dead transitions in 60283ms
Found 167 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 167 transitions
Dead transitions reduction (with SMT) removed 167 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 555/663 places, 319/594 transitions.
Graph (complete) has 1015 edges and 555 vertex of which 388 are kept as prefixes of interest. Removing 167 places using SCC suffix rule.3 ms
Discarding 167 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 388 /555 variables (removed 167) and now considering 319/319 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 388/663 places, 319/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60518 ms. Remains : 388/663 places, 319/594 transitions.
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 594/594 transitions.
Applied a total of 0 rules in 22 ms. Remains 663 /663 variables (removed 0) and now considering 594/594 (removed 0) transitions.
// Phase 1: matrix 594 rows 663 cols
[2024-05-31 23:28:01] [INFO ] Computed 121 invariants in 4 ms
[2024-05-31 23:28:02] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-31 23:28:02] [INFO ] Invariant cache hit.
[2024-05-31 23:28:02] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
Running 593 sub problems to find dead transitions.
[2024-05-31 23:28:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/663 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 3 (OVERLAPS) 594/1257 variables, 663/784 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1257/1257 variables, and 784 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 663/663 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/663 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 3 (OVERLAPS) 594/1257 variables, 663/784 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1257 variables, 593/1377 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1257/1257 variables, and 1377 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 663/663 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 0/0 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Finished structural reductions in LTL mode , in 1 iterations and 61389 ms. Remains : 663/663 places, 594/594 transitions.
Treatment of property AutoFlight-PT-48a-LTLCardinality-10 finished in 208245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(p1)&&(G(F(!p2)) U p3)))))'
Support contains 5 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 688/688 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 756 transition count 686
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 756 transition count 686
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 754 transition count 684
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 754 transition count 684
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 752 transition count 682
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 752 transition count 682
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 750 transition count 680
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 750 transition count 680
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 748 transition count 678
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 748 transition count 678
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 746 transition count 676
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 746 transition count 676
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 744 transition count 674
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 744 transition count 674
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 742 transition count 672
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 742 transition count 672
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 740 transition count 670
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 740 transition count 670
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 738 transition count 668
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 738 transition count 668
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 736 transition count 666
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 736 transition count 666
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 734 transition count 664
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 734 transition count 664
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 732 transition count 662
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 732 transition count 662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 730 transition count 660
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 730 transition count 660
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 728 transition count 658
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 728 transition count 658
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 727 transition count 657
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 727 transition count 657
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 726 transition count 656
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 726 transition count 656
Applied a total of 64 rules in 363 ms. Remains 726 /758 variables (removed 32) and now considering 656/688 (removed 32) transitions.
// Phase 1: matrix 656 rows 726 cols
[2024-05-31 23:29:03] [INFO ] Computed 122 invariants in 4 ms
[2024-05-31 23:29:04] [INFO ] Implicit Places using invariants in 502 ms returned [591]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 508 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 725/758 places, 656/688 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 724 transition count 655
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 724 transition count 655
Applied a total of 2 rules in 36 ms. Remains 724 /725 variables (removed 1) and now considering 655/656 (removed 1) transitions.
// Phase 1: matrix 655 rows 724 cols
[2024-05-31 23:29:04] [INFO ] Computed 121 invariants in 5 ms
[2024-05-31 23:29:04] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-31 23:29:04] [INFO ] Invariant cache hit.
[2024-05-31 23:29:05] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 724/758 places, 655/688 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2390 ms. Remains : 724/758 places, 655/688 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (NOT p0), (OR (NOT p3) (NOT p1)), (NOT p1), p2, p2, (NOT p3)]
Running random walk in product with property : AutoFlight-PT-48a-LTLCardinality-14
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-48a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48a-LTLCardinality-14 finished in 2726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : AutoFlight-PT-48a-LTLCardinality-10
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 758/758 places, 688/688 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 757 transition count 449
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 519 transition count 449
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 476 place count 519 transition count 398
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 625 place count 421 transition count 398
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 2 with 47 rules applied. Total rules applied 672 place count 421 transition count 351
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 192 edges and 374 vertex of which 3 / 374 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 57 rules applied. Total rules applied 729 place count 372 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 732 place count 372 transition count 339
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 735 place count 369 transition count 336
Iterating global reduction 5 with 3 rules applied. Total rules applied 738 place count 369 transition count 336
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 886 place count 295 transition count 262
Applied a total of 886 rules in 58 ms. Remains 295 /758 variables (removed 463) and now considering 262/688 (removed 426) transitions.
// Phase 1: matrix 262 rows 295 cols
[2024-05-31 23:29:06] [INFO ] Computed 75 invariants in 1 ms
[2024-05-31 23:29:06] [INFO ] Implicit Places using invariants in 274 ms returned [238]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 275 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 294/758 places, 262/688 transitions.
Applied a total of 0 rules in 6 ms. Remains 294 /294 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 341 ms. Remains : 294/758 places, 262/688 transitions.
Running random walk in product with property : AutoFlight-PT-48a-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property AutoFlight-PT-48a-LTLCardinality-10 finished in 574 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-31 23:29:06] [INFO ] Flatten gal took : 51 ms
[2024-05-31 23:29:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-31 23:29:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 758 places, 688 transitions and 1883 arcs took 11 ms.
Total runtime 293524 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutoFlight-PT-48a-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717198880472

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-48a-LTLCardinality-10
ltl formula formula --ltl=/tmp/1261/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 758 places, 688 transitions and 1883 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1261/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1261/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1261/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1261/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 760 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 759, there are 694 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~135 levels ~10000 states ~59856 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~20000 states ~94276 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~40000 states ~168628 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~80000 states ~327460 transitions
pnml2lts-mc( 1/ 4): ~128 levels ~160000 states ~664776 transitions
pnml2lts-mc( 1/ 4): ~128 levels ~320000 states ~1381676 transitions
pnml2lts-mc( 0/ 4): ~126 levels ~640000 states ~2894924 transitions
pnml2lts-mc( 1/ 4): ~128 levels ~1280000 states ~5943436 transitions
pnml2lts-mc( 1/ 4): ~128 levels ~2560000 states ~12499244 transitions
pnml2lts-mc( 1/ 4): ~128 levels ~5120000 states ~26251212 transitions
pnml2lts-mc( 1/ 4): ~128 levels ~10240000 states ~55035508 transitions
pnml2lts-mc( 1/ 4): ~128 levels ~20480000 states ~115057644 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33524248
pnml2lts-mc( 0/ 4): unique states count: 33524692
pnml2lts-mc( 0/ 4): unique transitions count: 198806599
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 165252196
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33524698
pnml2lts-mc( 0/ 4): - cum. max stack depth: 515
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33524698 states 198807121 transitions, fanout: 5.930
pnml2lts-mc( 0/ 4): Total exploration time 732.820 sec (732.810 sec minimum, 732.818 sec on average)
pnml2lts-mc( 0/ 4): States per second: 45748, Transitions per second: 271291
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 268.6MB, 8.4 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/19.0%
pnml2lts-mc( 0/ 4): Stored 700 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 268.6MB (~256.0MB paged-in)

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="AutoFlight-PT-48a"
export BK_EXAMINATION="LTLCardinality"
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 AutoFlight-PT-48a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167200187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-48a.tgz
mv AutoFlight-PT-48a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;