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.r069-tall-171620503800124.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 greatspnxred
Input is CANInsertWithFailure-PT-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503800124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 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 9.8M 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 CANInsertWithFailure-PT-040-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716395758237

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 16:35:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 16:35:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:35:59] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2024-05-22 16:35:59] [INFO ] Transformed 3684 places.
[2024-05-22 16:35:59] [INFO ] Transformed 9840 transitions.
[2024-05-22 16:35:59] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 494 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 507 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 16:36:01] [INFO ] Computed 42 invariants in 474 ms
[2024-05-22 16:36:03] [INFO ] Implicit Places using invariants in 2503 ms returned []
[2024-05-22 16:36:03] [INFO ] Invariant cache hit.
[2024-05-22 16:36:06] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:36:36] [INFO ] Performed 483/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:36:40] [INFO ] Implicit Places using invariants and state equation in 37556 ms returned []
Implicit Place search using SMT with State Equation took 40088 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:36:40] [INFO ] Invariant cache hit.
[2024-05-22 16:36:41] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39885ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 40011ms
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80678 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 43 out of 3683 places after structural reductions.
[2024-05-22 16:37:21] [INFO ] Flatten gal took : 459 ms
[2024-05-22 16:37:21] [INFO ] Flatten gal took : 255 ms
[2024-05-22 16:37:22] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 37 out of 3683 places (down from 43) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 40000 steps (40 resets) in 2383 ms. (16 steps per ms) remains 4/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
[2024-05-22 16:37:23] [INFO ] Invariant cache hit.
[2024-05-22 16:37:23] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3604 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:37:23] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 17 ms to minimize.
[2024-05-22 16:37:24] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 3 ms to minimize.
[2024-05-22 16:37:24] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 2 ms to minimize.
[2024-05-22 16:37:24] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-22 16:37:24] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
[2024-05-22 16:37:24] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-22 16:37:24] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-22 16:37:25] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-22 16:37:25] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 5 ms to minimize.
[2024-05-22 16:37:25] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-22 16:37:25] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 2 ms to minimize.
[2024-05-22 16:37:25] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-22 16:37:25] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-22 16:37:25] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:37:26] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-22 16:37:26] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-22 16:37:26] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-22 16:37:26] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:37:26] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:37:26] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3604 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:37:27] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:37:27] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-22 16:37:27] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:37:27] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:37:27] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-22 16:37:27] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:37:27] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:37:27] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:37:28] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:37:28] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
SMT process timed out in 5119ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 3683 transition count 9562
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 3405 transition count 9561
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1556 Post agglomeration using F-continuation condition.Transition count delta: 1556
Deduced a syphon composed of 1556 places in 11 ms
Reduce places removed 1556 places and 0 transitions.
Iterating global reduction 2 with 3112 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 2 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5151 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1559 times.
Drop transitions (Partial Free agglomeration) removed 1559 transitions
Iterating global reduction 3 with 1559 rules applied. Total rules applied 6712 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 6750 place count 1846 transition count 6524
Applied a total of 6750 rules in 1978 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6524/9840 (removed 3316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1979 ms. Remains : 1846/3683 places, 6524/9840 transitions.
RANDOM walk for 40000 steps (216 resets) in 1083 ms. (36 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
// Phase 1: matrix 6524 rows 1846 cols
[2024-05-22 16:37:30] [INFO ] Computed 42 invariants in 155 ms
[2024-05-22 16:37:30] [INFO ] State equation strengthened by 6313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1767 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 16:37:31] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 16:37:31] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1767 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1767 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 76/1843 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1845 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 16:37:33] [INFO ] Deduced a trap composed of 70 places in 1387 ms of which 12 ms to minimize.
[2024-05-22 16:37:34] [INFO ] Deduced a trap composed of 52 places in 1326 ms of which 11 ms to minimize.
[2024-05-22 16:37:35] [INFO ] Deduced a trap composed of 45 places in 1253 ms of which 11 ms to minimize.
[2024-05-22 16:37:37] [INFO ] Deduced a trap composed of 73 places in 1316 ms of which 10 ms to minimize.
[2024-05-22 16:37:38] [INFO ] Deduced a trap composed of 45 places in 1208 ms of which 11 ms to minimize.
[2024-05-22 16:37:39] [INFO ] Deduced a trap composed of 51 places in 1191 ms of which 10 ms to minimize.
[2024-05-22 16:37:40] [INFO ] Deduced a trap composed of 55 places in 1195 ms of which 10 ms to minimize.
[2024-05-22 16:37:42] [INFO ] Deduced a trap composed of 53 places in 1180 ms of which 10 ms to minimize.
[2024-05-22 16:37:43] [INFO ] Deduced a trap composed of 52 places in 1160 ms of which 9 ms to minimize.
[2024-05-22 16:37:44] [INFO ] Deduced a trap composed of 59 places in 1077 ms of which 9 ms to minimize.
[2024-05-22 16:37:45] [INFO ] Deduced a trap composed of 60 places in 1074 ms of which 9 ms to minimize.
[2024-05-22 16:37:46] [INFO ] Deduced a trap composed of 58 places in 1072 ms of which 9 ms to minimize.
[2024-05-22 16:37:47] [INFO ] Deduced a trap composed of 59 places in 1046 ms of which 9 ms to minimize.
[2024-05-22 16:37:48] [INFO ] Deduced a trap composed of 56 places in 1053 ms of which 9 ms to minimize.
[2024-05-22 16:37:49] [INFO ] Deduced a trap composed of 57 places in 1037 ms of which 10 ms to minimize.
[2024-05-22 16:37:50] [INFO ] Deduced a trap composed of 57 places in 1067 ms of which 9 ms to minimize.
[2024-05-22 16:37:52] [INFO ] Deduced a trap composed of 55 places in 1069 ms of which 9 ms to minimize.
[2024-05-22 16:37:53] [INFO ] Deduced a trap composed of 62 places in 1005 ms of which 9 ms to minimize.
[2024-05-22 16:37:54] [INFO ] Deduced a trap composed of 92 places in 1026 ms of which 10 ms to minimize.
[2024-05-22 16:37:55] [INFO ] Deduced a trap composed of 58 places in 968 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1845 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 16:37:56] [INFO ] Deduced a trap composed of 56 places in 918 ms of which 9 ms to minimize.
[2024-05-22 16:37:57] [INFO ] Deduced a trap composed of 55 places in 1010 ms of which 8 ms to minimize.
[2024-05-22 16:37:58] [INFO ] Deduced a trap composed of 59 places in 989 ms of which 8 ms to minimize.
[2024-05-22 16:37:59] [INFO ] Deduced a trap composed of 50 places in 906 ms of which 8 ms to minimize.
[2024-05-22 16:38:00] [INFO ] Deduced a trap composed of 50 places in 943 ms of which 9 ms to minimize.
[2024-05-22 16:38:00] [INFO ] Deduced a trap composed of 50 places in 933 ms of which 8 ms to minimize.
[2024-05-22 16:38:01] [INFO ] Deduced a trap composed of 81 places in 904 ms of which 8 ms to minimize.
[2024-05-22 16:38:02] [INFO ] Deduced a trap composed of 79 places in 853 ms of which 7 ms to minimize.
[2024-05-22 16:38:03] [INFO ] Deduced a trap composed of 59 places in 877 ms of which 8 ms to minimize.
[2024-05-22 16:38:04] [INFO ] Deduced a trap composed of 63 places in 880 ms of which 8 ms to minimize.
[2024-05-22 16:38:05] [INFO ] Deduced a trap composed of 54 places in 813 ms of which 8 ms to minimize.
[2024-05-22 16:38:06] [INFO ] Deduced a trap composed of 54 places in 813 ms of which 8 ms to minimize.
[2024-05-22 16:38:07] [INFO ] Deduced a trap composed of 54 places in 760 ms of which 8 ms to minimize.
[2024-05-22 16:38:07] [INFO ] Deduced a trap composed of 53 places in 763 ms of which 7 ms to minimize.
[2024-05-22 16:38:08] [INFO ] Deduced a trap composed of 59 places in 810 ms of which 7 ms to minimize.
[2024-05-22 16:38:09] [INFO ] Deduced a trap composed of 55 places in 742 ms of which 7 ms to minimize.
[2024-05-22 16:38:10] [INFO ] Deduced a trap composed of 50 places in 754 ms of which 7 ms to minimize.
[2024-05-22 16:38:11] [INFO ] Deduced a trap composed of 59 places in 714 ms of which 7 ms to minimize.
[2024-05-22 16:38:11] [INFO ] Deduced a trap composed of 45 places in 599 ms of which 6 ms to minimize.
[2024-05-22 16:38:12] [INFO ] Deduced a trap composed of 58 places in 626 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1845 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 16:38:13] [INFO ] Deduced a trap composed of 49 places in 671 ms of which 7 ms to minimize.
[2024-05-22 16:38:13] [INFO ] Deduced a trap composed of 52 places in 638 ms of which 7 ms to minimize.
[2024-05-22 16:38:14] [INFO ] Deduced a trap composed of 53 places in 640 ms of which 6 ms to minimize.
[2024-05-22 16:38:14] [INFO ] Deduced a trap composed of 57 places in 592 ms of which 6 ms to minimize.
[2024-05-22 16:38:15] [INFO ] Deduced a trap composed of 45 places in 579 ms of which 7 ms to minimize.
[2024-05-22 16:38:16] [INFO ] Deduced a trap composed of 47 places in 541 ms of which 5 ms to minimize.
SMT process timed out in 45493ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6523
Applied a total of 2 rules in 286 ms. Remains 1845 /1846 variables (removed 1) and now considering 6523/6524 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 1845/1846 places, 6523/6524 transitions.
RANDOM walk for 40000 steps (217 resets) in 725 ms. (55 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
// Phase 1: matrix 6523 rows 1845 cols
[2024-05-22 16:38:16] [INFO ] Computed 42 invariants in 141 ms
[2024-05-22 16:38:17] [INFO ] State equation strengthened by 6315 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:38:17] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:38:19] [INFO ] Deduced a trap composed of 52 places in 1409 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6523/8366 variables, 1843/1887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8366 variables, 6315/8202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8366 variables, 0/8202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8368 variables, 2/8204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8368 variables, 0/8204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/8368 variables, 0/8204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8204 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4595 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6315/6315 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:38:21] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:38:23] [INFO ] Deduced a trap composed of 53 places in 1320 ms of which 10 ms to minimize.
[2024-05-22 16:38:24] [INFO ] Deduced a trap composed of 48 places in 1361 ms of which 10 ms to minimize.
[2024-05-22 16:38:26] [INFO ] Deduced a trap composed of 50 places in 1337 ms of which 11 ms to minimize.
[2024-05-22 16:38:27] [INFO ] Deduced a trap composed of 60 places in 1361 ms of which 11 ms to minimize.
[2024-05-22 16:38:28] [INFO ] Deduced a trap composed of 53 places in 1206 ms of which 11 ms to minimize.
[2024-05-22 16:38:30] [INFO ] Deduced a trap composed of 59 places in 1218 ms of which 10 ms to minimize.
[2024-05-22 16:38:31] [INFO ] Deduced a trap composed of 87 places in 1186 ms of which 10 ms to minimize.
[2024-05-22 16:38:32] [INFO ] Deduced a trap composed of 107 places in 1423 ms of which 10 ms to minimize.
[2024-05-22 16:38:34] [INFO ] Deduced a trap composed of 59 places in 1209 ms of which 10 ms to minimize.
[2024-05-22 16:38:35] [INFO ] Deduced a trap composed of 54 places in 1223 ms of which 10 ms to minimize.
[2024-05-22 16:38:36] [INFO ] Deduced a trap composed of 53 places in 1159 ms of which 9 ms to minimize.
[2024-05-22 16:38:37] [INFO ] Deduced a trap composed of 75 places in 1210 ms of which 10 ms to minimize.
[2024-05-22 16:38:39] [INFO ] Deduced a trap composed of 110 places in 1245 ms of which 9 ms to minimize.
[2024-05-22 16:38:40] [INFO ] Deduced a trap composed of 110 places in 1246 ms of which 10 ms to minimize.
[2024-05-22 16:38:41] [INFO ] Deduced a trap composed of 72 places in 1215 ms of which 9 ms to minimize.
[2024-05-22 16:38:42] [INFO ] Deduced a trap composed of 58 places in 1215 ms of which 10 ms to minimize.
[2024-05-22 16:38:43] [INFO ] Deduced a trap composed of 59 places in 1041 ms of which 8 ms to minimize.
[2024-05-22 16:38:44] [INFO ] Deduced a trap composed of 58 places in 1073 ms of which 9 ms to minimize.
[2024-05-22 16:38:46] [INFO ] Deduced a trap composed of 62 places in 1115 ms of which 9 ms to minimize.
[2024-05-22 16:38:47] [INFO ] Deduced a trap composed of 58 places in 1143 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:38:48] [INFO ] Deduced a trap composed of 54 places in 1082 ms of which 9 ms to minimize.
[2024-05-22 16:38:49] [INFO ] Deduced a trap composed of 56 places in 1069 ms of which 9 ms to minimize.
[2024-05-22 16:38:50] [INFO ] Deduced a trap composed of 52 places in 1092 ms of which 9 ms to minimize.
[2024-05-22 16:38:51] [INFO ] Deduced a trap composed of 68 places in 1048 ms of which 8 ms to minimize.
[2024-05-22 16:38:52] [INFO ] Deduced a trap composed of 53 places in 1049 ms of which 21 ms to minimize.
[2024-05-22 16:38:53] [INFO ] Deduced a trap composed of 53 places in 1071 ms of which 10 ms to minimize.
[2024-05-22 16:38:54] [INFO ] Deduced a trap composed of 55 places in 1077 ms of which 9 ms to minimize.
[2024-05-22 16:38:55] [INFO ] Deduced a trap composed of 61 places in 978 ms of which 9 ms to minimize.
[2024-05-22 16:38:57] [INFO ] Deduced a trap composed of 60 places in 1078 ms of which 8 ms to minimize.
[2024-05-22 16:38:58] [INFO ] Deduced a trap composed of 62 places in 1088 ms of which 8 ms to minimize.
[2024-05-22 16:38:59] [INFO ] Deduced a trap composed of 58 places in 1025 ms of which 8 ms to minimize.
[2024-05-22 16:39:00] [INFO ] Deduced a trap composed of 56 places in 1039 ms of which 9 ms to minimize.
[2024-05-22 16:39:01] [INFO ] Deduced a trap composed of 56 places in 1005 ms of which 8 ms to minimize.
[2024-05-22 16:39:02] [INFO ] Deduced a trap composed of 57 places in 998 ms of which 8 ms to minimize.
[2024-05-22 16:39:03] [INFO ] Deduced a trap composed of 55 places in 991 ms of which 7 ms to minimize.
[2024-05-22 16:39:04] [INFO ] Deduced a trap composed of 56 places in 971 ms of which 8 ms to minimize.
[2024-05-22 16:39:05] [INFO ] Deduced a trap composed of 54 places in 966 ms of which 9 ms to minimize.
[2024-05-22 16:39:06] [INFO ] Deduced a trap composed of 55 places in 982 ms of which 8 ms to minimize.
[2024-05-22 16:39:07] [INFO ] Deduced a trap composed of 55 places in 990 ms of which 9 ms to minimize.
[2024-05-22 16:39:08] [INFO ] Deduced a trap composed of 57 places in 976 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1843 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:39:09] [INFO ] Deduced a trap composed of 56 places in 951 ms of which 9 ms to minimize.
[2024-05-22 16:39:10] [INFO ] Deduced a trap composed of 56 places in 972 ms of which 8 ms to minimize.
[2024-05-22 16:39:11] [INFO ] Deduced a trap composed of 54 places in 942 ms of which 8 ms to minimize.
[2024-05-22 16:39:12] [INFO ] Deduced a trap composed of 56 places in 974 ms of which 8 ms to minimize.
[2024-05-22 16:39:13] [INFO ] Deduced a trap composed of 57 places in 955 ms of which 9 ms to minimize.
[2024-05-22 16:39:14] [INFO ] Deduced a trap composed of 56 places in 985 ms of which 10 ms to minimize.
[2024-05-22 16:39:15] [INFO ] Deduced a trap composed of 53 places in 959 ms of which 9 ms to minimize.
[2024-05-22 16:39:16] [INFO ] Deduced a trap composed of 54 places in 958 ms of which 9 ms to minimize.
[2024-05-22 16:39:17] [INFO ] Deduced a trap composed of 57 places in 947 ms of which 8 ms to minimize.
[2024-05-22 16:39:18] [INFO ] Deduced a trap composed of 57 places in 952 ms of which 8 ms to minimize.
[2024-05-22 16:39:19] [INFO ] Deduced a trap composed of 51 places in 978 ms of which 9 ms to minimize.
[2024-05-22 16:39:20] [INFO ] Deduced a trap composed of 51 places in 1073 ms of which 9 ms to minimize.
[2024-05-22 16:39:21] [INFO ] Deduced a trap composed of 54 places in 977 ms of which 9 ms to minimize.
[2024-05-22 16:39:22] [INFO ] Deduced a trap composed of 53 places in 988 ms of which 8 ms to minimize.
[2024-05-22 16:39:23] [INFO ] Deduced a trap composed of 53 places in 969 ms of which 8 ms to minimize.
[2024-05-22 16:39:24] [INFO ] Deduced a trap composed of 55 places in 983 ms of which 8 ms to minimize.
[2024-05-22 16:39:25] [INFO ] Deduced a trap composed of 57 places in 988 ms of which 8 ms to minimize.
[2024-05-22 16:39:26] [INFO ] Deduced a trap composed of 57 places in 994 ms of which 9 ms to minimize.
[2024-05-22 16:39:27] [INFO ] Deduced a trap composed of 53 places in 985 ms of which 8 ms to minimize.
[2024-05-22 16:39:28] [INFO ] Deduced a trap composed of 58 places in 912 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1843 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:39:29] [INFO ] Deduced a trap composed of 68 places in 915 ms of which 8 ms to minimize.
[2024-05-22 16:39:30] [INFO ] Deduced a trap composed of 52 places in 938 ms of which 8 ms to minimize.
[2024-05-22 16:39:31] [INFO ] Deduced a trap composed of 56 places in 916 ms of which 8 ms to minimize.
[2024-05-22 16:39:32] [INFO ] Deduced a trap composed of 49 places in 910 ms of which 8 ms to minimize.
[2024-05-22 16:39:33] [INFO ] Deduced a trap composed of 52 places in 850 ms of which 7 ms to minimize.
[2024-05-22 16:39:34] [INFO ] Deduced a trap composed of 52 places in 895 ms of which 8 ms to minimize.
[2024-05-22 16:39:34] [INFO ] Deduced a trap composed of 51 places in 849 ms of which 8 ms to minimize.
[2024-05-22 16:39:35] [INFO ] Deduced a trap composed of 53 places in 854 ms of which 8 ms to minimize.
[2024-05-22 16:39:36] [INFO ] Deduced a trap composed of 51 places in 915 ms of which 7 ms to minimize.
SMT process timed out in 79933ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 1845 transition count 6523
Applied a total of 82 rules in 335 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 1845/1845 places, 6523/6523 transitions.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 162 stabilizing places and 280 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(F(((X(p0) U p1)&&!p0))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 190 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 16:39:38] [INFO ] Computed 42 invariants in 407 ms
[2024-05-22 16:39:40] [INFO ] Implicit Places using invariants in 2418 ms returned []
[2024-05-22 16:39:40] [INFO ] Invariant cache hit.
[2024-05-22 16:39:42] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:40:13] [INFO ] Performed 371/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:40:23] [INFO ] Implicit Places using invariants and state equation in 43860 ms returned []
Implicit Place search using SMT with State Equation took 46279 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:40:24] [INFO ] Invariant cache hit.
[2024-05-22 16:40:24] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39586ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39697ms
Finished structural reductions in LTL mode , in 1 iterations and 86191 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-00
Stuttering criterion allowed to conclude after 991 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-00 finished in 86513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1364 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-22 16:41:05] [INFO ] Computed 42 invariants in 141 ms
[2024-05-22 16:41:06] [INFO ] Implicit Places using invariants in 1326 ms returned []
[2024-05-22 16:41:06] [INFO ] Invariant cache hit.
[2024-05-22 16:41:08] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 16:41:23] [INFO ] Implicit Places using invariants and state equation in 16376 ms returned []
Implicit Place search using SMT with State Equation took 17703 ms to find 0 implicit places.
[2024-05-22 16:41:23] [INFO ] Redundant transitions in 845 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-22 16:41:23] [INFO ] Invariant cache hit.
[2024-05-22 16:41:24] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34866ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54860 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-01
Stuttering criterion allowed to conclude after 227 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-01 finished in 54918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X((p1 U p2))||G(p3))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 190 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 16:41:59] [INFO ] Computed 42 invariants in 406 ms
[2024-05-22 16:42:01] [INFO ] Implicit Places using invariants in 2441 ms returned []
[2024-05-22 16:42:01] [INFO ] Invariant cache hit.
[2024-05-22 16:42:04] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:42:34] [INFO ] Performed 365/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:42:45] [INFO ] Implicit Places using invariants and state equation in 44144 ms returned []
Implicit Place search using SMT with State Equation took 46586 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:42:45] [INFO ] Invariant cache hit.
[2024-05-22 16:42:45] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38918ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38996ms
Finished structural reductions in LTL mode , in 1 iterations and 85790 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-03
Product exploration explored 100000 steps with 103 reset in 790 ms.
Product exploration explored 100000 steps with 103 reset in 753 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X p3), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND p3 (NOT p2) (NOT p1))), (X (NOT (AND p3 (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 618 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 15 states, 47 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 567 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (40 resets) in 828 ms. (48 steps per ms) remains 16/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
[2024-05-22 16:43:28] [INFO ] Invariant cache hit.
[2024-05-22 16:43:28] [INFO ] State equation strengthened by 3160 read => feed constraints.
Problem apf11 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
Problem apf20 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 3599/3603 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 11 unsolved
[2024-05-22 16:43:29] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-22 16:43:29] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-22 16:43:29] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
[2024-05-22 16:43:29] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-22 16:43:29] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-22 16:43:29] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:43:29] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-22 16:43:30] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-22 16:43:30] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-22 16:43:30] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:43:30] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-22 16:43:30] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-22 16:43:30] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-22 16:43:30] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:43:31] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:43:31] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 5 ms to minimize.
[2024-05-22 16:43:31] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-22 16:43:31] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:43:31] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-22 16:43:31] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3603 variables, 20/22 constraints. Problems are: Problem set: 5 solved, 11 unsolved
[2024-05-22 16:43:32] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-22 16:43:32] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-22 16:43:32] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-22 16:43:32] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-22 16:43:32] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:43:32] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:43:32] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:43:33] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:43:33] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:43:33] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3603/13523 variables, and 32 constraints, problems are : Problem set: 5 solved, 11 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/40 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/3683 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 5 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 3599/3603 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3603 variables, 30/32 constraints. Problems are: Problem set: 5 solved, 11 unsolved
[2024-05-22 16:43:33] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:43:33] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-22 16:43:34] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:43:34] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:43:34] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:43:34] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:43:34] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:43:34] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:43:34] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:43:35] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3603 variables, 10/42 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3603 variables, 0/42 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 76/3679 variables, 38/80 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3679 variables, 0/80 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/3681 variables, 2/82 constraints. Problems are: Problem set: 5 solved, 11 unsolved
[2024-05-22 16:43:40] [INFO ] Deduced a trap composed of 66 places in 3512 ms of which 23 ms to minimize.
SMT process timed out in 12608ms, After SMT, problems are : Problem set: 5 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 3 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5151 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions (Partial Free agglomeration) removed 1641 transitions
Iterating global reduction 4 with 1641 rules applied. Total rules applied 6794 place count 1846 transition count 6524
Applied a total of 6794 rules in 1165 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6524/9840 (removed 3316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1166 ms. Remains : 1846/3683 places, 6524/9840 transitions.
RANDOM walk for 40000 steps (215 resets) in 1182 ms. (33 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
// Phase 1: matrix 6524 rows 1846 cols
[2024-05-22 16:43:42] [INFO ] Computed 42 invariants in 152 ms
[2024-05-22 16:43:42] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1766 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:43:43] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1766 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1766 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/1842 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:43:45] [INFO ] Deduced a trap composed of 69 places in 1470 ms of which 11 ms to minimize.
[2024-05-22 16:43:47] [INFO ] Deduced a trap composed of 57 places in 1445 ms of which 11 ms to minimize.
[2024-05-22 16:43:48] [INFO ] Deduced a trap composed of 75 places in 1459 ms of which 11 ms to minimize.
[2024-05-22 16:43:50] [INFO ] Deduced a trap composed of 47 places in 1370 ms of which 11 ms to minimize.
[2024-05-22 16:43:51] [INFO ] Deduced a trap composed of 53 places in 1355 ms of which 11 ms to minimize.
[2024-05-22 16:43:52] [INFO ] Deduced a trap composed of 46 places in 1332 ms of which 11 ms to minimize.
[2024-05-22 16:43:54] [INFO ] Deduced a trap composed of 57 places in 1250 ms of which 10 ms to minimize.
[2024-05-22 16:43:55] [INFO ] Deduced a trap composed of 49 places in 1268 ms of which 10 ms to minimize.
[2024-05-22 16:43:56] [INFO ] Deduced a trap composed of 47 places in 1189 ms of which 10 ms to minimize.
[2024-05-22 16:43:57] [INFO ] Deduced a trap composed of 47 places in 1155 ms of which 9 ms to minimize.
[2024-05-22 16:43:58] [INFO ] Deduced a trap composed of 63 places in 1155 ms of which 9 ms to minimize.
[2024-05-22 16:44:00] [INFO ] Deduced a trap composed of 57 places in 1077 ms of which 9 ms to minimize.
[2024-05-22 16:44:01] [INFO ] Deduced a trap composed of 52 places in 1093 ms of which 12 ms to minimize.
[2024-05-22 16:44:02] [INFO ] Deduced a trap composed of 52 places in 1090 ms of which 9 ms to minimize.
[2024-05-22 16:44:03] [INFO ] Deduced a trap composed of 74 places in 1097 ms of which 9 ms to minimize.
[2024-05-22 16:44:04] [INFO ] Deduced a trap composed of 47 places in 1084 ms of which 9 ms to minimize.
[2024-05-22 16:44:05] [INFO ] Deduced a trap composed of 51 places in 1096 ms of which 10 ms to minimize.
[2024-05-22 16:44:06] [INFO ] Deduced a trap composed of 46 places in 1048 ms of which 8 ms to minimize.
[2024-05-22 16:44:07] [INFO ] Deduced a trap composed of 62 places in 1038 ms of which 13 ms to minimize.
[2024-05-22 16:44:08] [INFO ] Deduced a trap composed of 68 places in 979 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:44:09] [INFO ] Deduced a trap composed of 55 places in 922 ms of which 8 ms to minimize.
[2024-05-22 16:44:10] [INFO ] Deduced a trap composed of 57 places in 924 ms of which 8 ms to minimize.
[2024-05-22 16:44:11] [INFO ] Deduced a trap composed of 53 places in 917 ms of which 8 ms to minimize.
[2024-05-22 16:44:12] [INFO ] Deduced a trap composed of 52 places in 910 ms of which 8 ms to minimize.
[2024-05-22 16:44:13] [INFO ] Deduced a trap composed of 55 places in 902 ms of which 8 ms to minimize.
[2024-05-22 16:44:14] [INFO ] Deduced a trap composed of 52 places in 900 ms of which 8 ms to minimize.
[2024-05-22 16:44:15] [INFO ] Deduced a trap composed of 61 places in 917 ms of which 8 ms to minimize.
[2024-05-22 16:44:16] [INFO ] Deduced a trap composed of 56 places in 908 ms of which 8 ms to minimize.
[2024-05-22 16:44:17] [INFO ] Deduced a trap composed of 66 places in 919 ms of which 12 ms to minimize.
[2024-05-22 16:44:18] [INFO ] Deduced a trap composed of 46 places in 852 ms of which 8 ms to minimize.
[2024-05-22 16:44:19] [INFO ] Deduced a trap composed of 45 places in 853 ms of which 8 ms to minimize.
[2024-05-22 16:44:20] [INFO ] Deduced a trap composed of 59 places in 871 ms of which 8 ms to minimize.
[2024-05-22 16:44:20] [INFO ] Deduced a trap composed of 52 places in 873 ms of which 8 ms to minimize.
[2024-05-22 16:44:21] [INFO ] Deduced a trap composed of 47 places in 850 ms of which 8 ms to minimize.
[2024-05-22 16:44:22] [INFO ] Deduced a trap composed of 47 places in 863 ms of which 8 ms to minimize.
[2024-05-22 16:44:23] [INFO ] Deduced a trap composed of 51 places in 817 ms of which 7 ms to minimize.
[2024-05-22 16:44:24] [INFO ] Deduced a trap composed of 56 places in 759 ms of which 7 ms to minimize.
[2024-05-22 16:44:25] [INFO ] Deduced a trap composed of 58 places in 851 ms of which 7 ms to minimize.
[2024-05-22 16:44:26] [INFO ] Deduced a trap composed of 49 places in 776 ms of which 7 ms to minimize.
[2024-05-22 16:44:26] [INFO ] Deduced a trap composed of 53 places in 726 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1844 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:44:27] [INFO ] Deduced a trap composed of 47 places in 713 ms of which 7 ms to minimize.
[2024-05-22 16:44:28] [INFO ] Deduced a trap composed of 48 places in 754 ms of which 7 ms to minimize.
SMT process timed out in 45759ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 168 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 1846/1846 places, 6524/6524 transitions.
RANDOM walk for 40000 steps (217 resets) in 1002 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 87730 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 8
Probabilistic random walk after 87730 steps, saw 24772 distinct states, run finished after 3004 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-22 16:44:32] [INFO ] Invariant cache hit.
[2024-05-22 16:44:32] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1766 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:44:32] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1766 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1766 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/1842 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:44:34] [INFO ] Deduced a trap composed of 53 places in 1401 ms of which 11 ms to minimize.
[2024-05-22 16:44:36] [INFO ] Deduced a trap composed of 53 places in 1402 ms of which 11 ms to minimize.
[2024-05-22 16:44:37] [INFO ] Deduced a trap composed of 45 places in 1372 ms of which 11 ms to minimize.
[2024-05-22 16:44:39] [INFO ] Deduced a trap composed of 59 places in 1324 ms of which 11 ms to minimize.
[2024-05-22 16:44:40] [INFO ] Deduced a trap composed of 58 places in 1311 ms of which 10 ms to minimize.
[2024-05-22 16:44:41] [INFO ] Deduced a trap composed of 60 places in 1296 ms of which 10 ms to minimize.
[2024-05-22 16:44:43] [INFO ] Deduced a trap composed of 55 places in 1268 ms of which 10 ms to minimize.
[2024-05-22 16:44:44] [INFO ] Deduced a trap composed of 62 places in 1341 ms of which 10 ms to minimize.
[2024-05-22 16:44:45] [INFO ] Deduced a trap composed of 56 places in 1293 ms of which 10 ms to minimize.
[2024-05-22 16:44:47] [INFO ] Deduced a trap composed of 57 places in 1255 ms of which 10 ms to minimize.
[2024-05-22 16:44:48] [INFO ] Deduced a trap composed of 54 places in 1243 ms of which 10 ms to minimize.
[2024-05-22 16:44:49] [INFO ] Deduced a trap composed of 54 places in 1207 ms of which 9 ms to minimize.
[2024-05-22 16:44:50] [INFO ] Deduced a trap composed of 54 places in 1170 ms of which 10 ms to minimize.
[2024-05-22 16:44:51] [INFO ] Deduced a trap composed of 55 places in 1137 ms of which 10 ms to minimize.
[2024-05-22 16:44:53] [INFO ] Deduced a trap composed of 51 places in 1086 ms of which 9 ms to minimize.
[2024-05-22 16:44:54] [INFO ] Deduced a trap composed of 54 places in 1059 ms of which 9 ms to minimize.
[2024-05-22 16:44:55] [INFO ] Deduced a trap composed of 58 places in 991 ms of which 8 ms to minimize.
[2024-05-22 16:44:56] [INFO ] Deduced a trap composed of 58 places in 1041 ms of which 9 ms to minimize.
[2024-05-22 16:44:57] [INFO ] Deduced a trap composed of 55 places in 1067 ms of which 9 ms to minimize.
[2024-05-22 16:44:58] [INFO ] Deduced a trap composed of 56 places in 1071 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:44:59] [INFO ] Deduced a trap composed of 60 places in 1039 ms of which 15 ms to minimize.
[2024-05-22 16:45:00] [INFO ] Deduced a trap composed of 58 places in 1004 ms of which 9 ms to minimize.
[2024-05-22 16:45:01] [INFO ] Deduced a trap composed of 57 places in 1016 ms of which 9 ms to minimize.
[2024-05-22 16:45:02] [INFO ] Deduced a trap composed of 56 places in 1007 ms of which 9 ms to minimize.
[2024-05-22 16:45:03] [INFO ] Deduced a trap composed of 58 places in 987 ms of which 9 ms to minimize.
[2024-05-22 16:45:04] [INFO ] Deduced a trap composed of 57 places in 1009 ms of which 9 ms to minimize.
[2024-05-22 16:45:05] [INFO ] Deduced a trap composed of 58 places in 972 ms of which 8 ms to minimize.
[2024-05-22 16:45:06] [INFO ] Deduced a trap composed of 60 places in 1002 ms of which 9 ms to minimize.
[2024-05-22 16:45:07] [INFO ] Deduced a trap composed of 59 places in 961 ms of which 8 ms to minimize.
[2024-05-22 16:45:08] [INFO ] Deduced a trap composed of 58 places in 960 ms of which 8 ms to minimize.
[2024-05-22 16:45:09] [INFO ] Deduced a trap composed of 64 places in 964 ms of which 9 ms to minimize.
[2024-05-22 16:45:10] [INFO ] Deduced a trap composed of 66 places in 962 ms of which 9 ms to minimize.
[2024-05-22 16:45:11] [INFO ] Deduced a trap composed of 73 places in 995 ms of which 9 ms to minimize.
[2024-05-22 16:45:12] [INFO ] Deduced a trap composed of 54 places in 950 ms of which 8 ms to minimize.
[2024-05-22 16:45:13] [INFO ] Deduced a trap composed of 57 places in 983 ms of which 9 ms to minimize.
[2024-05-22 16:45:14] [INFO ] Deduced a trap composed of 54 places in 981 ms of which 8 ms to minimize.
[2024-05-22 16:45:15] [INFO ] Deduced a trap composed of 60 places in 883 ms of which 8 ms to minimize.
[2024-05-22 16:45:16] [INFO ] Deduced a trap composed of 57 places in 884 ms of which 8 ms to minimize.
[2024-05-22 16:45:17] [INFO ] Deduced a trap composed of 56 places in 906 ms of which 8 ms to minimize.
[2024-05-22 16:45:18] [INFO ] Deduced a trap composed of 60 places in 921 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1844 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:45:19] [INFO ] Deduced a trap composed of 56 places in 949 ms of which 8 ms to minimize.
[2024-05-22 16:45:20] [INFO ] Deduced a trap composed of 64 places in 902 ms of which 8 ms to minimize.
[2024-05-22 16:45:21] [INFO ] Deduced a trap composed of 64 places in 922 ms of which 8 ms to minimize.
[2024-05-22 16:45:22] [INFO ] Deduced a trap composed of 58 places in 928 ms of which 8 ms to minimize.
[2024-05-22 16:45:23] [INFO ] Deduced a trap composed of 57 places in 906 ms of which 9 ms to minimize.
[2024-05-22 16:45:24] [INFO ] Deduced a trap composed of 58 places in 895 ms of which 8 ms to minimize.
[2024-05-22 16:45:25] [INFO ] Deduced a trap composed of 57 places in 896 ms of which 8 ms to minimize.
[2024-05-22 16:45:25] [INFO ] Deduced a trap composed of 45 places in 851 ms of which 8 ms to minimize.
[2024-05-22 16:45:26] [INFO ] Deduced a trap composed of 62 places in 837 ms of which 8 ms to minimize.
[2024-05-22 16:45:27] [INFO ] Deduced a trap composed of 45 places in 873 ms of which 8 ms to minimize.
[2024-05-22 16:45:28] [INFO ] Deduced a trap composed of 45 places in 817 ms of which 8 ms to minimize.
[2024-05-22 16:45:29] [INFO ] Deduced a trap composed of 45 places in 783 ms of which 8 ms to minimize.
[2024-05-22 16:45:30] [INFO ] Deduced a trap composed of 57 places in 747 ms of which 7 ms to minimize.
[2024-05-22 16:45:30] [INFO ] Deduced a trap composed of 59 places in 714 ms of which 7 ms to minimize.
[2024-05-22 16:45:31] [INFO ] Deduced a trap composed of 60 places in 701 ms of which 7 ms to minimize.
[2024-05-22 16:45:32] [INFO ] Deduced a trap composed of 57 places in 678 ms of which 7 ms to minimize.
[2024-05-22 16:45:33] [INFO ] Deduced a trap composed of 45 places in 723 ms of which 7 ms to minimize.
[2024-05-22 16:45:33] [INFO ] Deduced a trap composed of 45 places in 739 ms of which 8 ms to minimize.
[2024-05-22 16:45:34] [INFO ] Deduced a trap composed of 59 places in 709 ms of which 7 ms to minimize.
[2024-05-22 16:45:35] [INFO ] Deduced a trap composed of 59 places in 661 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1844 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:45:36] [INFO ] Deduced a trap composed of 52 places in 668 ms of which 6 ms to minimize.
[2024-05-22 16:45:36] [INFO ] Deduced a trap composed of 59 places in 692 ms of which 7 ms to minimize.
[2024-05-22 16:45:37] [INFO ] Deduced a trap composed of 47 places in 577 ms of which 6 ms to minimize.
[2024-05-22 16:45:38] [INFO ] Deduced a trap composed of 47 places in 614 ms of which 6 ms to minimize.
[2024-05-22 16:45:38] [INFO ] Deduced a trap composed of 55 places in 548 ms of which 5 ms to minimize.
[2024-05-22 16:45:39] [INFO ] Deduced a trap composed of 54 places in 595 ms of which 6 ms to minimize.
[2024-05-22 16:45:39] [INFO ] Deduced a trap composed of 53 places in 582 ms of which 6 ms to minimize.
[2024-05-22 16:45:40] [INFO ] Deduced a trap composed of 54 places in 600 ms of which 6 ms to minimize.
[2024-05-22 16:45:41] [INFO ] Deduced a trap composed of 59 places in 593 ms of which 6 ms to minimize.
[2024-05-22 16:45:41] [INFO ] Deduced a trap composed of 53 places in 593 ms of which 6 ms to minimize.
[2024-05-22 16:45:42] [INFO ] Deduced a trap composed of 45 places in 624 ms of which 6 ms to minimize.
[2024-05-22 16:45:43] [INFO ] Deduced a trap composed of 53 places in 592 ms of which 6 ms to minimize.
[2024-05-22 16:45:43] [INFO ] Deduced a trap composed of 45 places in 547 ms of which 6 ms to minimize.
[2024-05-22 16:45:44] [INFO ] Deduced a trap composed of 51 places in 525 ms of which 5 ms to minimize.
[2024-05-22 16:45:44] [INFO ] Deduced a trap composed of 50 places in 536 ms of which 5 ms to minimize.
[2024-05-22 16:45:45] [INFO ] Deduced a trap composed of 53 places in 486 ms of which 6 ms to minimize.
[2024-05-22 16:45:45] [INFO ] Deduced a trap composed of 52 places in 490 ms of which 5 ms to minimize.
[2024-05-22 16:45:46] [INFO ] Deduced a trap composed of 50 places in 472 ms of which 5 ms to minimize.
[2024-05-22 16:45:46] [INFO ] Deduced a trap composed of 49 places in 473 ms of which 5 ms to minimize.
[2024-05-22 16:45:47] [INFO ] Deduced a trap composed of 57 places in 452 ms of which 4 ms to minimize.
SMT process timed out in 75088ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 166 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 170 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2024-05-22 16:45:47] [INFO ] Invariant cache hit.
[2024-05-22 16:45:49] [INFO ] Implicit Places using invariants in 1851 ms returned []
[2024-05-22 16:45:49] [INFO ] Invariant cache hit.
[2024-05-22 16:45:50] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-22 16:46:21] [INFO ] Performed 814/1846 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:46:51] [INFO ] Performed 1771/1846 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 16:46:53] [INFO ] Implicit Places using invariants and state equation in 64033 ms returned []
Implicit Place search using SMT with State Equation took 65886 ms to find 0 implicit places.
[2024-05-22 16:46:54] [INFO ] Redundant transitions in 555 ms returned []
Running 6484 sub problems to find dead transitions.
[2024-05-22 16:46:54] [INFO ] Invariant cache hit.
[2024-05-22 16:46:54] [INFO ] State equation strengthened by 6395 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6484 unsolved
SMT process timed out in 36414ms, After SMT, problems are : Problem set: 0 solved, 6484 unsolved
Search for dead transitions found 0 dead transitions in 36467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103105 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X p3), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND p3 (NOT p2) (NOT p1))), (X (NOT (AND p3 (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (G (OR p2 p3 p0 (NOT p1))), (G (OR p2 (NOT p3) p0 (NOT p1))), (G (OR p2 p0 (NOT p1))), (G (OR (NOT p2) (NOT p3) p0 (NOT p1))), (G (OR (NOT p2) p3 p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (F (NOT (OR p2 (NOT p3) p0 p1))), (F (NOT (AND (NOT p2) p3 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p3) (NOT p0) p1))), (F (NOT (OR p2 p3 p1))), (F p1), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR p2 p3))), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F p2), (F (NOT (OR p2 (NOT p3) (NOT p1)))), (F (NOT p3))]
Knowledge based reduction with 33 factoid took 1150 ms. Reduced automaton from 15 states, 47 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 567 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 639 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 3 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Applied a total of 5149 rules in 833 ms. Remains 1848 /3683 variables (removed 1835) and now considering 6526/9840 (removed 3314) transitions.
// Phase 1: matrix 6526 rows 1848 cols
[2024-05-22 16:47:33] [INFO ] Computed 42 invariants in 159 ms
[2024-05-22 16:47:35] [INFO ] Implicit Places using invariants in 1363 ms returned []
[2024-05-22 16:47:35] [INFO ] Invariant cache hit.
[2024-05-22 16:47:36] [INFO ] State equation strengthened by 4755 read => feed constraints.
[2024-05-22 16:47:53] [INFO ] Implicit Places using invariants and state equation in 18303 ms returned []
Implicit Place search using SMT with State Equation took 19668 ms to find 0 implicit places.
[2024-05-22 16:47:53] [INFO ] Redundant transitions in 474 ms returned []
Running 6486 sub problems to find dead transitions.
[2024-05-22 16:47:53] [INFO ] Invariant cache hit.
[2024-05-22 16:47:54] [INFO ] State equation strengthened by 4755 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)timeout

(s69 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1847 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6486 unsolved
SMT process timed out in 34991ms, After SMT, problems are : Problem set: 0 solved, 6486 unsolved
Search for dead transitions found 0 dead transitions in 35041ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1848/3683 places, 6526/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56037 ms. Remains : 1848/3683 places, 6526/9840 transitions.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Detected a total of 125/1848 stabilizing places and 202/6526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Knowledge based reduction with 37 factoid took 453 ms. Reduced automaton from 14 states, 43 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 603 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (196 resets) in 823 ms. (48 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
[2024-05-22 16:48:30] [INFO ] Invariant cache hit.
[2024-05-22 16:48:30] [INFO ] State equation strengthened by 4755 read => feed constraints.
Problem apf1 is UNSAT
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1764/1768 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1768 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 76/1844 variables, 38/40 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1844 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/1846 variables, 2/42 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1846 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6526/8372 variables, 1846/1888 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8372 variables, 4755/6643 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8372 variables, 0/6643 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/8374 variables, 2/6645 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8374 variables, 0/6645 constraints. Problems are: Problem set: 2 solved, 8 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 8374/8374 variables, and 6645 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1848/1848 constraints, ReadFeed: 4755/4755 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1764/1768 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-22 16:48:36] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1768 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1768 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/1844 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1844 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1846 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-22 16:48:38] [INFO ] Deduced a trap composed of 47 places in 1454 ms of which 11 ms to minimize.
[2024-05-22 16:48:39] [INFO ] Deduced a trap composed of 59 places in 1382 ms of which 11 ms to minimize.
[2024-05-22 16:48:41] [INFO ] Deduced a trap composed of 47 places in 1325 ms of which 10 ms to minimize.
SMT process timed out in 10457ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1848/1848 places, 6526/6526 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions (Partial Free agglomeration) removed 1641 transitions
Iterating global reduction 1 with 1641 rules applied. Total rules applied 1645 place count 1846 transition count 6524
Applied a total of 1645 rules in 455 ms. Remains 1846 /1848 variables (removed 2) and now considering 6524/6526 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 1846/1848 places, 6524/6526 transitions.
RANDOM walk for 40000 steps (213 resets) in 1356 ms. (29 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 90966 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 8
Probabilistic random walk after 90966 steps, saw 25168 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 6524 rows 1846 cols
[2024-05-22 16:48:45] [INFO ] Computed 42 invariants in 158 ms
[2024-05-22 16:48:45] [INFO ] State equation strengthened by 6395 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1766 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1766 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 76/1842 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1842 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/1844 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1844 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6524/8368 variables, 1844/1886 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8368 variables, 6395/8281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8368 variables, 0/8281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/8370 variables, 2/8283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8370 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/8370 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8370/8370 variables, and 8283 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6714 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1846/1846 constraints, ReadFeed: 6395/6395 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1766 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:48:52] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1766 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1766 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 76/1842 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:48:54] [INFO ] Deduced a trap composed of 48 places in 1352 ms of which 10 ms to minimize.
[2024-05-22 16:48:56] [INFO ] Deduced a trap composed of 51 places in 1465 ms of which 11 ms to minimize.
[2024-05-22 16:48:56] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:48:56] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2024-05-22 16:48:58] [INFO ] Deduced a trap composed of 51 places in 1462 ms of which 12 ms to minimize.
[2024-05-22 16:48:59] [INFO ] Deduced a trap composed of 71 places in 1472 ms of which 11 ms to minimize.
[2024-05-22 16:49:01] [INFO ] Deduced a trap composed of 91 places in 1494 ms of which 12 ms to minimize.
[2024-05-22 16:49:02] [INFO ] Deduced a trap composed of 52 places in 1406 ms of which 11 ms to minimize.
[2024-05-22 16:49:03] [INFO ] Deduced a trap composed of 53 places in 1354 ms of which 11 ms to minimize.
[2024-05-22 16:49:05] [INFO ] Deduced a trap composed of 55 places in 1294 ms of which 10 ms to minimize.
[2024-05-22 16:49:06] [INFO ] Deduced a trap composed of 49 places in 1220 ms of which 11 ms to minimize.
[2024-05-22 16:49:07] [INFO ] Deduced a trap composed of 54 places in 1131 ms of which 9 ms to minimize.
[2024-05-22 16:49:08] [INFO ] Deduced a trap composed of 68 places in 1148 ms of which 9 ms to minimize.
[2024-05-22 16:49:09] [INFO ] Deduced a trap composed of 54 places in 1051 ms of which 9 ms to minimize.
[2024-05-22 16:49:10] [INFO ] Deduced a trap composed of 82 places in 1094 ms of which 9 ms to minimize.
[2024-05-22 16:49:12] [INFO ] Deduced a trap composed of 72 places in 1081 ms of which 9 ms to minimize.
[2024-05-22 16:49:13] [INFO ] Deduced a trap composed of 52 places in 1040 ms of which 8 ms to minimize.
[2024-05-22 16:49:14] [INFO ] Deduced a trap composed of 51 places in 1058 ms of which 9 ms to minimize.
[2024-05-22 16:49:15] [INFO ] Deduced a trap composed of 53 places in 996 ms of which 9 ms to minimize.
[2024-05-22 16:49:16] [INFO ] Deduced a trap composed of 49 places in 1003 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1844 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 16:49:17] [INFO ] Deduced a trap composed of 56 places in 1099 ms of which 9 ms to minimize.
[2024-05-22 16:49:18] [INFO ] Deduced a trap composed of 52 places in 1054 ms of which 9 ms to minimize.
[2024-05-22 16:49:19] [INFO ] Deduced a trap composed of 52 places in 1058 ms of which 9 ms to minimize.
[2024-05-22 16:49:20] [INFO ] Deduced a trap composed of 52 places in 1055 ms of which 9 ms to minimize.
[2024-05-22 16:49:21] [INFO ] Deduced a trap composed of 51 places in 1107 ms of which 9 ms to minimize.
[2024-05-22 16:49:22] [INFO ] Deduced a trap composed of 51 places in 1128 ms of which 10 ms to minimize.
[2024-05-22 16:49:24] [INFO ] Deduced a trap composed of 53 places in 1050 ms of which 9 ms to minimize.
[2024-05-22 16:49:25] [INFO ] Deduced a trap composed of 53 places in 1042 ms of which 9 ms to minimize.
[2024-05-22 16:49:26] [INFO ] Deduced a trap composed of 51 places in 1041 ms of which 9 ms to minimize.
[2024-05-22 16:49:27] [INFO ] Deduced a trap composed of 53 places in 1045 ms of which 9 ms to minimize.
[2024-05-22 16:49:28] [INFO ] Deduced a trap composed of 83 places in 1111 ms of which 9 ms to minimize.
[2024-05-22 16:49:29] [INFO ] Deduced a trap composed of 52 places in 1035 ms of which 9 ms to minimize.
[2024-05-22 16:49:30] [INFO ] Deduced a trap composed of 54 places in 1027 ms of which 9 ms to minimize.
[2024-05-22 16:49:31] [INFO ] Deduced a trap composed of 67 places in 1041 ms of which 9 ms to minimize.
[2024-05-22 16:49:32] [INFO ] Deduced a trap composed of 71 places in 1007 ms of which 9 ms to minimize.
[2024-05-22 16:49:33] [INFO ] Deduced a trap composed of 50 places in 969 ms of which 9 ms to minimize.
[2024-05-22 16:49:34] [INFO ] Deduced a trap composed of 55 places in 955 ms of which 8 ms to minimize.
[2024-05-22 16:49:35] [INFO ] Deduced a trap composed of 50 places in 952 ms of which 9 ms to minimize.
[2024-05-22 16:49:36] [INFO ] Deduced a trap composed of 56 places in 903 ms of which 7 ms to minimize.
[2024-05-22 16:49:37] [INFO ] Deduced a trap composed of 52 places in 902 ms of which 8 ms to minimize.
SMT process timed out in 52070ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 170 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 163 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2024-05-22 16:49:37] [INFO ] Invariant cache hit.
[2024-05-22 16:49:39] [INFO ] Implicit Places using invariants in 1889 ms returned []
[2024-05-22 16:49:39] [INFO ] Invariant cache hit.
[2024-05-22 16:49:41] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-22 16:50:11] [INFO ] Performed 708/1846 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:50:41] [INFO ] Performed 1644/1846 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 16:50:47] [INFO ] Implicit Places using invariants and state equation in 67939 ms returned []
Implicit Place search using SMT with State Equation took 69829 ms to find 0 implicit places.
[2024-05-22 16:50:48] [INFO ] Redundant transitions in 496 ms returned []
Running 6484 sub problems to find dead transitions.
[2024-05-22 16:50:48] [INFO ] Invariant cache hit.
[2024-05-22 16:50:48] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6484 unsolved
SMT process timed out in 36114ms, After SMT, problems are : Problem set: 0 solved, 6484 unsolved
Search for dead transitions found 0 dead transitions in 36168ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106689 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 (NOT p1) (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (OR p1 p2 p3))), (F (NOT (AND (NOT p2) p3))), (F p1), (F p2), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR p0 p2 (NOT p3))))]
Knowledge based reduction with 39 factoid took 900 ms. Reduced automaton from 14 states, 43 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 589 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 678 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 547 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 493 reset in 973 ms.
Product exploration explored 100000 steps with 486 reset in 1015 ms.
Support contains 4 out of 1848 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1848/1848 places, 6526/6526 transitions.
Applied a total of 0 rules in 148 ms. Remains 1848 /1848 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1848 cols
[2024-05-22 16:51:29] [INFO ] Computed 42 invariants in 125 ms
[2024-05-22 16:51:30] [INFO ] Implicit Places using invariants in 1252 ms returned []
[2024-05-22 16:51:30] [INFO ] Invariant cache hit.
[2024-05-22 16:51:31] [INFO ] State equation strengthened by 4755 read => feed constraints.
[2024-05-22 16:51:49] [INFO ] Implicit Places using invariants and state equation in 19072 ms returned []
Implicit Place search using SMT with State Equation took 20326 ms to find 0 implicit places.
[2024-05-22 16:51:49] [INFO ] Redundant transitions in 452 ms returned []
Running 6486 sub problems to find dead transitions.
[2024-05-22 16:51:50] [INFO ] Invariant cache hit.
[2024-05-22 16:51:50] [INFO ] State equation strengthened by 4755 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1847 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6486 unsolved
SMT process timed out in 34969ms, After SMT, problems are : Problem set: 0 solved, 6486 unsolved
Search for dead transitions found 0 dead transitions in 35023ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55980 ms. Remains : 1848/1848 places, 6526/6526 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-03 finished in 626602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1 U !p2))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 206 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 16:52:26] [INFO ] Computed 42 invariants in 385 ms
[2024-05-22 16:52:28] [INFO ] Implicit Places using invariants in 2368 ms returned []
[2024-05-22 16:52:28] [INFO ] Invariant cache hit.
[2024-05-22 16:52:30] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:53:00] [INFO ] Performed 350/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:53:12] [INFO ] Implicit Places using invariants and state equation in 44747 ms returned []
Implicit Place search using SMT with State Equation took 47116 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:53:12] [INFO ] Invariant cache hit.
[2024-05-22 16:53:12] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 1.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 1.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 1.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 0.0)
(s1754 0.0)
(s1755 0.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 0.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 0.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 0.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 0.0)
(s1799 0.0)
(s1800 0.0)
(s1801 0.0)
(s1802 0.0)
(s1803 0.0)
(s1804 0.0)
(s1805 0.0)
(s1806 0.0)
(s1807 0.0)
(s1808 0.0)
(s1809 0.0)
(s1810 0.0)
(s1811 0.0)
(s1812 0.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 0.0)
(s1817 0.0)
(s1818 0.0)
(s1819 0.0)
(s1820 0.0)
(s1821 0.0)
(s1822 0.0)
(s1823 0.0)
(s1824 0.0)
(s1825 0.0)
(s1826 0.0)
(s1827 0.0)
(s1828 0.0)
(s1829 0.0)
(s1830 0.0)
(s1831 0.0)
(s1832 0.0)
(s1833 0.0)
(s1834 0.0)
(s1835 0.0)
(s1836 0.0)
(s1837 0.0)
(s1838 0.0)
(s1839 0.0)
(s1840 0.0)
(s1841 0.0)
(s1842 0.0)
(s1843 0.0)
(s1844 0.0)
(s1845 0.0)
(s1846 0.0)
(s1847 0.0)
(s1848 0.0)
(s1849 0.0)
(s1850 0.0)
(s1851 0.0)
(s1852 0.0)
(s1853 0.0)
(s1854 0.0)
(s1855 0.0)
(s1856 0.0)
(s1857 0.0)
(s1858 0.0)
(s1859 0.0)
(s1860 0.0)
(s1861 0.0)
(s1862 0.0)
(s1863 0.0)
(s1864 0.0)
(s1865 0.0)
(s1866 0.0)
(s1867 0.0)
(s1868 0.0)
(s1869 0.0)
(s1870 0.0)
(s1871 0.0)
(s1872 0.0)
(s1873 0.0)
(s1874 0.0)
(s1875 0.0)
(s1876 0.0)
(s1877 0.0)
(s1878 0.0)
(s1879 0.0)
(s1880 0.0)
(s1881 0.0)
(s1882 0.0)
(s1883 0.0)
(s1884 0.0)
(s1885 0.0)
(s1886 0.0)
(s1887 0.0)
(s1888 0.0)
(s1889 0.0)
(s1890 0.0)
(s1891 0.0)
(s1892 0.0)
(s1893 0.0)
(s1894 0.0)
(s1895 0.0)
(s1896 0.0)
(s1897 0.0)
(s1898 0.0)
(s1899 0.0)
(s1900 0.0)
(s1901 0.0)
(s1902 0.0)
(s1903 0.0)
(s1904 0.0)
(s1905 0.0)
(s1906 0.0)
(s1907 0.0)
(s1908 0.0)
(s1909 0.0)
(s1910 0.0)
(s1911 0.0)
(s1912 0.0)
(s1913 0.0)
(s1914 0.0)
(s1915 0.0)
(s1916 0.0)
(s1917 0.0)
(s1918 0.0)
(s1919 0.0)
(s1920 0.0)
(s1921 0.0)
(s1922 0.0)
(s1923 0.0)
(s1924 0.0)
(s1925 0.0)
(s1926 0.0)
(s1927 0.0)
(s1928 0.0)
(s1929 0.0)
(s1930 0.0)
(s1931 0.0)
(s1932 0.0)
(s1933 0.0)
(s1934 0.0)
(s1935 0.0)
(s1936 0.0)
(s1937 0.0)
(s1938 0.0)
(s1939 0.0)
(s1940 0.0)
(s1941 0.0)
(s1942 0.0)
(s1943 0.0)
(s1944 0.0)
(s1945 0.0)
(s1946 0.0)
(s1947 0.0)
(s1948 0.0)
(s1949 0.0)
(s1950 0.0)
(s1951 0.0)
(s1952 0.0)
(s1953 0.0)
(s1954 0.0)
(s1955 0.0)
(s1956 0.0)
(s1957 0.0)
(s1958 0.0)
(s1959 0.0)
(s1960 0.0)
(s1961 0.0)
(s1962 0.0)
(s1963 0.0)
(s1964 0.0)
(s1965 0.0)
(s1966 0.0)
(s1967 0.0)
(s1968 0.0)
(s1969 0.0)
(s1970 0.0)
(s1971 0.0)
(s1972 0.0)
(s1973 0.0)
(s1974 0.0)
(s1975 0.0)
(s1976 0.0)
(s1977 0.0)
(s1978 0.0)
(s1979 0.0)
(s1980 0.0)
(s1981 0.0)
(s1982 0.0)
(s1983 0.0)
(s1984 0.0)
(s1985 0.0)
(s1986 0.0)
(s1987 0.0)
(s1988 0.0)
(s1989 0.0)
(s1990 0.0)
(s1991 0.0)
(s1992 0.0)
(s1993 0.0)
(s1994 0.0)
(s1995 0.0)
(s1996 0.0)
(s1997 0.0)
(s1998 0.0)
(s1999 0.0)
(s2000 0.0)
(s2001 0.0)
(s2002 0.0)
(s2003 0.0)
(s2004 0.0)
(s2005 0.0)
(s2006 0.0)
(s2007 0.0)
(s2008 0.0)
(s2009 0.0)
(s2010 0.0)
(s2011 0.0)
(s2012 0.0)
(s2013 0.0)
(s2014 0.0)
(s2015 0.0)
(s2016 0.0)
(s2017 0.0)
(s2018 0.0)
(s2019 0.0)
(s2020 0.0)
(s2021 0.0)
(s2022 0.0)
(s2023 0.0)
(s2024 0.0)
(s2025 0.0)
(s2026 0.0)
(s2027 0.0)
(s2028 0.0)
(s2029 0.0)
(s2030 0.0)
(s2031 0.0)
(s2032 0.0)
(s2033 0.0)
(s2034 0.0)
(s2035 0.0)
(s2036 0.0)
(s2037 0.0)
(s2038 0.0)
(s2039 0.0)
(s2040 0.0)
(s2041 0.0)
(s2042 0.0)
(s2043 0.0)
(s2044 0.0)
(s2045 0.0)
(s2046 0.0)
(s2047 0.0)
(s2048 0.0)
(s2049 0.0)
(s2050 0.0)
(s2051 0.0)
(s2052 0.0)
(s2053 0.0)
(s2054 0.0)
(s2055 0.0)
(s2056 0.0)
(s2057 0.0)
(s2058 0.0)
(s2059 0.0)
(s2060 0.0)
(s2061 0.0)
(s2062 0.0)
(s2063 0.0)
(s2064 0.0)
(s2065 0.0)
(s2066 0.0)
(s2067 0.0)
(s2068 0.0)
(s2069 0.0)
(s2070 0.0)
(s2071 0.0)
(s2072 0.0)
(s2073 0.0)
(s2074 0.0)
(s2075 0.0)
(s2076 0.0)
(s2077 0.0)
(s2078 0.0)
(s2079 0.0)
(s2080 0.0)
(s2081 0.0)
(s2082 0.0)
(s2083 0.0)
(s2084 0.0)
(s2085 0.0)
(s2086 0.0)
(s2087 0.0)
(s2088 0.0)
(s2089 0.0)
(s2090 0.0)
(s2091 0.0)
(s2092 0.0)
(s2093 0.0)
(s2094 0.0)
(s2095 0.0)
(s2096 0.0)
(s2097 0.0)
(s2098 0.0)
(s2099 0.0)
(s2100 0.0)
(s2101 0.0)
(s2102 0.0)
(s2103 0.0)
(s2104 0.0)
(s2105 0.0)
(s2106 0.0)
(s2107 0.0)
(s2108 0.0)
(s2109 0.0)
(s2110 0.0)
(s2111 0.0)
(s2112 0.0)
(s2113 0.0)
(s2114 0.0)
(s2115 0.0)
(s2116 0.0)
(s2117 0.0)
(s2118 0.0)
(s2119 0.0)
(s2120 0.0)
(s2121 0.0)
(s2122 0.0)
(s2123 0.0)
(s2124 0.0)
(s2125 0.0)
(s2126 0.0)
(s2127 0.0)
(s2128 0.0)
(s2129 0.0)
(s2130 0.0)
(s2131 0.0)
(s2132 0.0)
(s2133 0.0)
(s2134 0.0)
(s2135 0.0)
(s2136 0.0)
(s2137 0.0)
(s2138 0.0)
(s2139 0.0)
(s2140 0.0)
(s2141 0.0)
(s2142 0.0)
(s2143 0.0)
(s2144 0.0)
(s2145 0.0)
(s2146 0.0)
(s2147 0.0)
(s2148 0.0)
(s2149 0.0)
(s2150 0.0)
(s2151 0.0)
(s2152 0.0)
(s2153 0.0)
(s2154 0.0)
(s2155 0.0)
(s2156 0.0)
(s2157 0.0)
(s2158 0.0)
(s2159 0.0)
(s2160 0.0)
(s2161 0.0)
(s2162 0.0)
(s2163 0.0)
(s2164 0.0)
(s2165 0.0)
(s2166 0.0)
(s2167 0.0)
(s2168 0.0)
(s2169 0.0)
(s2170 0.0)
(s2171 0.0)
(s2172 0.0)
(s2173 0.0)
(s2174 0.0)
(s2175 0.0)
(s2176 0.0)
(s2177 0.0)
(s2178 0.0)
(s2179 0.0)
(s2180 0.0)
(s2181 0.0)
(s2182 0.0)
(s2183 0.0)
(s2184 0.0)
(s2185 0.0)
(s2186 0.0)
(s2187 0.0)
(s2188 0.0)
(s2189 0.0)
(s2190 0.0)
(s2191 0.0)
(s2192 0.0)
(s2193 0.0)
(s2194 0.0)
(s2195 0.0)
(s2196 0.0)
(s2197 0.0)
(s2198 0.0)
(s2199 0.0)
(s2200 0.0)
(s2201 0.0)
(s2202 0.0)
(s2203 0.0)
(s2204 0.0)
(s2205 0.0)
(s2206 0.0)
(s2207 0.0)
(s2208 0.0)
(s2209 0.0)
(s2210 0.0)
(s2211 0.0)
(s2212 0.0)
(s2213 0.0)
(s2214 0.0)
(s2215 0.0)
(s2216 0.0)
(s2217 0.0)
(s2218 0.0)
(s2219 0.0)
(s2220 0.0)
(s2221 0.0)
(s2222 0.0)
(s2223 0.0)
(s2224 0.0)
(s2225 0.0)
(s2226 0.0)
(s2227 0.0)
(s2228 0.0)
(s2229 0.0)
(s2230 0.0)
(s2231 0.0)
(s2232 0.0)
(s2233 0.0)
(s2234 0.0)
(s2235 0.0)
(s2236 0.0)
(s2237 0.0)
(s2238 0.0)
(s2239 0.0)
(s2240 0.0)
(s2241 0.0)
(s2242 0.0)
(s2243 0.0)
(s2244 0.0)
(s2245 0.0)
(s2246 0.0)
(s2247 0.0)
(s2248 0.0)
(s2249 0.0)
(s2250 0.0)
(s2251 0.0)
(s2252 0.0)
(s2253 0.0)
(s2254 0.0)
(s2255 0.0)
(s2256 0.0)
(s2257 0.0)
(s2258 0.0)
(s2259 0.0)
(s2260 0.0)
(s2261 0.0)
(s2262 0.0)
(s2263 0.0)
(s2264 0.0)
(s2265 0.0)
(s2266 0.0)
(s2267 0.0)
(s2268 0.0)
(s2269 0.0)
(s2270 0.0)
(s2271 0.0)
(s2272 0.0)
(s2273 0.0)
(s2274 0.0)
(s2275 0.0)
(s2276 0.0)
(s2277 0.0)
(s2278 0.0)
(s2279 0.0)
(s2280 0.0)
(s2281 0.0)
(s2282 0.0)
(s2283 0.0)
(s2284 0.0)
(s2285 0.0)
(s2286 0.0)
(s2287 0.0)
(s2288 0.0)
(s2289 0.0)
(s2290 0.0)
(s2291 0.0)
(s2292 0.0)
(s2293 0.0)
(s2294 0.0)
(s2295 0.0)
(s2296 0.0)
(s2297 0.0)
(s2298 0.0)
(s2299 0.0)
(s2300 0.0)
(s2301 0.0)
(s2302 0.0)
(s2303 0.0)
(s2304 0.0)
(s2305 0.0)
(s2306 0.0)
(s2307 0.0)
(s2308 0.0)
(s2309 0.0)
(s2310 0.0)
(s2311 0.0)
(s2312 0.0)
(s2313 0.0)
(s2314 0.0)
(s2315 0.0)
(s2316 0.0)
(s2317 0.0)
(s2318 0.0)
(s2319 0.0)
(s2320 0.0)
(s2321 0.0)
(s2322 0.0)
(s2323 0.0)
(s2324 0.0)
(s2325 0.0)
(s2326 0.0)
(s2327 0.0)
(s2328 0.0)
(s2329 0.0)
(s2330 0.0)
(s2331 0.0)
(s2332 0.0)
(s2333 0.0)
(s2334 0.0)
(s2335 0.0)
(s2336 0.0)
(s2337 0.0)
(s2338 0.0)
(s2339 0.0)
(s2340 0.0)
(s2341 0.0)
(s2342 0.0)
(s2343 0.0)
(s2344 0.0)
(s2345 0.0)
(s2346 0.0)
(s2347 0.0)
(s2348 0.0)
(s2349 0.0)
(s2350 0.0)
(s2351 0.0)
(s2352 0.0)
(s2353 0.0)
(s2354 0.0)
(s2355 0.0)
(s2356 0.0)
(s2357 0.0)
(s2358 0.0)
(s2359 0.0)
(s2360 0.0)
(s2361 0.0)
(s2362 0.0)
(s2363 0.0)
(s2364 0.0)
(s2365 0.0)
(s2366 0.0)
(s2367 0.0)
(s2368 0.0)
(s2369 0.0)
(s2370 0.0)
(s2371 0.0)
(s2372 0.0)
(s2373 0.0)
(s2374 0.0)
(s2375 0.0)
(s2376 0.0)
(s2377 0.0)
(s2378 0.0)
(s2379 0.0)
(s2380 0.0)
(s2381 0.0)
(s2382 0.0)
(s2383 0.0)
(s2384 0.0)
(s2385 0.0)
(s2386 0.0)
(s2387 0.0)
(s2388 0.0)
(s2389 0.0)
(s2390 0.0)
(s2391 0.0)
(s2392 0.0)
(s2393 0.0)
(s2394 0.0)
(s2395 0.0)
(s2396 0.0)
(s2397 0.0)
(s2398 0.0)
(s2399 0.0)
(s2400 0.0)
(s2401 0.0)
(s2402 0.0)
(s2403 0.0)
(s2404 0.0)
(s2405 0.0)
(s2406 0.0)
(s2407 0.0)
(s2408 0.0)
(s2409 0.0)
(s2410 0.0)
(s2411 0.0)
(s2412 0.0)
(s2413 0.0)
(s2414 0.0)
(s2415 0.0)
(s2416 0.0)
(s2417 0.0)
(s2418 0.0)
(s2419 0.0)
(s2420 0.0)
(s2421 0.0)
(s2422 0.0)
(s2423 0.0)
(s2424 0.0)
(s2425 0.0)
(s2426 0.0)
(s2427 0.0)
(s2428 0.0)
(s2429 0.0)
(s2430 0.0)
(s2431 0.0)
(s2432 0.0)
(s2433 0.0)
(s2434 0.0)
(s2435 0.0)
(s2436 0.0)
(s2437 0.0)
(s2438 0.0)
(s2439 0.0)
(s2440 0.0)
(s2441 0.0)
(s2442 0.0)
(s2443 0.0)
(s2444 0.0)
(s2445 0.0)
(s2446 0.0)
(s2447 0.0)
(s2448 0.0)
(s2449 0.0)
(s2450 0.0)
(s2451 0.0)
(s2452 0.0)
(s2453 0.0)
(s2454 0.0)
(s2455 0.0)
(s2456 0.0)
(s2457 0.0)
(s2458 0.0)
(s2459 0.0)
(s2460 0.0)
(s2461 0.0)
(s2462 0.0)
(s2463 0.0)
(s2464 0.0)
(s2465 0.0)
(s2466 0.0)
(s2467 0.0)
(s2468 0.0)
(s2469 0.0)
(s2470 0.0)
(s2471 0.0)
(s2472 0.0)
(s2473 0.0)
(s2474 0.0)
(s2475 0.0)
(s2476 0.0)
(s2477 0.0)
(s2478 0.0)
(s2479 0.0)
(s2480 0.0)
(s2481 0.0)
(s2482 0.0)
(s2483 0.0)
(s2484 0.0)
(s2485 0.0)
(s2486 0.0)
(s2487 0.0)
(s2488 0.0)
(s2489 0.0)
(s2490 0.0)
(s2491 0.0)
(s2492 0.0)
(s2493 0.0)
(s2494 0.0)
(s2495 0.0)
(s2496 0.0)
(s2497 0.0)
(s2498 0.0)
(s2499 0.0)
(s2500 0.0)
(s2501 0.0)
(s2502 0.0)
(s2503 0.0)
(s2504 0.0)
(s2505 0.0)
(s2506 0.0)
(s2507 0.0)
(s2508 0.0)
(s2509 0.0)
(s2510 0.0)
(s2511 0.0)
(s2512 0.0)
(s2513 0.0)
(s2514 0.0)
(s2515 0.0)
(s2516 0.0)
(s2517 0.0)
(s2518 0.0)
(s2519 0.0)
(s2520 0.0)
(s2521 0.0)
(s2522 0.0)
(s2523 0.0)
(s2524 0.0)
(s2525 0.0)
(s2526 0.0)
(s2527 0.0)
(s2528 0.0)
(s2529 0.0)
(s2530 0.0)
(s2531 0.0)
(s2532 0.0)
(s2533 0.0)
(s2534 0.0)
(s2535 0.0)
(s2536 0.0)
(s2537 0.0)
(s2538 0.0)
(s2539 0.0)
(s2540 0.0)
(s2541 0.0)
(s2542 0.0)
(s2543 0.0)
(s2544 0.0)
(s2545 0.0)
(s2546 0.0)
(s2547 0.0)
(s2548 0.0)
(s2549 0.0)
(s2550 0.0)
(s2551 0.0)
(s2552 0.0)
(s2553 0.0)
(s2554 0.0)
(s2555 0.0)
(s2556 0.0)
(s2557 0.0)
(s2558 0.0)
(s2559 0.0)
(s2560 0.0)
(s2561 0.0)
(s2562 0.0)
(s2563 0.0)
(s2564 0.0)
(s2565 0.0)
(s2566 0.0)
(s2567 0.0)
(s2568 0.0)
(s2569 0.0)
(s2570 0.0)
(s2571 0.0)
(s2572 0.0)
(s2573 0.0)
(s2574 0.0)
(s2575 0.0)
(s2576 0.0)
(s2577 0.0)
(s2578 0.0)
(s2579 0.0)
(s2580 0.0)
(s2581 0.0)
(s2582 0.0)
(s2583 0.0)
(s2584 0.0)
(s2585 0.0)
(s2586 0.0)
(s2587 0.0)
(s2588 0.0)
(s2589 0.0)
(s2590 0.0)
(s2591 0.0)
(s2592 0.0)
(s2593 0.0)
(s2594 0.0)
(s2595 0.0)
(s2596 0.0)
(s2597 0.0)
(s2598 0.0)
(s2599 0.0)
(s2600 0.0)
(s2601 0.0)
(s2602 0.0)
(s2603 0.0)
(s2604 0.0)
(s2605 0.0)
(s2606 0.0)
(s2607 0.0)
(s2608 0.0)
(s2609 0.0)
(s2610 0.0)
(s2611 0.0)
(s2612 0.0)
(s2613 0.0)
(s2614 0.0)
(s2615 0.0)
(s2616 0.0)
(s2617 0.0)
(s2618 0.0)
(s2619 0.0)
(s2620 0.0)
(s2621 0.0)
(s2622 0.0)
(s2623 0.0)
(s2624 0.0)
(s2625 0.0)
(s2626 0.0)
(s2627 0.0)
(s2628 0.0)
(s2629 0.0)
(s2630 0.0)
(s2631 0.0)
(s2632 0.0)
(s2633 0.0)
(s2634 0.0)
(s2635 0.0)
(s2636 0.0)
(s2637 0.0)
(s2638 0.0)
(s2639 0.0)
(s2640 0.0)
(s2641 0.0)
(s2642 0.0)
(s2643 0.0)
(s2644 0.0)
(s2645 0.0)
(s2646 0.0)
(s2647 0.0)
(s2648 0.0)
(s2649 0.0)
(s2650 0.0)
(s2651 0.0)
(s2652 0.0)
(s2653 0.0)
(s2654 0.0)
(s2655 0.0)
(s2656 0.0)
(s2657 0.0)
(s2658 0.0)
(s2659 0.0)
(s2660 0.0)
(s2661 0.0)
(s2662 0.0)
(s2663 0.0)
(s2664 0.0)
(s2665 0.0)
(s2666 0.0)
(s2667 0.0)
(s2668 0.0)
(s2669 0.0)
(s2670 0.0)
(s2671 0.0)
(s2672 0.0)
(s2673 0.0)
(s2674 0.0)
(s2675 0.0)
(s2676 0.0)
(s2677 0.0)
(s2678 0.0)
(s2679 0.0)
(s2680 0.0)
(s2681 0.0)
(s2682 0.0)
(s2683 0.0)
(s2684 0.0)
(s2685 0.0)
(s2686 0.0)
(s2687 0.0)
(s2688 0.0)
(s2689 0.0)
(s2690 0.0)
(s2691 0.0)
(s2692 0.0)
(s2693 0.0)
(s2694 0.0)
(s2695 0.0)
(s2696 0.0)
(s2697 0.0)
(s2698 0.0)
(s2699 0.0)
(s2700 0.0)
(s2701 0.0)
(s2702 0.0)
(s2703 0.0)
(s2704 0.0)
(s2705 0.0)
(s2706 0.0)
(s2707 0.0)
(s2708 0.0)
(s2709 0.0)
(s2710 0.0)
(s2711 0.0)
(s2712 0.0)
(s2713 0.0)
(s2714 0.0)
(s2715 0.0)
(s2716 0.0)
(s2717 0.0)
(s2718 0.0)
(s2719 0.0)
(s2720 0.0)
(s2721 0.0)
(s2722 0.0)
(s2723 0.0)
(s2724 0.0)
(s2725 0.0)
(s2726 0.0)
(s2727 0.0)
(s2728 0.0)
(s2729 0.0)
(s2730 0.0)
(s2731 0.0)
(s2732 0.0)
(s2733 0.0)
(s2734 0.0)
(s2735 0.0)
(s2736 0.0)
(s2737 0.0)
(s2738 0.0)
(s2739 0.0)
(s2740 0.0)
(s2741 0.0)
(s2742 0.0)
(s2743 0.0)
(s2744 0.0)
(s2745 0.0)
(s2746 0.0)
(s2747 0.0)
(s2748 0.0)
(s2749 0.0)
(s2750 0.0)
(s2751 0.0)
(s2752 0.0)
(s2753 0.0)
(s2754 0.0)
(s2755 0.0)
(s2756 0.0)
(s2757 0.0)
(s2758 0.0)
(s2759 0.0)
(s2760 0.0)
(s2761 0.0)
(s2762 0.0)
(s2763 0.0)
(s2764 0.0)
(s2765 0.0)
(s2766 0.0)
(s2767 0.0)
(s2768 0.0)
(s2769 0.0)
(s2770 0.0)
(s2771 0.0)
(s2772 0.0)
(s2773 0.0)
(s2774 0.0)
(s2775 0.0)
(s2776 0.0)
(s2777 0.0)
(s2778 0.0)
(s2779 0.0)
(s2780 0.0)
(s2781 0.0)
(s2782 0.0)
(s2783 0.0)
(s2784 0.0)
(s2785 0.0)
(s2786 0.0)
(s2787 0.0)
(s2788 0.0)
(s2789 0.0)
(s2790 0.0)
(s2791 0.0)
(s2792 0.0)
(s2793 0.0)
(s2794 0.0)
(s2795 0.0)
(s2796 0.0)
(s2797 0.0)
(s2798 0.0)
(s2799 0.0)
(s2800 0.0)
(s2801 0.0)
(s2802 0.0)
(s2803 0.0)
(s2804 0.0)
(s2805 0.0)
(s2806 0.0)
(s2807 0.0)
(s2808 0.0)
(s2809 0.0)
(s2810 0.0)
(s2811 0.0)
(s2812 0.0)
(s2813 0.0)
(s2814 0.0)
(s2815 0.0)
(s2816 0.0)
(s2817 0.0)
(s2818 0.0)
(s2819 0.0)
(s2820 0.0)
(s2821 0.0)
(s2822 0.0)
(s2823 0.0)
(s2824 0.0)
(s2825 0.0)
(s2826 0.0)
(s2827 0.0)
(s2828 0.0)
(s2829 0.0)
(s2830 0.0)
(s2831 0.0)
(s2832 0.0)
(s2833 0.0)
(s2834 0.0)
(s2835 0.0)
(s2836 0.0)
(s2837 0.0)
(s2838 0.0)
(s2839 0.0)
(s2840 0.0)
(s2841 0.0)
(s2842 0.0)
(s2843 0.0)
(s2844 0.0)
(s2845 0.0)
(s2846 0.0)
(s2847 0.0)
(s2848 0.0)
(s2849 0.0)
(s2850 0.0)
(s2851 0.0)
(s2852 0.0)
(s2853 0.0)
(s2854 0.0)
(s2855 0.0)
(s2856 0.0)
(s2857 0.0)
(s2858 0.0)
(s2859 0.0)
(s2860 0.0)
(s2861 0.0)
(s2862 0.0)
(s2863 0.0)
(s2864 0.0)
(s2865 0.0)
(s2866 0.0)
(s2867 0.0)
(s2868 0.0)
(s2869 0.0)
(s2870 0.0)
(s2871 0.0)
(s2872 0.0)
(s2873 0.0)
(s2874 0.0)
(s2875 0.0)
(s2876 0.0)
(s2877 0.0)
(s2878 0.0)
(s2879 0.0)
(s2880 0.0)
(s2881 0.0)
(s2882 0.0)
(s2883 0.0)
(s2884 0.0)
(s2885 0.0)
(s2886 0.0)
(s2887 0.0)
(s2888 0.0)
(s2889 0.0)
(s2890 0.0)
(s2891 0.0)
(s2892 0.0)
(s2893 0.0)
(s2894 0.0)
(s2895 0.0)
(s2896 0.0)
(s2897 0.0)
(s2898 0.0)
(s2899 0.0)
(s2900 0.0)
(s2901 0.0)
(s2902 0.0)
(s2903 0.0)
(s2904 0.0)
(s2905 0.0)
(s2906 0.0)
(s2907 0.0)
(s2908 0.0)
(s2909 0.0)
(s2910 0.0)
(s2911 0.0)
(s2912 0.0)
(s2913 0.0)
(s2914 0.0)
(s2915 0.0)
(s2916 0.0)
(s2917 0.0)
(s2918 0.0)
(s2919 0.0)
(s2920 0.0)
(s2921 0.0)
(s2922 0.0)
(s2923 0.0)
(s2924 0.0)
(s2925 0.0)
(s2926 0.0)
(s2927 0.0)
(s2928 0.0)
(s2929 0.0)
(s2930 0.0)
(s2931 0.0)
(s2932 0.0)
(s2933 0.0)
(s2934 0.0)
(s2935 0.0)
(s2936 0.0)
(s2937 0.0)
(s2938 0.0)
(s2939 0.0)
(s2940 0.0)
(s2941 0.0)
(s2942 0.0)
(s2943 0.0)
(s2944 0.0)
(s2945 0.0)
(s2946 0.0)
(s2947 0.0)
(s2948 0.0)
(s2949 0.0)
(s2950 0.0)
(s2951 0.0)
(s2952 0.0)
(s2953 0.0)
(s2954 0.0)
(s2955 0.0)
(s2956 0.0)
(s2957 0.0)
(s2958 0.0)
(s2959 0.0)
(s2960 0.0)
(s2961 0.0)
(s2962 0.0)
(s2963 0.0)
(s2964 0.0)
(s2965 0.0)
(s2966 0.0)
(s2967 0.0)
(s2968 0.0)
(s2969 0.0)
(s2970 0.0)
(s2971 0.0)
(s2972 0.0)
(s2973 0.0)
(s2974 0.0)
(s2975 0.0)
(s2976 0.0)
(s2977 0.0)
(s2978 0.0)
(s2979 0.0)
(s2980 0.0)
(s2981 0.0)
(s2982 0.0)
(s2983 0.0)
(s2984 0.0)
(s2985 0.0)
(s2986 0.0)
(s2987 0.0)
(s2988 0.0)
(s2989 0.0)
(s2990 0.0)
(s2991 0.0)
(s2992 0.0)
(s2993 0.0)
(s2994 0.0)
(s2995 0.0)
(s2996 0.0)
(s2997 0.0)
(s2998 0.0)
(s2999 0.0)
(s3000 0.0)
(s3001 0.0)
(s3002 0.0)
(s3003 0.0)
(s3004 0.0)
(s3005 0.0)
(s3006 0.0)
(s3007 0.0)
(s3008 0.0)
(s3009 0.0)
(s3010 0.0)
(s3011 0.0)
(s3012 0.0)
(s3013 0.0)
(s3014 0.0)
(s3015 0.0)
(s3016 0.0)
(s3017 0.0)
(s3018 0.0)
(s3019 0.0)
(s3020 0.0)
(s3021 0.0)
(s3022 0.0)
(s3023 0.0)
(s3024 0.0)
(s3025 0.0)
(s3026 0.0)
(s3027 0.0)
(s3028 0.0)
(s3029 0.0)
(s3030 0.0)
(s3031 0.0)
(s3032 0.0)
(s3033 0.0)
(s3034 0.0)
(s3035 0.0)
(s3036 0.0)
(s3037 0.0)
(s3038 0.0)
(s3039 0.0)
(s3040 0.0)
(s3041 0.0)
(s3042 0.0)
(s3043 0.0)
(s3044 0.0)
(s3045 0.0)
(s3046 0.0)
(s3047 0.0)
(s3048 0.0)
(s3049 0.0)
(s3050 0.0)
(s3051 0.0)
(s3052 0.0)
(s3053 0.0)
(s3054 0.0)
(s3055 0.0)
(s3056 0.0)
(s3057 0.0)
(s3058 0.0)
(s3059 0.0)
(s3060 0.0)
(s3061 0.0)
(s3062 0.0)
(s3063 0.0)
(s3064 0.0)
(s3065 0.0)
(s3066 0.0)
(s3067 0.0)
(s3068 0.0)
(s3069 0.0)
(s3070 0.0)
(s3071 0.0)
(s3072 0.0)
(s3073 0.0)
(s3074 0.0)
(s3075 0.0)
(s3076 0.0)
(s3077 0.0)
(s3078 0.0)
(s3079 0.0)
(s3080 0.0)
(s3081 0.0)
(s3082 0.0)
(s3083 0.0)
(s3084 0.0)
(s3085 0.0)
(s3086 0.0)
(s3087 0.0)
(s3088 0.0)
(s3089 0.0)
(s3090 0.0)
(s3091 0.0)
(s3092 0.0)
(s3093 0.0)
(s3094 0.0)
(s3095 0.0)
(s3096 0.0)
(s3097 0.0)
(s3098 0.0)
(s3099 0.0)
(s3100 0.0)
(s3101 0.0)
(s3102 0.0)
(s3103 0.0)
(s3104 0.0)
(s3105 0.0)
(s3106 0.0)
(s3107 0.0)
(s3108 0.0)
(s3109 0.0)
(s3110 0.0)
(s3111 0.0)
(s3112 0.0)
(s3113 0.0)
(s3114 0.0)
(s3115 0.0)
(s3116 0.0)
(s3117 0.0)
(s3118 0.0)
(s3119 0.0)
(s3120 0.0)
(s3121 0.0)
(s3122 0.0)
(s3123 0.0)
(s3124 0.0)
(s3125 0.0)
(s3126 0.0)
(s3127 0.0)
(s3128 0.0)
(s3129 0.0)
(s3130 0.0)
(s3131 0.0)
(s3132 0.0)
(s3133 0.0)
(s3134 0.0)
(s3135 0.0)
(s3136 0.0)
(s3137 0.0)
(s3138 0.0)
(s3139 0.0)
(s3140 0.0)
(s3141 0.0)
(s3142 0.0)
(s3143 0.0)
(s3144 0.0)
(s3145 0.0)
(s3146 0.0)
(s3147 0.0)
(s3148 0.0)
(s3149 0.0)
(s3150 0.0)
(s3151 0.0)
(s3152 0.0)
(s3153 0.0)
(s3154 0.0)
(s3155 0.0)
(s3156 0.0)
(s3157 0.0)
(s3158 0.0)
(s3159 0.0)
(s3160 0.0)
(s3161 0.0)
(s3162 0.0)
(s3163 0.0)
(s3164 0.0)
(s3165 0.0)
(s3166 0.0)
(s3167 0.0)
(s3168 0.0)
(s3169 0.0)
(s3170 0.0)
(s3171 0.0)
(s3172 0.0)
(s3173 0.0)
(s3174 0.0)
(s3175 0.0)
(s3176 0.0)
(s3177 0.0)
(s3178 0.0)
(s3179 0.0)
(s3180 0.0)
(s3181 0.0)
(s3182 0.0)
(s3183 0.0)
(s3184 0.0)
(s3185 0.0)
(s3186 0.0)
(s3187 0.0)
(s3188 0.0)
(s3189 0.0)
(s3190 0.0)
(s3191 0.0)
(s3192 0.0)
(s3193 0.0)
(s3194 0.0)
(s3195 0.0)
(s3196 0.0)
(s3197 0.0)
(s3198 0.0)
(s3199 0.0)
(s3200 0.0)
(s3201 0.0)
(s3202 0.0)
(s3203 0.0)
(s3204 0.0)
(s3205 0.0)
(s3206 0.0)
(s3207 0.0)
(s3208 0.0)
(s3209 0.0)
(s3210 0.0)
(s3211 0.0)
(s3212 0.0)
(s3213 0.0)
(s3214 0.0)
(s3215 0.0)
(s3216 0.0)
(s3217 0.0)
(s3218 0.0)
(s3219 0.0)
(s3220 0.0)
(s3221 0.0)
(s3222 0.0)
(s3223 0.0)
(s3224 0.0)
(s3225 0.0)
(s3226 0.0)
(s3227 0.0)
(s3228 0.0)
(s3229 0.0)
(s3230 0.0)
(s3231 0.0)
(s3232 0.0)
(s3233 0.0)
(s3234 0.0)
(s3235 0.0)
(s3236 0.0)
(s3237 0.0)
(s3238 0.0)
(s3239 0.0)
(s3240 0.0)
(s3241 0.0)
(s3242 0.0)
(s3243 0.0)
(s3244 0.0)
(s3245 0.0)
(s3246 0.0)
(s3247 0.0)
(s3248 0.0)
(s3249 0.0)
(s3250 0.0)
(s3251 0.0)
(s3252 0.0)
(s3253 0.0)
(s3254 0.0)
(s3255 0.0)
(s3256 0.0)
(s3257 0.0)
(s3258 0.0)
(s3259 0.0)
(s3260 0.0)
(s3261 0.0)
(s3262 0.0)
(s3263 0.0)
(s3264 0.0)
(s3265 0.0)
(s3266 0.0)
(s3267 0.0)
(s3268 0.0)
(s3269 0.0)
(s3270 0.0)
(s3271 0.0)
(s3272 0.0)
(s3273 0.0)
(s3274 0.0)
(s3275 0.0)
(s3276 0.0)
(s3277 0.0)
(s3278 0.0)
(s3279 0.0)
(s3280 0.0)
(s3281 0.0)
(s3282 0.0)
(s3283 0.0)
(s3284 timeout
0.0)
(s3285 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39043ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39125ms
Finished structural reductions in LTL mode , in 1 iterations and 86459 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 1348 ms.
Product exploration explored 100000 steps with 50000 reset in 1276 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 16 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-05 finished in 89303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((p1 U p2)||p0)&&((p1 U p2)||X((!p3 U (p4||G(!p3)))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 188 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-22 16:53:54] [INFO ] Invariant cache hit.
[2024-05-22 16:53:56] [INFO ] Implicit Places using invariants in 1991 ms returned []
[2024-05-22 16:53:56] [INFO ] Invariant cache hit.
[2024-05-22 16:53:59] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:54:30] [INFO ] Performed 371/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:54:42] [INFO ] Implicit Places using invariants and state equation in 45524 ms returned []
Implicit Place search using SMT with State Equation took 47515 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:54:42] [INFO ] Invariant cache hit.
[2024-05-22 16:54:42] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38797ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38873ms
Finished structural reductions in LTL mode , in 1 iterations and 86589 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-06
Product exploration explored 100000 steps with 33305 reset in 1140 ms.
Product exploration explored 100000 steps with 33461 reset in 1153 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 142 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 4 states, 27 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 40000 steps (38 resets) in 789 ms. (50 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 434 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
[2024-05-22 16:55:24] [INFO ] Invariant cache hit.
[2024-05-22 16:55:24] [INFO ] State equation strengthened by 3160 read => feed constraints.
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3598/3603 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-22 16:55:25] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3603 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3603 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/3679 variables, 38/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/43 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-22 16:55:29] [INFO ] Deduced a trap composed of 70 places in 3373 ms of which 22 ms to minimize.
[2024-05-22 16:55:33] [INFO ] Deduced a trap composed of 66 places in 3200 ms of which 21 ms to minimize.
SMT process timed out in 8269ms, After SMT, problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5159 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 3 with 1638 rules applied. Total rules applied 6799 place count 1843 transition count 6519
Applied a total of 6799 rules in 1157 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1157 ms. Remains : 1843/3683 places, 6519/9840 transitions.
RANDOM walk for 40000 steps (215 resets) in 1887 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 93972 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 4
Probabilistic random walk after 93972 steps, saw 26253 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-22 16:55:38] [INFO ] Computed 42 invariants in 157 ms
[2024-05-22 16:55:38] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:55:38] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 16:55:38] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:55:40] [INFO ] Deduced a trap composed of 67 places in 1454 ms of which 11 ms to minimize.
[2024-05-22 16:55:40] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-22 16:55:40] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-22 16:55:40] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6519/8360 variables, 1841/1889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8360 variables, 6394/8283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8362 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8362 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/8362 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8285 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7499 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:55:47] [INFO ] Deduced a trap composed of 71 places in 1266 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6519/8360 variables, 1841/1890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 6394/8284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8360 variables, 4/8288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8360 variables, 0/8288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/8362 variables, 2/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/8362 variables, 0/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/8362 variables, 0/8290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8362/8362 variables, and 8290 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9600 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 17329ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 233 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 176 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 1843/1843 places, 6519/6519 transitions.
RANDOM walk for 40000 steps (214 resets) in 1380 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/3 properties
[2024-05-22 16:55:56] [INFO ] Invariant cache hit.
[2024-05-22 16:55:56] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:55:56] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:55:58] [INFO ] Deduced a trap composed of 67 places in 1426 ms of which 10 ms to minimize.
[2024-05-22 16:55:59] [INFO ] Deduced a trap composed of 48 places in 1431 ms of which 11 ms to minimize.
[2024-05-22 16:55:59] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6519/8360 variables, 1841/1887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8360 variables, 6394/8281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8360 variables, 0/8281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8362 variables, 2/8283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8362 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/8362 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8283 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6856 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:56:04] [INFO ] Deduced a trap composed of 47 places in 1269 ms of which 10 ms to minimize.
[2024-05-22 16:56:06] [INFO ] Deduced a trap composed of 58 places in 1303 ms of which 10 ms to minimize.
[2024-05-22 16:56:07] [INFO ] Deduced a trap composed of 49 places in 1272 ms of which 10 ms to minimize.
[2024-05-22 16:56:08] [INFO ] Deduced a trap composed of 47 places in 1192 ms of which 10 ms to minimize.
[2024-05-22 16:56:09] [INFO ] Deduced a trap composed of 51 places in 1142 ms of which 9 ms to minimize.
[2024-05-22 16:56:11] [INFO ] Deduced a trap composed of 49 places in 1123 ms of which 9 ms to minimize.
[2024-05-22 16:56:12] [INFO ] Deduced a trap composed of 51 places in 1192 ms of which 10 ms to minimize.
[2024-05-22 16:56:13] [INFO ] Deduced a trap composed of 47 places in 1167 ms of which 10 ms to minimize.
[2024-05-22 16:56:14] [INFO ] Deduced a trap composed of 53 places in 1170 ms of which 10 ms to minimize.
[2024-05-22 16:56:15] [INFO ] Deduced a trap composed of 72 places in 1152 ms of which 10 ms to minimize.
[2024-05-22 16:56:16] [INFO ] Deduced a trap composed of 61 places in 1052 ms of which 9 ms to minimize.
[2024-05-22 16:56:18] [INFO ] Deduced a trap composed of 67 places in 1040 ms of which 9 ms to minimize.
[2024-05-22 16:56:19] [INFO ] Deduced a trap composed of 56 places in 1058 ms of which 9 ms to minimize.
[2024-05-22 16:56:20] [INFO ] Deduced a trap composed of 59 places in 1022 ms of which 10 ms to minimize.
[2024-05-22 16:56:21] [INFO ] Deduced a trap composed of 58 places in 1009 ms of which 8 ms to minimize.
[2024-05-22 16:56:22] [INFO ] Deduced a trap composed of 63 places in 1015 ms of which 9 ms to minimize.
[2024-05-22 16:56:23] [INFO ] Deduced a trap composed of 48 places in 951 ms of which 8 ms to minimize.
[2024-05-22 16:56:24] [INFO ] Deduced a trap composed of 46 places in 959 ms of which 9 ms to minimize.
[2024-05-22 16:56:25] [INFO ] Deduced a trap composed of 48 places in 1046 ms of which 8 ms to minimize.
[2024-05-22 16:56:26] [INFO ] Deduced a trap composed of 49 places in 1034 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:56:27] [INFO ] Deduced a trap composed of 52 places in 963 ms of which 9 ms to minimize.
[2024-05-22 16:56:28] [INFO ] Deduced a trap composed of 54 places in 975 ms of which 8 ms to minimize.
[2024-05-22 16:56:29] [INFO ] Deduced a trap composed of 50 places in 919 ms of which 8 ms to minimize.
[2024-05-22 16:56:30] [INFO ] Deduced a trap composed of 49 places in 926 ms of which 8 ms to minimize.
[2024-05-22 16:56:31] [INFO ] Deduced a trap composed of 50 places in 919 ms of which 9 ms to minimize.
[2024-05-22 16:56:32] [INFO ] Deduced a trap composed of 49 places in 918 ms of which 8 ms to minimize.
[2024-05-22 16:56:33] [INFO ] Deduced a trap composed of 69 places in 902 ms of which 8 ms to minimize.
[2024-05-22 16:56:33] [INFO ] Deduced a trap composed of 52 places in 892 ms of which 9 ms to minimize.
[2024-05-22 16:56:34] [INFO ] Deduced a trap composed of 49 places in 869 ms of which 8 ms to minimize.
[2024-05-22 16:56:35] [INFO ] Deduced a trap composed of 63 places in 864 ms of which 7 ms to minimize.
[2024-05-22 16:56:36] [INFO ] Deduced a trap composed of 81 places in 820 ms of which 8 ms to minimize.
[2024-05-22 16:56:37] [INFO ] Deduced a trap composed of 55 places in 762 ms of which 8 ms to minimize.
[2024-05-22 16:56:38] [INFO ] Deduced a trap composed of 67 places in 785 ms of which 7 ms to minimize.
[2024-05-22 16:56:38] [INFO ] Deduced a trap composed of 55 places in 746 ms of which 7 ms to minimize.
[2024-05-22 16:56:39] [INFO ] Deduced a trap composed of 67 places in 770 ms of which 7 ms to minimize.
[2024-05-22 16:56:40] [INFO ] Deduced a trap composed of 51 places in 723 ms of which 7 ms to minimize.
[2024-05-22 16:56:41] [INFO ] Deduced a trap composed of 48 places in 724 ms of which 7 ms to minimize.
[2024-05-22 16:56:41] [INFO ] Deduced a trap composed of 49 places in 675 ms of which 6 ms to minimize.
[2024-05-22 16:56:42] [INFO ] Deduced a trap composed of 47 places in 677 ms of which 6 ms to minimize.
[2024-05-22 16:56:43] [INFO ] Deduced a trap composed of 47 places in 664 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:56:44] [INFO ] Deduced a trap composed of 47 places in 677 ms of which 7 ms to minimize.
[2024-05-22 16:56:44] [INFO ] Deduced a trap composed of 47 places in 675 ms of which 7 ms to minimize.
[2024-05-22 16:56:45] [INFO ] Deduced a trap composed of 68 places in 687 ms of which 7 ms to minimize.
[2024-05-22 16:56:46] [INFO ] Deduced a trap composed of 58 places in 622 ms of which 6 ms to minimize.
[2024-05-22 16:56:46] [INFO ] Deduced a trap composed of 52 places in 611 ms of which 6 ms to minimize.
[2024-05-22 16:56:47] [INFO ] Deduced a trap composed of 52 places in 649 ms of which 7 ms to minimize.
[2024-05-22 16:56:48] [INFO ] Deduced a trap composed of 56 places in 598 ms of which 6 ms to minimize.
[2024-05-22 16:56:48] [INFO ] Deduced a trap composed of 65 places in 596 ms of which 6 ms to minimize.
[2024-05-22 16:56:49] [INFO ] Deduced a trap composed of 64 places in 612 ms of which 6 ms to minimize.
[2024-05-22 16:56:49] [INFO ] Deduced a trap composed of 59 places in 601 ms of which 6 ms to minimize.
[2024-05-22 16:56:50] [INFO ] Deduced a trap composed of 61 places in 572 ms of which 6 ms to minimize.
[2024-05-22 16:56:51] [INFO ] Deduced a trap composed of 68 places in 577 ms of which 6 ms to minimize.
[2024-05-22 16:56:51] [INFO ] Deduced a trap composed of 62 places in 580 ms of which 6 ms to minimize.
[2024-05-22 16:56:52] [INFO ] Deduced a trap composed of 67 places in 577 ms of which 6 ms to minimize.
[2024-05-22 16:56:52] [INFO ] Deduced a trap composed of 68 places in 566 ms of which 6 ms to minimize.
[2024-05-22 16:56:53] [INFO ] Deduced a trap composed of 47 places in 517 ms of which 6 ms to minimize.
[2024-05-22 16:56:54] [INFO ] Deduced a trap composed of 65 places in 582 ms of which 6 ms to minimize.
[2024-05-22 16:56:54] [INFO ] Deduced a trap composed of 48 places in 603 ms of which 6 ms to minimize.
[2024-05-22 16:56:55] [INFO ] Deduced a trap composed of 47 places in 596 ms of which 6 ms to minimize.
[2024-05-22 16:56:56] [INFO ] Deduced a trap composed of 47 places in 591 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1841 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:56:56] [INFO ] Deduced a trap composed of 69 places in 620 ms of which 6 ms to minimize.
[2024-05-22 16:56:57] [INFO ] Deduced a trap composed of 67 places in 601 ms of which 6 ms to minimize.
[2024-05-22 16:56:57] [INFO ] Deduced a trap composed of 57 places in 585 ms of which 6 ms to minimize.
[2024-05-22 16:56:58] [INFO ] Deduced a trap composed of 72 places in 577 ms of which 5 ms to minimize.
[2024-05-22 16:56:59] [INFO ] Deduced a trap composed of 68 places in 606 ms of which 6 ms to minimize.
[2024-05-22 16:56:59] [INFO ] Deduced a trap composed of 51 places in 622 ms of which 7 ms to minimize.
[2024-05-22 16:57:00] [INFO ] Deduced a trap composed of 59 places in 649 ms of which 6 ms to minimize.
[2024-05-22 16:57:01] [INFO ] Deduced a trap composed of 66 places in 651 ms of which 6 ms to minimize.
[2024-05-22 16:57:01] [INFO ] Deduced a trap composed of 48 places in 689 ms of which 6 ms to minimize.
[2024-05-22 16:57:02] [INFO ] Deduced a trap composed of 52 places in 699 ms of which 7 ms to minimize.
[2024-05-22 16:57:03] [INFO ] Deduced a trap composed of 54 places in 715 ms of which 7 ms to minimize.
[2024-05-22 16:57:04] [INFO ] Deduced a trap composed of 60 places in 683 ms of which 7 ms to minimize.
[2024-05-22 16:57:04] [INFO ] Deduced a trap composed of 64 places in 682 ms of which 7 ms to minimize.
[2024-05-22 16:57:05] [INFO ] Deduced a trap composed of 52 places in 640 ms of which 6 ms to minimize.
[2024-05-22 16:57:06] [INFO ] Deduced a trap composed of 65 places in 652 ms of which 6 ms to minimize.
[2024-05-22 16:57:06] [INFO ] Deduced a trap composed of 51 places in 605 ms of which 6 ms to minimize.
[2024-05-22 16:57:07] [INFO ] Deduced a trap composed of 51 places in 605 ms of which 6 ms to minimize.
[2024-05-22 16:57:07] [INFO ] Deduced a trap composed of 49 places in 594 ms of which 7 ms to minimize.
[2024-05-22 16:57:08] [INFO ] Deduced a trap composed of 48 places in 550 ms of which 5 ms to minimize.
[2024-05-22 16:57:09] [INFO ] Deduced a trap composed of 66 places in 609 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1841 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:57:09] [INFO ] Deduced a trap composed of 64 places in 574 ms of which 6 ms to minimize.
[2024-05-22 16:57:10] [INFO ] Deduced a trap composed of 60 places in 578 ms of which 6 ms to minimize.
[2024-05-22 16:57:11] [INFO ] Deduced a trap composed of 49 places in 603 ms of which 6 ms to minimize.
[2024-05-22 16:57:11] [INFO ] Deduced a trap composed of 72 places in 575 ms of which 6 ms to minimize.
[2024-05-22 16:57:12] [INFO ] Deduced a trap composed of 62 places in 573 ms of which 6 ms to minimize.
[2024-05-22 16:57:12] [INFO ] Deduced a trap composed of 64 places in 570 ms of which 5 ms to minimize.
[2024-05-22 16:57:13] [INFO ] Deduced a trap composed of 56 places in 552 ms of which 6 ms to minimize.
[2024-05-22 16:57:14] [INFO ] Deduced a trap composed of 56 places in 556 ms of which 6 ms to minimize.
[2024-05-22 16:57:14] [INFO ] Deduced a trap composed of 53 places in 564 ms of which 6 ms to minimize.
[2024-05-22 16:57:15] [INFO ] Deduced a trap composed of 49 places in 543 ms of which 5 ms to minimize.
[2024-05-22 16:57:15] [INFO ] Deduced a trap composed of 68 places in 540 ms of which 5 ms to minimize.
[2024-05-22 16:57:16] [INFO ] Deduced a trap composed of 68 places in 532 ms of which 5 ms to minimize.
[2024-05-22 16:57:16] [INFO ] Deduced a trap composed of 55 places in 540 ms of which 5 ms to minimize.
[2024-05-22 16:57:17] [INFO ] Deduced a trap composed of 58 places in 502 ms of which 5 ms to minimize.
[2024-05-22 16:57:17] [INFO ] Deduced a trap composed of 67 places in 461 ms of which 5 ms to minimize.
[2024-05-22 16:57:18] [INFO ] Deduced a trap composed of 52 places in 425 ms of which 5 ms to minimize.
SMT process timed out in 82014ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 164 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) p1 p2 (NOT p3) p4)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2 (NOT p3) p4)), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p1) p2 (NOT p3) p4)), (G (OR (NOT p0) (NOT p1) p2 (NOT p3) p4))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p3 p4))), (F (NOT p4)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 p3 p4))), (F (NOT (AND (OR (NOT p1) p3 p4) (OR (NOT p2) p3 p4)))), (F p2), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 44 factoid took 404 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 853 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-22 16:57:20] [INFO ] Computed 42 invariants in 134 ms
[2024-05-22 16:57:21] [INFO ] Implicit Places using invariants in 1266 ms returned []
[2024-05-22 16:57:21] [INFO ] Invariant cache hit.
[2024-05-22 16:57:22] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 16:57:37] [INFO ] Implicit Places using invariants and state equation in 15905 ms returned []
Implicit Place search using SMT with State Equation took 17172 ms to find 0 implicit places.
[2024-05-22 16:57:37] [INFO ] Redundant transitions in 696 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-22 16:57:37] [INFO ] Invariant cache hit.
[2024-05-22 16:57:38] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34883ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34930ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53669 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT p2)), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT p3)), (X p4), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (OR p1 p2 (NOT p3) p4)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT p3))), (X (X p4)), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 141 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 14 to 12
RANDOM walk for 40000 steps (193 resets) in 1957 ms. (20 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
[2024-05-22 16:58:13] [INFO ] Invariant cache hit.
[2024-05-22 16:58:13] [INFO ] State equation strengthened by 4757 read => feed constraints.
Problem apf5 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 16:58:14] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 16:58:16] [INFO ] Deduced a trap composed of 68 places in 1377 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6521/8364 variables, 1843/1887 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8364 variables, 4757/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 0/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/8366 variables, 2/6646 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6646 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 16:58:20] [INFO ] Deduced a trap composed of 49 places in 1357 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6521/8364 variables, 1843/1888 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 4757/6645 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8364 variables, 4/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8364 variables, 0/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/8366 variables, 2/6651 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8366/8366 variables, and 6651 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 10095ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 452 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (217 resets) in 1403 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 96953 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 4
Probabilistic random walk after 96953 steps, saw 26643 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-22 16:58:28] [INFO ] Computed 42 invariants in 154 ms
[2024-05-22 16:58:28] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:58:28] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2024-05-22 16:58:28] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:58:30] [INFO ] Deduced a trap composed of 62 places in 1340 ms of which 11 ms to minimize.
[2024-05-22 16:58:31] [INFO ] Deduced a trap composed of 46 places in 1331 ms of which 10 ms to minimize.
[2024-05-22 16:58:33] [INFO ] Deduced a trap composed of 60 places in 1297 ms of which 10 ms to minimize.
[2024-05-22 16:58:34] [INFO ] Deduced a trap composed of 51 places in 1306 ms of which 10 ms to minimize.
[2024-05-22 16:58:35] [INFO ] Deduced a trap composed of 51 places in 1262 ms of which 10 ms to minimize.
[2024-05-22 16:58:37] [INFO ] Deduced a trap composed of 55 places in 1224 ms of which 11 ms to minimize.
[2024-05-22 16:58:38] [INFO ] Deduced a trap composed of 53 places in 1254 ms of which 11 ms to minimize.
[2024-05-22 16:58:39] [INFO ] Deduced a trap composed of 51 places in 1231 ms of which 10 ms to minimize.
[2024-05-22 16:58:40] [INFO ] Deduced a trap composed of 54 places in 1187 ms of which 10 ms to minimize.
[2024-05-22 16:58:42] [INFO ] Deduced a trap composed of 65 places in 1223 ms of which 9 ms to minimize.
[2024-05-22 16:58:43] [INFO ] Deduced a trap composed of 52 places in 1111 ms of which 10 ms to minimize.
[2024-05-22 16:58:44] [INFO ] Deduced a trap composed of 53 places in 1104 ms of which 9 ms to minimize.
[2024-05-22 16:58:45] [INFO ] Deduced a trap composed of 51 places in 1098 ms of which 9 ms to minimize.
[2024-05-22 16:58:46] [INFO ] Deduced a trap composed of 53 places in 1110 ms of which 9 ms to minimize.
[2024-05-22 16:58:47] [INFO ] Deduced a trap composed of 48 places in 1073 ms of which 9 ms to minimize.
[2024-05-22 16:58:48] [INFO ] Deduced a trap composed of 51 places in 1102 ms of which 9 ms to minimize.
[2024-05-22 16:58:49] [INFO ] Deduced a trap composed of 47 places in 1076 ms of which 9 ms to minimize.
[2024-05-22 16:58:51] [INFO ] Deduced a trap composed of 46 places in 1054 ms of which 9 ms to minimize.
[2024-05-22 16:58:52] [INFO ] Deduced a trap composed of 56 places in 1022 ms of which 9 ms to minimize.
[2024-05-22 16:58:53] [INFO ] Deduced a trap composed of 61 places in 989 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:58:54] [INFO ] Deduced a trap composed of 55 places in 978 ms of which 9 ms to minimize.
[2024-05-22 16:58:55] [INFO ] Deduced a trap composed of 64 places in 967 ms of which 9 ms to minimize.
[2024-05-22 16:58:56] [INFO ] Deduced a trap composed of 57 places in 959 ms of which 9 ms to minimize.
[2024-05-22 16:58:57] [INFO ] Deduced a trap composed of 54 places in 954 ms of which 8 ms to minimize.
[2024-05-22 16:58:58] [INFO ] Deduced a trap composed of 55 places in 947 ms of which 9 ms to minimize.
[2024-05-22 16:58:59] [INFO ] Deduced a trap composed of 56 places in 948 ms of which 9 ms to minimize.
[2024-05-22 16:59:00] [INFO ] Deduced a trap composed of 55 places in 934 ms of which 8 ms to minimize.
[2024-05-22 16:59:01] [INFO ] Deduced a trap composed of 56 places in 934 ms of which 8 ms to minimize.
[2024-05-22 16:59:01] [INFO ] Deduced a trap composed of 53 places in 931 ms of which 8 ms to minimize.
[2024-05-22 16:59:02] [INFO ] Deduced a trap composed of 56 places in 954 ms of which 9 ms to minimize.
[2024-05-22 16:59:03] [INFO ] Deduced a trap composed of 61 places in 942 ms of which 8 ms to minimize.
[2024-05-22 16:59:04] [INFO ] Deduced a trap composed of 47 places in 898 ms of which 8 ms to minimize.
[2024-05-22 16:59:05] [INFO ] Deduced a trap composed of 57 places in 922 ms of which 9 ms to minimize.
[2024-05-22 16:59:06] [INFO ] Deduced a trap composed of 63 places in 928 ms of which 8 ms to minimize.
[2024-05-22 16:59:07] [INFO ] Deduced a trap composed of 77 places in 894 ms of which 8 ms to minimize.
[2024-05-22 16:59:08] [INFO ] Deduced a trap composed of 54 places in 897 ms of which 8 ms to minimize.
[2024-05-22 16:59:09] [INFO ] Deduced a trap composed of 69 places in 899 ms of which 8 ms to minimize.
[2024-05-22 16:59:10] [INFO ] Deduced a trap composed of 52 places in 835 ms of which 8 ms to minimize.
[2024-05-22 16:59:11] [INFO ] Deduced a trap composed of 76 places in 814 ms of which 8 ms to minimize.
[2024-05-22 16:59:12] [INFO ] Deduced a trap composed of 49 places in 791 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:59:12] [INFO ] Deduced a trap composed of 65 places in 795 ms of which 8 ms to minimize.
[2024-05-22 16:59:13] [INFO ] Deduced a trap composed of 73 places in 799 ms of which 7 ms to minimize.
SMT process timed out in 45687ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 168 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 166 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-22 16:59:14] [INFO ] Invariant cache hit.
[2024-05-22 16:59:15] [INFO ] Implicit Places using invariants in 1879 ms returned []
[2024-05-22 16:59:15] [INFO ] Invariant cache hit.
[2024-05-22 16:59:17] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-22 16:59:47] [INFO ] Performed 665/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:00:17] [INFO ] Performed 1616/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 17:00:24] [INFO ] Implicit Places using invariants and state equation in 68510 ms returned []
Implicit Place search using SMT with State Equation took 70392 ms to find 0 implicit places.
[2024-05-22 17:00:24] [INFO ] Redundant transitions in 486 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-22 17:00:25] [INFO ] Invariant cache hit.
[2024-05-22 17:00:25] [INFO ] State equation strengthened by 6394 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36116ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107230 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT p2)), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT p3)), (X p4), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (OR p1 p2 (NOT p3) p4)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT p3))), (X (X p4)), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (NOT p1))), (G (OR (NOT p1) p2 (NOT p3) p4)), (G (OR p1 p2 (NOT p3) p4)), (G (OR p1 p2 (NOT p3) p4))]
False Knowledge obtained : [(F (NOT p4)), (F p1), (F p2), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (F (NOT (OR p1 p2 p3 p4))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 32 factoid took 409 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Product exploration explored 100000 steps with 33338 reset in 1232 ms.
Product exploration explored 100000 steps with 33208 reset in 1224 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 143 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-22 17:01:04] [INFO ] Computed 42 invariants in 138 ms
[2024-05-22 17:01:05] [INFO ] Implicit Places using invariants in 1330 ms returned []
[2024-05-22 17:01:05] [INFO ] Invariant cache hit.
[2024-05-22 17:01:07] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:01:21] [INFO ] Implicit Places using invariants and state equation in 15740 ms returned []
Implicit Place search using SMT with State Equation took 17071 ms to find 0 implicit places.
[2024-05-22 17:01:22] [INFO ] Redundant transitions in 463 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-22 17:01:22] [INFO ] Invariant cache hit.
[2024-05-22 17:01:22] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34897ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34944ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52641 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-06 finished in 482500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G(p1))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 190 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 17:01:57] [INFO ] Computed 42 invariants in 386 ms
[2024-05-22 17:01:59] [INFO ] Implicit Places using invariants in 2349 ms returned []
[2024-05-22 17:01:59] [INFO ] Invariant cache hit.
[2024-05-22 17:02:02] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 17:02:33] [INFO ] Performed 399/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:02:41] [INFO ] Implicit Places using invariants and state equation in 41983 ms returned []
Implicit Place search using SMT with State Equation took 44334 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 17:02:41] [INFO ] Invariant cache hit.
[2024-05-22 17:02:41] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38986ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39062ms
Finished structural reductions in LTL mode , in 1 iterations and 83597 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-08
Stuttering criterion allowed to conclude after 1080 steps with 0 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-08 finished in 83770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p0))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 191 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-22 17:03:21] [INFO ] Invariant cache hit.
[2024-05-22 17:03:24] [INFO ] Implicit Places using invariants in 3003 ms returned []
[2024-05-22 17:03:24] [INFO ] Invariant cache hit.
[2024-05-22 17:03:27] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 17:03:57] [INFO ] Performed 301/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:04:13] [INFO ] Implicit Places using invariants and state equation in 49060 ms returned []
Implicit Place search using SMT with State Equation took 52066 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 17:04:13] [INFO ] Invariant cache hit.
[2024-05-22 17:04:13] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38801ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38877ms
Finished structural reductions in LTL mode , in 1 iterations and 91147 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-09
Entered a terminal (fully accepting) state of product in 4703 steps with 4 reset in 50 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-09 finished in 91337 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((p0 U p1))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 192 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-22 17:04:52] [INFO ] Invariant cache hit.
[2024-05-22 17:04:54] [INFO ] Implicit Places using invariants in 2004 ms returned []
[2024-05-22 17:04:54] [INFO ] Invariant cache hit.
[2024-05-22 17:04:57] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 17:05:28] [INFO ] Performed 287/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:05:44] [INFO ] Implicit Places using invariants and state equation in 50091 ms returned []
Implicit Place search using SMT with State Equation took 52095 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 17:05:44] [INFO ] Invariant cache hit.
[2024-05-22 17:05:44] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 0.0)
(s1754 0.0)
(s1755 0.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 0.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 0.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 0.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 0.0)
(s1799 0.0)
(s1800 0.0)
(s1801 0.0)
(s1802 0.0)
(s1803 0.0)
(s1804 0.0)
(s1805 0.0)
(s1806 0.0)
(s1807 0.0)
(s1808 0.0)
(s1809 0.0)
(s1810 0.0)
(s1811 0.0)
(s1812 0.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 0.0)
(s1817 0.0)
(s1818 0.0)
(s1819 0.0)
(s1820 0.0)
(s1821 0.0)
(s1822 0.0)
(s1823 0.0)
(s1824 0.0)
(s1825 0.0)
(s1826 0.0)
(s1827 0.0)
(s1828 0.0)
(s1829 0.0)
(s1830 0.0)
(s1831 0.0)
(s1832 0.0)
(s1833 0.0)
(s1834 0.0)
(s1835 0.0)
(s1836 0.0)
(s1837 0.0)
(s1838 0.0)
(s1839 0.0)
(s1840 0.0)
(s1841 0.0)
(s1842 0.0)
(s1843 0.0)
(s1844 0.0)
(s1845 0.0)
(s1846 0.0)
(s1847 0.0)
(s1848 0.0)
(s1849 0.0)
(s1850 0.0)
(s1851 0.0)
(s1852 0.0)
(s1853 0.0)
(s1854 0.0)
(s1855 0.0)
(s1856 0.0)
(s1857 0.0)
(s1858 0.0)
(s1859 0.0)
(s1860 0.0)
(s1861 0.0)
(s1862 0.0)
(s1863 0.0)
(s1864 0.0)
(s1865 0.0)
(s1866 0.0)
(s1867 0.0)
(s1868 0.0)
(s1869 0.0)
(s1870 0.0)
(s1871 0.0)
(s1872 0.0)
(s1873 0.0)
(s1874 0.0)
(s1875 0.0)
(s1876 0.0)
(s1877 0.0)
(s1878 0.0)
(s1879 0.0)
(s1880 0.0)
(s1881 0.0)
(s1882 0.0)
(s1883 0.0)
(s1884 0.0)
(s1885 0.0)
(s1886 0.0)
(s1887 0.0)
(s1888 0.0)
(s1889 0.0)
(s1890 0.0)
(s1891 0.0)
(s1892 0.0)
(s1893 0.0)
(s1894 0.0)
(s1895 0.0)
(s1896 0.0)
(s1897 0.0)
(s1898 0.0)
(s1899 0.0)
(s1900 0.0)
(s1901 0.0)
(s1902 0.0)
(s1903 0.0)
(s1904 0.0)
(s1905 0.0)
(s1906 0.0)
(s1907 0.0)
(s1908 0.0)
(s1909 0.0)
(s1910 0.0)
(s1911 0.0)
(s1912 0.0)
(s1913 0.0)
(s1914 0.0)
(s1915 0.0)
(s1916 0.0)
(s1917 0.0)
(s1918 0.0)
(s1919 0.0)
(s1920 0.0)
(s1921 0.0)
(s1922 0.0)
(s1923 0.0)
(s1924 0.0)
(s1925 0.0)
(s1926 0.0)
(s1927 0.0)
(s1928 0.0)
(s1929 0.0)
(s1930 0.0)
(s1931 0.0)
(s1932 0.0)
(s1933 0.0)
(s1934 0.0)
(s1935 0.0)
(s1936 0.0)
(s1937 0.0)
(s1938 0.0)
(s1939 0.0)
(s1940 0.0)
(s1941 0.0)
(s1942 0.0)
(s1943 0.0)
(s1944 0.0)
(s1945 0.0)
(s1946 0.0)
(s1947 0.0)
(s1948 0.0)
(s1949 0.0)
(s1950 0.0)
(s1951 0.0)
(s1952 0.0)
(s1953 0.0)
(s1954 0.0)
(s1955 0.0)
(s1956 0.0)
(s1957 0.0)
(s1958 0.0)
(s1959 0.0)
(s1960 0.0)
(s1961 0.0)
(s1962 0.0)
(s1963 0.0)
(s1964 0.0)
(s1965 0.0)
(s1966 0.0)
(s1967 0.0)
(s1968 0.0)
(s1969 0.0)
(s1970 0.0)
(s1971 0.0)
(s1972 0.0)
(s1973 0.0)
(s1974 0.0)
(s1975 0.0)
(s1976 0.0)
(s1977 0.0)
(s1978 0.0)
(s1979 0.0)
(s1980 0.0)
(s1981 0.0)
(s1982 0.0)
(s1983 0.0)
(s1984 0.0)
(s1985 0.0)
(s1986 0.0)
(s1987 0.0)
(s1988 0.0)
(s1989 0.0)
(s1990 0.0)
(s1991 0.0)
(s1992 0.0)
(s1993 0.0)
(s1994 0.0)
(s1995 0.0)
(s1996 0.0)
(s1997 0.0)
(s1998 0.0)
(s1999 0.0)
(s2000 0.0)
(s2001 0.0)
(s2002 0.0)
(s2003 0.0)
(s2004 0.0)
(s2005 0.0)
(s2006 0.0)
(s2007 0.0)
(s2008 0.0)
(s2009 0.0)
(s2010 0.0)
(s2011 0.0)
(s2012 0.0)
(s2013 0.0)
(s2014 0.0)
(s2015 0.0)
(s2016 0.0)
(s2017 0.0)
(s2018 0.0)
(s2019 0.0)
(s2020 0.0)
(s2021 0.0)
(s2022 0.0)
(s2023 0.0)
(s2024 0.0)
(s2025 0.0)
(s2026 0.0)
(s2027 0.0)
(s2028 0.0)
(s2029 0.0)
(s2030 0.0)
(s2031 0.0)
(s2032 0.0)
(s2033 0.0)
(s2034 0.0)
(s2035 0.0)
(s2036 0.0)
(s2037 0.0)
(s2038 0.0)
(s2039 0.0)
(s2040 0.0)
(s2041 0.0)
(s2042 0.0)
(s2043 0.0)
(s2044 0.0)
(s2045 0.0)
(s2046 0.0)
(s2047 0.0)
(s2048 0.0)
(s2049 0.0)
(s2050 0.0)
(s2051 0.0)
(s2052 0.0)
(s2053 0.0)
(s2054 0.0)
(s2055 0.0)
(s2056 0.0)
(s2057 0.0)
(s2058 0.0)
(s2059 0.0)
(s2060 0.0)
(s2061 0.0)
(s2062 0.0)
(s2063 0.0)
(s2064 0.0)
(s2065 0.0)
(s2066 0.0)
(s2067 0.0)
(s2068 0.0)
(s2069 0.0)
(s2070 0.0)
(s2071 0.0)
(s2072 0.0)
(s2073 0.0)
(s2074 0.0)
(s2075 0.0)
(s2076 0.0)
(s2077 0.0)
(s2078 0.0)
(s2079 0.0)
(s2080 0.0)
(s2081 0.0)
(s2082 0.0)
(s2083 0.0)
(s2084 0.0)
(s2085 0.0)
(s2086 0.0)
(s2087 0.0)
(s2088 0.0)
(s2089 0.0)
(s2090 0.0)
(s2091 0.0)
(s2092 0.0)
(s2093 0.0)
(s2094 0.0)
(s2095 0.0)
(s2096 0.0)
(s2097 0.0)
(s2098 0.0)
(s2099 0.0)
(s2100 0.0)
(s2101 0.0)
(s2102 0.0)
(s2103 0.0)
(s2104 0.0)
(s2105 0.0)
(s2106 0.0)
(s2107 0.0)
(s2108 0.0)
(s2109 0.0)
(s2110 0.0)
(s2111 0.0)
(s2112 0.0)
(s2113 0.0)
(s2114 0.0)
(s2115 0.0)
(s2116 0.0)
(s2117 0.0)
(s2118 0.0)
(s2119 0.0)
(s2120 0.0)
(s2121 0.0)
(s2122 0.0)
(s2123 0.0)
(s2124 0.0)
(s2125 0.0)
(s2126 0.0)
(s2127 0.0)
(s2128 0.0)
(s2129 0.0)
(s2130 0.0)
(s2131 0.0)
(s2132 0.0)
(s2133 0.0)
(s2134 0.0)
(s2135 0.0)
(s2136 0.0)
(s2137 0.0)
(s2138 0.0)
(s2139 0.0)
(s2140 0.0)
(s2141 0.0)
(s2142 0.0)
(s2143 0.0)
(s2144 0.0)
(s2145 0.0)
(s2146 0.0)
(s2147 0.0)
(s2148 0.0)
(s2149 0.0)
(s2150 0.0)
(s2151 0.0)
(s2152 0.0)
(s2153 0.0)
(s2154 0.0)
(s2155 0.0)
(s2156 0.0)
(s2157 0.0)
(s2158 0.0)
(s2159 0.0)
(s2160 0.0)
(s2161 0.0)
(s2162 0.0)
(s2163 0.0)
(s2164 0.0)
(s2165 0.0)
(s2166 0.0)
(s2167 0.0)
(s2168 0.0)
(s2169 0.0)
(s2170 0.0)
(s2171 0.0)
(s2172 0.0)
(s2173 0.0)
(s2174 0.0)
(s2175 0.0)
(s2176 0.0)
(s2177 0.0)
(s2178 0.0)
(s2179 0.0)
(s2180 0.0)
(s2181 0.0)
(s2182 0.0)
(s2183 0.0)
(s2184 0.0)
(s2185 0.0)
(s2186 0.0)
(s2187 0.0)
(s2188 0.0)
(s2189 0.0)
(s2190 0.0)
(s2191 0.0)
(s2192 0.0)
(s2193 0.0)
(s2194 0.0)
(s2195 0.0)
(s2196 0.0)
(s2197 0.0)
(s2198 0.0)
(s2199 0.0)
(s2200 0.0)
(s2201 0.0)
(s2202 0.0)
(s2203 0.0)
(s2204 0.0)
(s2205 0.0)
(s2206 0.0)
(s2207 0.0)
(s2208 0.0)
(s2209 0.0)
(s2210 0.0)
(s2211 0.0)
(s2212 0.0)
(s2213 0.0)
(s2214 0.0)
(s2215 0.0)
(s2216 0.0)
(s2217 0.0)
(s2218 0.0)
(s2219 0.0)
(s2220 0.0)
(s2221 0.0)
(s2222 0.0)
(s2223 0.0)
(s2224 0.0)
(s2225 0.0)
(s2226 0.0)
(s2227 0.0)
(s2228 0.0)
(s2229 0.0)
(s2230 0.0)
(s2231 0.0)
(s2232 0.0)
(s2233 0.0)
(s2234 0.0)
(s2235 0.0)
(s2236 0.0)
(s2237 0.0)
(s2238 0.0)
(s2239 0.0)
(s2240 0.0)
(s2241 0.0)
(s2242 0.0)
(s2243 0.0)
(s2244 0.0)
(s2245 0.0)
(s2246 0.0)
(s2247 0.0)
(s2248 0.0)
(s2249 0.0)
(s2250 0.0)
(s2251 0.0)
(s2252 0.0)
(s2253 0.0)
(s2254 0.0)
(s2255 0.0)
(s2256 0.0)
(s2257 0.0)
(s2258 0.0)
(s2259 0.0)
(s2260 0.0)
(s2261 0.0)
(s2262 0.0)
(s2263 0.0)
(s2264 0.0)
(s2265 0.0)
(s2266 0.0)
(s2267 0.0)
(s2268 0.0)
(s2269 0.0)
(s2270 0.0)
(s2271 0.0)
(s2272 0.0)
(s2273 0.0)
(s2274 0.0)
(s2275 0.0)
(s2276 0.0)
(s2277 0.0)
(s2278 0.0)
(s2279 0.0)
(s2280 0.0)
(s2281 0.0)
(s2282 0.0)
(s2283 0.0)
(s2284 0.0)
(s2285 0.0)
(s2286 0.0)
(s2287 0.0)
(s2288 0.0)
(s2289 0.0)
(s2290 0.0)
(s2291 0.0)
(s2292 0.0)
(s2293 0.0)
(s2294 0.0)
(s2295 0.0)
(s2296 0.0)
(s2297 0.0)
(s2298 0.0)
(s2299 0.0)
(s2300 0.0)
(s2301 0.0)
(s2302 0.0)
(s2303 0.0)
(s2304 0.0)
(s2305 0.0)
(s2306 0.0)
(s2307 0.0)
(s2308 0.0)
(s2309 0.0)
(s2310 0.0)
(s2311 0.0)
(s2312 0.0)
(s2313 0.0)
(s2314 0.0)
(s2315 0.0)
(s2316 0.0)
(s2317 0.0)
(s2318 0.0)
(s2319 0.0)
(s2320 0.0)
(s2321 0.0)
(s2322 0.0)
(s2323 0.0)
(s2324 0.0)
(s2325 0.0)
(s2326 0.0)
(s2327 0.0)
(s2328 0.0)
(s2329 0.0)
(s2330 0.0)
(s2331 0.0)
(s2332 0.0)
(s2333 0.0)
(s2334 0.0)
(s2335 0.0)
(s2336 0.0)
(s2337 0.0)
(s2338 0.0)
(s2339 0.0)
(s2340 0.0)
(s2341 0.0)
(s2342 0.0)
(s2343 0.0)
(s2344 0.0)
(s2345 0.0)
(s2346 0.0)
(s2347 0.0)
(s2348 0.0)
(s2349 0.0)
(s2350 0.0)
(s2351 0.0)
(s2352 0.0)
(s2353 0.0)
(s2354 0.0)
(s2355 0.0)
(s2356 0.0)
(s2357 0.0)
(s2358 0.0)
(s2359 0.0)
(s2360 0.0)
(s2361 0.0)
(s2362 0.0)
(s2363 0.0)
(s2364 0.0)
(s2365 0.0)
(s2366 0.0)
(s2367 0.0)
(s2368 0.0)
(s2369 0.0)
(s2370 0.0)
(s2371 0.0)
(s2372 0.0)
(s2373 0.0)
(s2374 0.0)
(s2375 0.0)
(s2376 0.0)
(s2377 0.0)
(s2378 0.0)
(s2379 0.0)
(s2380 0.0)
(s2381 0.0)
(s2382 0.0)
(s2383 0.0)
(s2384 0.0)
(s2385 0.0)
(s2386 0.0)
(s2387 0.0)
(s2388 0.0)
(s2389 0.0)
(s2390 0.0)
(s2391 0.0)
(s2392 0.0)
(s2393 0.0)
(s2394 0.0)
(s2395 0.0)
(s2396 0.0)
(s2397 0.0)
(s2398 0.0)
(s2399 0.0)
(s2400 0.0)
(s2401 0.0)
(s2402 0.0)
(s2403 0.0)
(s2404 0.0)
(s2405 0.0)
(s2406 0.0)
(s2407 0.0)
(s2408 0.0)
(s2409 0.0)
(s2410 0.0)
(s2411 0.0)
(s2412 0.0)
(s2413 0.0)
(s2414 0.0)
(s2415 0.0)
(s2416 0.0)
(s2417 0.0)
(s2418 0.0)
(s2419 0.0)
(s2420 0.0)
(s2421 0.0)
(s2422 0.0)
(s2423 0.0)
(s2424 0.0)
(s2425 0.0)
(s2426 0.0)
(s2427 0.0)
(s2428 0.0)
(s2429 0.0)
(s2430 0.0)
(s2431 0.0)
(s2432 0.0)
(s2433 0.0)
(s2434 0.0)
(s2435 0.0)
(s2436 0.0)
(s2437 0.0)
(s2438 0.0)
(s2439 0.0)
(s2440 0.0)
(s2441 0.0)
(s2442 0.0)
(s2443 0.0)
(s2444 0.0)
(s2445 0.0)
(s2446 0.0)
(s2447 0.0)
(s2448 0.0)
(s2449 0.0)
(s2450 0.0)
(s2451 0.0)
(s2452 0.0)
(s2453 0.0)
(s2454 0.0)
(s2455 0.0)
(s2456 0.0)
(s2457 0.0)
(s2458 0.0)
(s2459 0.0)
(s2460 0.0)
(s2461 0.0)
(s2462 0.0)
(s2463 0.0)
(s2464 0.0)
(s2465 0.0)
(s2466 0.0)
(s2467 0.0)
(s2468 0.0)
(s2469 0.0)
(s2470 0.0)
(s2471 0.0)
(s2472 0.0)
(s2473 0.0)
(s2474 0.0)
(s2475 0.0)
(s2476 0.0)
(s2477 0.0)
(s2478 0.0)
(s2479 0.0)
(s2480 0.0)
(s2481 0.0)
(s2482 0.0)
(s2483 0.0)
(s2484 0.0)
(s2485 0.0)
(s2486 0.0)
(s2487 0.0)
(s2488 0.0)
(s2489 0.0)
(s2490 0.0)
(s2491 0.0)
(s2492 0.0)
(s2493 0.0)
(s2494 0.0)
(s2495 0.0)
(s2496 0.0)
(s2497 0.0)
(s2498 0.0)
(s2499 0.0)
(s2500 0.0)
(s2501 0.0)
(s2502 0.0)
(s2503 0.0)
(s2504 0.0)
(s2505 0.0)
(s2506 0.0)
(s2507 0.0)
(s2508 0.0)
(s2509 0.0)
(s2510 0.0)
(s2511 0.0)
(s2512 0.0)
(s2513 0.0)
(s2514 0.0)
(s2515 0.0)
(s2516 0.0)
(s2517 0.0)
(s2518 0.0)
(s2519 0.0)
(s2520 0.0)
(s2521 0.0)
(s2522 0.0)
(s2523 0.0)
(s2524 0.0)
(s2525 0.0)
(s2526 0.0)
(s2527 0.0)
(s2528 0.0)
(s2529 0.0)
(s2530 0.0)
(s2531 0.0)
(s2532 0.0)
(s2533 0.0)
(s2534 0.0)
(s2535 0.0)
(s2536 0.0)
(s2537 0.0)
(s2538 0.0)
(s2539 0.0)
(s2540 0.0)
(s2541 0.0)
(s2542 0.0)
(s2543 0.0)
(s2544 0.0)
(s2545 0.0)
(s2546 0.0)
(s2547 0.0)
(s2548 0.0)
(s2549 0.0)
(s2550 0.0)
(s2551 0.0)
(s2552 0.0)
(s2553 0.0)
(s2554 0.0)
(s2555 0.0)
(s2556 0.0)
(s2557 0.0)
(s2558 0.0)
(s2559 0.0)
(s2560 0.0)
(s2561 0.0)
(s2562 0.0)
(s2563 0.0)
(s2564 0.0)
(s2565 0.0)
(s2566 0.0)
(s2567 0.0)
(s2568 0.0)
(s2569 0.0)
(s2570 0.0)
(s2571 0.0)
(s2572 0.0)
(s2573 0.0)
(s2574 0.0)
(s2575 0.0)
(s2576 0.0)
(s2577 0.0)
(s2578 0.0)
(s2579 0.0)
(s2580 0.0)
(s2581 0.0)
(s2582 0.0)
(s2583 0.0)
(s2584 0.0)
(s2585 0.0)
(s2586 0.0)
(s2587 0.0)
(s2588 0.0)
(s2589 0.0)
(s2590 0.0)
(s2591 0.0)
(s2592 0.0)
(s2593 0.0)
(s2594 0.0)
(s2595 0.0)
(s2596 0.0)
(s2597 0.0)
(s2598 0.0)
(s2599 0.0)
(s2600 0.0)
(s2601 0.0)
(s2602 0.0)
(s2603 0.0)
(s2604 0.0)
(s2605 0.0)
(s2606 0.0)
(s2607 0.0)
(s2608 0.0)
(s2609 0.0)
(s2610 0.0)
(s2611 0.0)
(s2612 0.0)
(s2613 0.0)
(s2614 0.0)
(s2615 0.0)
(s2616 0.0)
(s2617 0.0)
(s2618 0.0)
(s2619 0.0)
(s2620 0.0)
(s2621 0.0)
(s2622 0.0)
(s2623 0.0)
(s2624 0.0)
(s2625 0.0)
(s2626 0.0)
(s2627 0.0)
(s2628 0.0)
(s2629 0.0)
(s2630 0.0)
(s2631 0.0)
(s2632 0.0)
(s2633 0.0)
(s2634 0.0)
(s2635 0.0)
(s2636 0.0)
(s2637 0.0)
(s2638 0.0)
(s2639 0.0)
(s2640 0.0)
(s2641 0.0)
(s2642 0.0)
(s2643 0.0)
(s2644 0.0)
(s2645 0.0)
(s2646 0.0)
(s2647 0.0)
(s2648 0.0)
(s2649 0.0)
(s2650 0.0)
(s2651 0.0)
(s2652 0.0)
(s2653 0.0)
(s2654 0.0)
(s2655 0.0)
(s2656 0.0)
(s2657 0.0)
(s2658 0.0)
(s2659 0.0)
(s2660 0.0)
(s2661 0.0)
(s2662 0.0)
(s2663 0.0)
(s2664 0.0)
(s2665 0.0)
(s2666 0.0)
(s2667 0.0)
(s2668 0.0)
(s2669 0.0)
(s2670 0.0)
(s2671 0.0)
(s2672 0.0)
(s2673 0.0)
(s2674 0.0)
(s2675 0.0)
(s2676 0.0)
(s2677 0.0)
(s2678 0.0)
(s2679 0.0)
(s2680 0.0)
(s2681 0.0)
(s2682 0.0)
(s2683 0.0)
(s2684 0.0)
(s2685 0.0)
(s2686 0.0)
(s2687 0.0)
(s2688 0.0)
(s2689 0.0)
(s2690 0.0)
(s2691 0.0)
(s2692 0.0)
(s2693 0.0)
(s2694 0.0)
(s2695 0.0)
(s2696 0.0)
(s2697 0.0)
(s2698 0.0)
(s2699 0.0)
(s2700 0.0)
(s2701 0.0)
(s2702 0.0)
(s2703 0.0)
(s2704 0.0)
(s2705 0.0)
(s2706 0.0)
(s2707 0.0)
(s2708 0.0)
(s2709 0.0)
(s2710 0.0)
(s2711 0.0)
(s2712 0.0)
(s2713 0.0)
(s2714 0.0)
(s2715 0.0)
(s2716 0.0)
(s2717 0.0)
(s2718 0.0)
(s2719 0.0)
(s2720 0.0)
(s2721 0.0)
(s2722 0.0)
(s2723 0.0)
(s2724 0.0)
(s2725 0.0)
(s2726 0.0)
(s2727 0.0)
(s2728 0.0)
(s2729 0.0)
(s2730 0.0)
(s2731 0.0)
(s2732 0.0)
(s2733 0.0)
(s2734 0.0)
(s2735 0.0)
(s2736 0.0)
(s2737 0.0)
(s2738 0.0)
(s2739 0.0)
(s2740 0.0)
(s2741 0.0)
(s2742 0.0)
(s2743 0.0)
(s2744 0.0)
(s2745 0.0)
(s2746 0.0)
(s2747 0.0)
(s2748 0.0)
(s2749 0.0)
(s2750 0.0)
(s2751 0.0)
(s2752 0.0)
(s2753 0.0)
(s2754 0.0)
(s2755 0.0)
(s2756 0.0)
(s2757 0.0)
(s2758 0.0)
(s2759 0.0)
(s2760 0.0)
(s2761 0.0)
(s2762 0.0)
(s2763 0.0)
(s2764 0.0)
(s2765 0.0)
(s2766 0.0)
(s2767 0.0)
(s2768 0.0)
(s2769 0.0)
(s2770 0.0)
(s2771 0.0)
(s2772 0.0)
(s2773 0.0)
(s2774 0.0)
(s2775 0.0)
(s2776 0.0)
(s2777 0.0)
(s2778 0.0)
(s2779 0.0)
(s2780 0.0)
(s2781 0.0)
(s2782 0.0)
(s2783 0.0)
(s2784 0.0)
(s2785 0.0)
(s2786 0.0)
(s2787 0.0)
(s2788 0.0)
(s2789 0.0)
(s2790 0.0)
(s2791 0.0)
(s2792 0.0)
(s2793 0.0)
(s2794 0.0)
(s2795 0.0)
(s2796 0.0)
(s2797 0.0)
(s2798 0.0)
(s2799 0.0)
(s2800 0.0)
(s2801 0.0)
(s2802 0.0)
(s2803 0.0)
(s2804 0.0)
(s2805 0.0)
(s2806 0.0)
(s2807 0.0)
(s2808 0.0)
(s2809 0.0)
(s2810 0.0)
(s2811 0.0)
(s2812 0.0)
(s2813 0.0)
(s2814 0.0)
(s2815 0.0)
(s2816 0.0)
(s2817 0.0)
(s2818 0.0)
(s2819 0.0)
(s2820 0.0)
(s2821 0.0)
(s2822 0.0)
(s2823 0.0)
(s2824 0.0)
(s2825 0.0)
(s2826 0.0)
(s2827 0.0)
(s2828 0.0)
(s2829 0.0)
(s2830 0.0)
(s2831 0.0)
(s2832 0.0)
(s2833 0.0)
(s2834 0.0)
(s2835 0.0)
(s2836 0.0)
(s2837 0.0)
(s2838 0.0)
(s2839 0.0)
(s2840 0.0)
(s2841 0.0)
(s2842 0.0)
(s2843 0.0)
(s2844 0.0)
(s2845 0.0)
(s2846 0.0)
(s2847 0.0)
(s2848 0.0)
(s2849 0.0)
(s2850 0.0)
(s2851 0.0)
(s2852 0.0)
(s2853 0.0)
(s2854 0.0)
(s2855 0.0)
(s2856 0.0)
(s2857 0.0)
(s2858 0.0)
(s2859 0.0)
(s2860 0.0)
(s2861 0.0)
(s2862 0.0)
(s2863 0.0)
(s2864 0.0)
(s2865 0.0)
(s2866 0.0)
(s2867 0.0)
(s2868 0.0)
(s2869 0.0)
(s2870 0.0)
(s2871 0.0)
(s2872 0.0)
(s2873 0.0)
(s2874 0.0)
(s2875 0.0)
(s2876 0.0)
(s2877 0.0)
(s2878 0.0)
(s2879 0.0)
(s2880 0.0)
(s2881 0.0)
(s2882 0.0)
(s2883 0.0)
(s2884 0.0)
(s2885 0.0)
(s2886 0.0)
(s2887 0.0)
(s2888 0.0)
(s2889 0.0)
(s2890 0.0)
(s2891 0.0)
(s2892 0.0)
(s2893 0.0)
(s2894 0.0)
(s2895 0.0)
(s2896 0.0)
(s2897 0.0)
(s2898 0.0)
(s2899 0.0)
(s2900 0.0)
(s2901 0.0)
(s2902 0.0)
(s2903 0.0)
(s2904 0.0)
(s2905 0.0)
(s2906 0.0)
(s2907 0.0)
(s2908 0.0)
(s2909 0.0)
(s2910 0.0)
(s2911 0.0)
(s2912 0.0)
(s2913 0.0)
(s2914 0.0)
(s2915 0.0)
(s2916 0.0)
(s2917 0.0)
(s2918 0.0)
(s2919 0.0)
(s2920 0.0)
(s2921 0.0)
(s2922 0.0)
(s2923 0.0)
(s2924 0.0)
(s2925 0.0)
(s2926 0.0)
(s2927 0.0)
(s2928 0.0)
(s2929 0.0)
(s2930 0.0)
(s2931 0.0)
(s2932 0.0)
(s2933 0.0)
(s2934 0.0)
(s2935 0.0)
(s2936 0.0)
(s2937 0.0)
(s2938 0.0)
(s2939 0.0)
(s2940 0.0)
(s2941 0.0)
(s2942 0.0)
(s2943 0.0)
(s2944 0.0)
(s2945 0.0)
(s2946 0.0)
(s2947 0.0)
(s2948 0.0)
(s2949 0.0)
(s2950 0.0)
(s2951 0.0)
(s2952 0.0)
(s2953 0.0)
(s2954 0.0)
(s2955 0.0)
(s2956 0.0)
(s2957 0.0)
(s2958 0.0)
(s2959 0.0)
(s2960 0.0)
(s2961 0.0)
(s2962 0.0)
(s2963 0.0)
(s2964 0.0)
(s2965 0.0)
(s2966 0.0)
(s2967 0.0)
(s2968 0.0)
(s2969 0.0)
(s2970 0.0)
(s2971 0.0)
(s2972 0.0)
(s2973 0.0)
(s2974 0.0)
(s2975 0.0)
(s2976 0.0)
(s2977 0.0)
(s2978 0.0)
(s2979 0.0)
(s2980 0.0)
(s2981 0.0)
(s2982 0.0)
(s2983 0.0)
(s2984 0.0)
(s2985 0.0)
(s2986 0.0)
(s2987 0.0)
(s2988 0.0)
(s2989 0.0)
(s2990 0.0)
(s2991 0.0)
(s2992 0.0)
(s2993 0.0)
(s2994 0.0)
(s2995 0.0)
(s2996 0.0)
(s2997 0.0)
(s2998 0.0)
(s2999 0.0)
(s3000 0.0)
(s3001 0.0)
(s3002 0.0)
(s3003 0.0)
(s3004 0.0)
(s3005 0.0)
(s3006 0.0)
(s3007 0.0)
(s3008 0.0)
(s3009 0.0)
(s3010 0.0)
(s3011 0.0)
(s3012 0.0)
(s3013 0.0)
(s3014 0.0)
(s3015 0.0)
(s3016 0.0)
(s3017 0.0)
(s3018 0.0)
(s3019 0.0)
(s3020 0.0)
(s3021 0.0)
(s3022 0.0)
(s3023 0.0)
(s3024 0.0)
(s3025 0.0)
(s3026 0.0)
(s3027 0.0)
(s3028 0.0)
(s3029 0.0)
(s3030 0.0)
(s3031 0.0)
(s3032 0.0)
(s3033 0.0)
(s3034 0.0)
(s3035 0.0)
(s3036 0.0)
(s3037 0.0)
(s3038 0.0)
(s3039 0.0)
(s3040 0.0)
(s3041 0.0)
(s3042 0.0)
(s3043 0.0)
(s3044 0.0)
(s3045 0.0)
(s3046 0.0)
(s3047 0.0)
(s3048 0.0)
(s3049 0.0)
(s3050 0.0)
(s3051 0.0)
(s3052 0.0)
(s3053 0.0)
(s3054 0.0)
(s3055 0.0)
(s3056 0.0)
(s3057 0.0)
(s3058 0.0)
(s3059 0.0)
(s3060 0.0)
(s3061 0.0)
(s3062 0.0)
(s3063 0.0)
(s3064 0.0)
(s3065 0.0)
(s3066 0.0)
(s3067 0.0)
(s3068 0.0)
(s3069 0.0)
(s3070 0.0)
(s3071 0.0)
(s3072 0.0)
(s3073 0.0)
(s3074 0.0)
(s3075 0.0)
(s3076 0.0)
(s3077 0.0)
(s3078 0.0)
(s3079 0.0)
(s3080 0.0)
(s3081 0.0)
(s3082 0.0)
(s3083 0.0)
(s3084 0.0)
(s3085 0.0)
(s3086 0.0)
(s3087 0.0)
(s3088 0.0)
(s3089 0.0)
(s3090 0.0)
(s3091 0.0)
(s3092 0.0)
(s3093 0.0)
(s3094 0.0)
(s3095 0.0)
(s3096 0.0)
(s3097 0.0)
(s3098 0.0)
(s3099 0.0)
(s3100 0.0)
(s3101 0.0)
(s3102 0.0)
(s3103 0.0)
(s3104 0.0)
(s3105 0.0)
(s3106 0.0)
(s3107 0.0)
(s3108 0.0)
(s3109 0.0)
(s3110 0.0)
(s3111 0.0)
(s3112 0.0)
(s3113 0.0)
(s3114 0.0)
(s3115 0.0)
(s3116 0.0)
(s3117 0.0)
(s3118 0.0)
(s3119 0.0)
(s3120 0.0)
(s3121 0.0)
(s3122 0.0)
(s3123 0.0)
(s3124 0.0)
(s3125 0.0)
(s3126 0.0)
(s3127 0.0)
(s3128 0.0)
(s3129 0.0)
(s3130 0.0)
(s3131 0.0)
(s3132 0.0)
(s3133 0.0)
(s3134 0.0)
(s3135 0.0)
(s3136 0.0)
(s3137 0.0)
(s3138 0.0)
(s3139 0.0)
(s3140 0.0)
(s3141 0.0)
(s3142 0.0)
(s3143 0.0)
(s3144 0.0)
(s3145 0.0)
(s3146 0.0)
(s3147 0.0)
(s3148 0.0)
(s3149 0.0)
(s3150 0.0)
(s3151 0.0)
(s3152 0.0)
(s3153 0.0)
(s3154 0.0)
(s3155 0.0)
(s3156 0.0)
(s3157 0.0)
(s3158 0.0)
(s3159 0.0)
(s3160 0.0)
(s3161 0.0)
(s3162 0.0)
(s3163 0.0)
(s3164 0.0)
(s3165 0.0)
(s3166 0.0)
(s3167 0.0)
(s3168 0.0)
(s3169 0.0)
(s3170 0.0)
(s3171 0.0)
(s3172 0.0)
(s3173 0.0)
(s3174 0.0)
(s3175 0.0)
(s3176 0.0)
(s3177 0.0)
(s3178 0.0)
(s3179 0.0)
(s3180 0.0)
(s3181 0.0)
(s3182 0.0)
(s3183 0.0)
(s3184 0.0)
(s3185 0.0)
(s3186 0.0)
(s3187 0.0)
(s3188 0.0)
(s3189 0.0)
(s3190 0.0)
(s3191 0.0)
(s3192 0.0)
(s3193 0.0)
(s3194 0.0)
(s3195 0.0)
(s3196 0.0)
(s3197 0.0)
(s3198 0.0)
(s3199 0.0)
(s3200 0.0)
(s3201 0.0)
(s3202 0.0)
(s3203 0.0)
(s3204 0.0)
(s3205 0.0)
(s3206 0.0)
(s3207 0.0)
(s3208 0.0)
(s3209 0.0)
(s3210 0.0)
(s3211 0.0)
(s3212 0.0)
(s3213 0.0)
(s3214 0.0)
(s3215 0.0)
(s3216 0.0)
(s3217 0.0)
(s3218 0.0)
(s3219 0.0)
(s3220 0.0)
(s3221 0.0)
(s3222 0.0)
(s3223 0.0)
(s3224 0.0)
(s3225 0.0)
(s3226 0.0)
(s3227 0.0)
(s3228 0.0)
(s3229 0.0)
(s3230 0.0)
(s3231 0.0)
(s3232 0.0)
(s3233 0.0)
(s3234 0.0)
(s3235 0.0)
(s3236 0.0)
(s3237 0.0)
(s3238 0.0)
(s3239 0.0)
(s3240 0.0)
(s3241 0.0)
(s3242 0.0)
(s3243 0.0)
(s3244 0.0)
(s3245 0.0)
(s3246 0.0)
(s3247 0.0)
(s3248 0.0)
(s3249 0.0)
(s3250 0.0)
(s3251 0.0)
(s3252 0.0)
(s3253 0.0)
(s3254 0.0)
(s3255 0.0)
(s3256 0.0)
(s3257 0.0)
(s3258 0.0)
(s3259 0.0)
(s3260 0.0)
(s3261 0.0)
(s3262 0.0)
(s3263 0.0)
(s3264 0.0)
(s3265 0.0)
(s3266 0.0)
(s3267 0.0)
(s3268 0.0)
(s3269 0.0)
(s3270 0.0)
(s3271 0.0)
(s3272 0.0)
(s3273 0.0)
(s3274 0.0)
(s3275 0.0)
(s3276 0.0)
(s3277 0.0)
(s3278 0.0)
(s3279 0.0)
(s3280 0.0)
(s3281 0.0)
(s3282 0.0)
(s3283 0.0)
(s3284 0.0)
(s3285 0.0)
(s3286 0.0)
(s3287 0.0)
(s3288 0.0)
(s3289 0.0)
(s3290 0.0)
(s3291 0.0)
(s3292 0.0)
(s3293 0.0)
(s3294 0.0)
(s3295 0.0)
(s3296 0.0)
(s3297 0.0)
(s3298 0.0)
(s3299 0.0)
(s3300 0.0)
(s3301 0.0)
(s3302 0.0)
(s3303 0.0)
(s3304 0.0)
(s3305 0.0)
(s3306 0.0)
(s3307 0.0)
(s3308 0.0)
(s3309 0.0)
(s3310 0.0)
(s3311 0.0)
(s3312 0.0)
(s3313 0.0)
(s3314 0.0)
(s3315 0.0)
(s3316 0.0)
(s3317 0.0)
(s3318 0.0)
(s3319 0.0)
(s3320 0.0)
(s3321 0.0)
(s3322 0.0)
(s3323 0.0)
(s3324 0.0)
(s3325 0.0)
(s3326 0.0)
(s3327 0.0)
(s3328 0.0)
(s3329 0.0)
(s3330 0.0)
(s3331 0.0)
(s3332 0.0)
(s3333 0.0)
(s3334 0.0)
(s3335 0.0)
(s3336 0.0)
(s3337 0.0)
(s3338 0.0)
(s3339 0.0)
(s3340 0.0)
(s3341 0.0)
(s3342 0.0)
(s3343 0.0)
(s3344 0.0)
(s3345 0.0)
(s3346 0.0)
(s3347 0.0)
(s3348 0.0)
(s3349 0.0)
(s3350 0.0)
(s3351 0.0)
(s3352 0.0)
(s3353 0.0)
(s3354 0.0)
(s3355 0.0)
(s3356 0.0)
(s3357 0.0)
(s3358 0.0)
(s3359 0.0)
(s3360 0.0)
(s3361 0.0)
(s3362 0.0)
(s3363 0.0)
(s3364 0.0)
(s3365 0.0)
(s3366 0.0)
(s3367 0.0)
(s3368 0.0)
(s3369 0.0)
(s3370 0.0)
(s3371 0.0)
(s3372 timeout
0.0)
(s3373 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38867ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38939ms
Finished structural reductions in LTL mode , in 1 iterations and 91238 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-10 finished in 91389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||((X(p1)&&F(p2)) U (G(((X(p1)&&F(p2))||X(G(p1))))||(!p3&&((X(p1)&&F(p2))||X(G(p1))))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 190 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-22 17:06:23] [INFO ] Invariant cache hit.
[2024-05-22 17:06:25] [INFO ] Implicit Places using invariants in 2002 ms returned []
[2024-05-22 17:06:25] [INFO ] Invariant cache hit.
[2024-05-22 17:06:28] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 17:06:58] [INFO ] Performed 311/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:07:14] [INFO ] Implicit Places using invariants and state equation in 48519 ms returned []
Implicit Place search using SMT with State Equation took 50523 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 17:07:14] [INFO ] Invariant cache hit.
[2024-05-22 17:07:14] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38921ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38994ms
Finished structural reductions in LTL mode , in 1 iterations and 89717 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-11
Product exploration explored 100000 steps with 106 reset in 770 ms.
Product exploration explored 100000 steps with 103 reset in 871 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))]
Knowledge based reduction with 38 factoid took 669 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (39 resets) in 809 ms. (49 steps per ms) remains 13/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
[2024-05-22 17:07:57] [INFO ] Invariant cache hit.
[2024-05-22 17:07:57] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3605 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 17:07:57] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-22 17:07:57] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-22 17:07:58] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-22 17:07:58] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-22 17:07:58] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-22 17:07:58] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-22 17:07:58] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-22 17:07:58] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-22 17:07:58] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-22 17:07:59] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-22 17:07:59] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-22 17:07:59] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-22 17:07:59] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-22 17:07:59] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-22 17:07:59] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 17:07:59] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-22 17:08:00] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-22 17:08:00] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-22 17:08:00] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-22 17:08:00] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3605 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 17:08:00] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-22 17:08:00] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-22 17:08:00] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-22 17:08:01] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-22 17:08:01] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-22 17:08:01] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-22 17:08:01] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-22 17:08:01] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3605/13523 variables, and 31 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/40 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/3683 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3605 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3605 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3605 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 74/3679 variables, 37/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 17:08:07] [INFO ] Deduced a trap composed of 72 places in 3321 ms of which 22 ms to minimize.
SMT process timed out in 10724ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 3 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 3 with 3116 rules applied. Total rules applied 3672 place count 1847 transition count 8004
Drop transitions (Redundant composition of simpler transitions.) removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 3 with 1480 rules applied. Total rules applied 5152 place count 1847 transition count 6524
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5154 place count 1847 transition count 6522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 4 with 1640 rules applied. Total rules applied 6796 place count 1845 transition count 6522
Applied a total of 6796 rules in 1220 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1220 ms. Remains : 1845/3683 places, 6522/9840 transitions.
RANDOM walk for 40000 steps (216 resets) in 2387 ms. (16 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 10/12 properties
// Phase 1: matrix 6522 rows 1845 cols
[2024-05-22 17:08:10] [INFO ] Computed 42 invariants in 151 ms
[2024-05-22 17:08:10] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1767 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:08:10] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 17:08:11] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1767 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 17:08:12] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1767 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1767 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 74/1841 variables, 37/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/1843 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:08:15] [INFO ] Deduced a trap composed of 57 places in 1354 ms of which 10 ms to minimize.
[2024-05-22 17:08:17] [INFO ] Deduced a trap composed of 50 places in 1511 ms of which 11 ms to minimize.
[2024-05-22 17:08:18] [INFO ] Deduced a trap composed of 53 places in 1456 ms of which 12 ms to minimize.
[2024-05-22 17:08:20] [INFO ] Deduced a trap composed of 55 places in 1348 ms of which 11 ms to minimize.
[2024-05-22 17:08:21] [INFO ] Deduced a trap composed of 59 places in 1395 ms of which 11 ms to minimize.
[2024-05-22 17:08:22] [INFO ] Deduced a trap composed of 55 places in 1343 ms of which 11 ms to minimize.
[2024-05-22 17:08:24] [INFO ] Deduced a trap composed of 53 places in 1360 ms of which 10 ms to minimize.
[2024-05-22 17:08:25] [INFO ] Deduced a trap composed of 55 places in 1361 ms of which 10 ms to minimize.
[2024-05-22 17:08:27] [INFO ] Deduced a trap composed of 59 places in 1303 ms of which 10 ms to minimize.
[2024-05-22 17:08:28] [INFO ] Deduced a trap composed of 59 places in 1283 ms of which 10 ms to minimize.
[2024-05-22 17:08:29] [INFO ] Deduced a trap composed of 56 places in 1285 ms of which 10 ms to minimize.
[2024-05-22 17:08:30] [INFO ] Deduced a trap composed of 54 places in 1282 ms of which 10 ms to minimize.
[2024-05-22 17:08:32] [INFO ] Deduced a trap composed of 72 places in 1285 ms of which 10 ms to minimize.
[2024-05-22 17:08:33] [INFO ] Deduced a trap composed of 61 places in 1304 ms of which 10 ms to minimize.
[2024-05-22 17:08:34] [INFO ] Deduced a trap composed of 72 places in 1249 ms of which 10 ms to minimize.
[2024-05-22 17:08:36] [INFO ] Deduced a trap composed of 62 places in 1263 ms of which 11 ms to minimize.
[2024-05-22 17:08:37] [INFO ] Deduced a trap composed of 52 places in 1199 ms of which 10 ms to minimize.
[2024-05-22 17:08:38] [INFO ] Deduced a trap composed of 53 places in 1292 ms of which 11 ms to minimize.
[2024-05-22 17:08:39] [INFO ] Deduced a trap composed of 55 places in 1219 ms of which 10 ms to minimize.
[2024-05-22 17:08:41] [INFO ] Deduced a trap composed of 59 places in 1218 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:08:42] [INFO ] Deduced a trap composed of 59 places in 1210 ms of which 10 ms to minimize.
[2024-05-22 17:08:43] [INFO ] Deduced a trap composed of 60 places in 1250 ms of which 11 ms to minimize.
[2024-05-22 17:08:44] [INFO ] Deduced a trap composed of 51 places in 1202 ms of which 10 ms to minimize.
[2024-05-22 17:08:46] [INFO ] Deduced a trap composed of 54 places in 1219 ms of which 10 ms to minimize.
[2024-05-22 17:08:47] [INFO ] Deduced a trap composed of 53 places in 1236 ms of which 10 ms to minimize.
[2024-05-22 17:08:48] [INFO ] Deduced a trap composed of 51 places in 1201 ms of which 10 ms to minimize.
[2024-05-22 17:08:49] [INFO ] Deduced a trap composed of 51 places in 1188 ms of which 10 ms to minimize.
[2024-05-22 17:08:51] [INFO ] Deduced a trap composed of 51 places in 1195 ms of which 9 ms to minimize.
[2024-05-22 17:08:52] [INFO ] Deduced a trap composed of 53 places in 1208 ms of which 9 ms to minimize.
[2024-05-22 17:08:53] [INFO ] Deduced a trap composed of 56 places in 1188 ms of which 10 ms to minimize.
[2024-05-22 17:08:54] [INFO ] Deduced a trap composed of 51 places in 1178 ms of which 10 ms to minimize.
[2024-05-22 17:08:56] [INFO ] Deduced a trap composed of 57 places in 1105 ms of which 10 ms to minimize.
SMT process timed out in 45571ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 166 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 1845/1845 places, 6522/6522 transitions.
RANDOM walk for 40000 steps (215 resets) in 2258 ms. (17 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 84219 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 10
Probabilistic random walk after 84219 steps, saw 23897 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-22 17:09:00] [INFO ] Invariant cache hit.
[2024-05-22 17:09:00] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1767 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:09:00] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1767 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1767 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 74/1841 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:09:03] [INFO ] Deduced a trap composed of 57 places in 1372 ms of which 10 ms to minimize.
[2024-05-22 17:09:04] [INFO ] Deduced a trap composed of 50 places in 1411 ms of which 11 ms to minimize.
[2024-05-22 17:09:06] [INFO ] Deduced a trap composed of 55 places in 1317 ms of which 11 ms to minimize.
[2024-05-22 17:09:07] [INFO ] Deduced a trap composed of 49 places in 1274 ms of which 11 ms to minimize.
[2024-05-22 17:09:08] [INFO ] Deduced a trap composed of 58 places in 1224 ms of which 10 ms to minimize.
[2024-05-22 17:09:10] [INFO ] Deduced a trap composed of 57 places in 1221 ms of which 9 ms to minimize.
[2024-05-22 17:09:11] [INFO ] Deduced a trap composed of 61 places in 1109 ms of which 9 ms to minimize.
[2024-05-22 17:09:12] [INFO ] Deduced a trap composed of 61 places in 1200 ms of which 9 ms to minimize.
[2024-05-22 17:09:13] [INFO ] Deduced a trap composed of 59 places in 1197 ms of which 10 ms to minimize.
[2024-05-22 17:09:14] [INFO ] Deduced a trap composed of 56 places in 1210 ms of which 10 ms to minimize.
[2024-05-22 17:09:16] [INFO ] Deduced a trap composed of 56 places in 1235 ms of which 10 ms to minimize.
[2024-05-22 17:09:17] [INFO ] Deduced a trap composed of 61 places in 1256 ms of which 9 ms to minimize.
[2024-05-22 17:09:18] [INFO ] Deduced a trap composed of 81 places in 1185 ms of which 10 ms to minimize.
[2024-05-22 17:09:19] [INFO ] Deduced a trap composed of 78 places in 1197 ms of which 10 ms to minimize.
[2024-05-22 17:09:21] [INFO ] Deduced a trap composed of 58 places in 1173 ms of which 10 ms to minimize.
[2024-05-22 17:09:22] [INFO ] Deduced a trap composed of 57 places in 1164 ms of which 10 ms to minimize.
[2024-05-22 17:09:23] [INFO ] Deduced a trap composed of 52 places in 1136 ms of which 10 ms to minimize.
[2024-05-22 17:09:24] [INFO ] Deduced a trap composed of 52 places in 1087 ms of which 9 ms to minimize.
[2024-05-22 17:09:25] [INFO ] Deduced a trap composed of 53 places in 1073 ms of which 9 ms to minimize.
[2024-05-22 17:09:26] [INFO ] Deduced a trap composed of 52 places in 1068 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:09:27] [INFO ] Deduced a trap composed of 56 places in 1092 ms of which 9 ms to minimize.
[2024-05-22 17:09:29] [INFO ] Deduced a trap composed of 55 places in 1071 ms of which 8 ms to minimize.
[2024-05-22 17:09:30] [INFO ] Deduced a trap composed of 59 places in 1016 ms of which 9 ms to minimize.
[2024-05-22 17:09:31] [INFO ] Deduced a trap composed of 54 places in 1005 ms of which 9 ms to minimize.
[2024-05-22 17:09:32] [INFO ] Deduced a trap composed of 57 places in 945 ms of which 8 ms to minimize.
[2024-05-22 17:09:33] [INFO ] Deduced a trap composed of 54 places in 1058 ms of which 9 ms to minimize.
[2024-05-22 17:09:34] [INFO ] Deduced a trap composed of 55 places in 1036 ms of which 8 ms to minimize.
[2024-05-22 17:09:35] [INFO ] Deduced a trap composed of 58 places in 981 ms of which 9 ms to minimize.
[2024-05-22 17:09:36] [INFO ] Deduced a trap composed of 57 places in 891 ms of which 8 ms to minimize.
[2024-05-22 17:09:37] [INFO ] Deduced a trap composed of 57 places in 993 ms of which 9 ms to minimize.
[2024-05-22 17:09:38] [INFO ] Deduced a trap composed of 68 places in 1011 ms of which 9 ms to minimize.
[2024-05-22 17:09:39] [INFO ] Deduced a trap composed of 68 places in 968 ms of which 8 ms to minimize.
[2024-05-22 17:09:40] [INFO ] Deduced a trap composed of 59 places in 960 ms of which 8 ms to minimize.
[2024-05-22 17:09:41] [INFO ] Deduced a trap composed of 58 places in 971 ms of which 9 ms to minimize.
[2024-05-22 17:09:42] [INFO ] Deduced a trap composed of 59 places in 953 ms of which 8 ms to minimize.
[2024-05-22 17:09:43] [INFO ] Deduced a trap composed of 57 places in 910 ms of which 8 ms to minimize.
[2024-05-22 17:09:44] [INFO ] Deduced a trap composed of 56 places in 887 ms of which 9 ms to minimize.
[2024-05-22 17:09:44] [INFO ] Deduced a trap composed of 58 places in 885 ms of which 8 ms to minimize.
[2024-05-22 17:09:45] [INFO ] Deduced a trap composed of 59 places in 893 ms of which 8 ms to minimize.
[2024-05-22 17:09:46] [INFO ] Deduced a trap composed of 58 places in 856 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:09:47] [INFO ] Deduced a trap composed of 59 places in 870 ms of which 8 ms to minimize.
[2024-05-22 17:09:48] [INFO ] Deduced a trap composed of 59 places in 902 ms of which 8 ms to minimize.
[2024-05-22 17:09:49] [INFO ] Deduced a trap composed of 57 places in 884 ms of which 8 ms to minimize.
[2024-05-22 17:09:50] [INFO ] Deduced a trap composed of 58 places in 864 ms of which 8 ms to minimize.
[2024-05-22 17:09:51] [INFO ] Deduced a trap composed of 52 places in 861 ms of which 8 ms to minimize.
[2024-05-22 17:09:52] [INFO ] Deduced a trap composed of 55 places in 895 ms of which 8 ms to minimize.
[2024-05-22 17:09:53] [INFO ] Deduced a trap composed of 57 places in 886 ms of which 8 ms to minimize.
[2024-05-22 17:09:54] [INFO ] Deduced a trap composed of 60 places in 917 ms of which 8 ms to minimize.
[2024-05-22 17:09:55] [INFO ] Deduced a trap composed of 52 places in 885 ms of which 9 ms to minimize.
[2024-05-22 17:09:55] [INFO ] Deduced a trap composed of 45 places in 754 ms of which 8 ms to minimize.
[2024-05-22 17:09:56] [INFO ] Deduced a trap composed of 45 places in 740 ms of which 7 ms to minimize.
[2024-05-22 17:09:57] [INFO ] Deduced a trap composed of 53 places in 811 ms of which 8 ms to minimize.
[2024-05-22 17:09:58] [INFO ] Deduced a trap composed of 52 places in 801 ms of which 8 ms to minimize.
[2024-05-22 17:09:59] [INFO ] Deduced a trap composed of 53 places in 777 ms of which 8 ms to minimize.
[2024-05-22 17:09:59] [INFO ] Deduced a trap composed of 58 places in 773 ms of which 7 ms to minimize.
[2024-05-22 17:10:00] [INFO ] Deduced a trap composed of 51 places in 782 ms of which 8 ms to minimize.
[2024-05-22 17:10:01] [INFO ] Deduced a trap composed of 51 places in 784 ms of which 7 ms to minimize.
[2024-05-22 17:10:02] [INFO ] Deduced a trap composed of 55 places in 796 ms of which 8 ms to minimize.
[2024-05-22 17:10:03] [INFO ] Deduced a trap composed of 52 places in 778 ms of which 7 ms to minimize.
[2024-05-22 17:10:03] [INFO ] Deduced a trap composed of 70 places in 797 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:10:04] [INFO ] Deduced a trap composed of 58 places in 756 ms of which 7 ms to minimize.
[2024-05-22 17:10:05] [INFO ] Deduced a trap composed of 60 places in 733 ms of which 7 ms to minimize.
[2024-05-22 17:10:06] [INFO ] Deduced a trap composed of 63 places in 744 ms of which 8 ms to minimize.
[2024-05-22 17:10:07] [INFO ] Deduced a trap composed of 45 places in 712 ms of which 7 ms to minimize.
[2024-05-22 17:10:07] [INFO ] Deduced a trap composed of 58 places in 683 ms of which 7 ms to minimize.
[2024-05-22 17:10:08] [INFO ] Deduced a trap composed of 58 places in 656 ms of which 7 ms to minimize.
[2024-05-22 17:10:09] [INFO ] Deduced a trap composed of 54 places in 655 ms of which 6 ms to minimize.
[2024-05-22 17:10:10] [INFO ] Deduced a trap composed of 54 places in 649 ms of which 7 ms to minimize.
[2024-05-22 17:10:10] [INFO ] Deduced a trap composed of 61 places in 632 ms of which 7 ms to minimize.
[2024-05-22 17:10:11] [INFO ] Deduced a trap composed of 63 places in 557 ms of which 6 ms to minimize.
[2024-05-22 17:10:11] [INFO ] Deduced a trap composed of 57 places in 591 ms of which 6 ms to minimize.
[2024-05-22 17:10:12] [INFO ] Deduced a trap composed of 59 places in 610 ms of which 6 ms to minimize.
[2024-05-22 17:10:13] [INFO ] Deduced a trap composed of 51 places in 575 ms of which 6 ms to minimize.
[2024-05-22 17:10:13] [INFO ] Deduced a trap composed of 48 places in 488 ms of which 5 ms to minimize.
[2024-05-22 17:10:14] [INFO ] Deduced a trap composed of 56 places in 485 ms of which 6 ms to minimize.
[2024-05-22 17:10:14] [INFO ] Deduced a trap composed of 56 places in 487 ms of which 5 ms to minimize.
[2024-05-22 17:10:15] [INFO ] Deduced a trap composed of 53 places in 459 ms of which 5 ms to minimize.
[2024-05-22 17:10:15] [INFO ] Deduced a trap composed of 53 places in 463 ms of which 5 ms to minimize.
SMT process timed out in 75438ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 171 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 166 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
[2024-05-22 17:10:16] [INFO ] Invariant cache hit.
[2024-05-22 17:10:17] [INFO ] Implicit Places using invariants in 1879 ms returned []
[2024-05-22 17:10:17] [INFO ] Invariant cache hit.
[2024-05-22 17:10:19] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-22 17:10:49] [INFO ] Performed 780/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:11:18] [INFO ] Implicit Places using invariants and state equation in 60942 ms returned []
Implicit Place search using SMT with State Equation took 62823 ms to find 0 implicit places.
[2024-05-22 17:11:19] [INFO ] Redundant transitions in 491 ms returned []
Running 6482 sub problems to find dead transitions.
[2024-05-22 17:11:19] [INFO ] Invariant cache hit.
[2024-05-22 17:11:19] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6482 unsolved
SMT process timed out in 35918ms, After SMT, problems are : Problem set: 0 solved, 6482 unsolved
Search for dead transitions found 0 dead transitions in 35979ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99479 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (OR (NOT p0) p2) (OR p2 p3)))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (OR p0 (NOT p1)))), (F p3)]
Knowledge based reduction with 38 factoid took 1350 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 187 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 17:11:57] [INFO ] Computed 42 invariants in 451 ms
[2024-05-22 17:11:59] [INFO ] Implicit Places using invariants in 2446 ms returned []
[2024-05-22 17:11:59] [INFO ] Invariant cache hit.
[2024-05-22 17:12:02] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 17:12:32] [INFO ] Performed 357/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:12:42] [INFO ] Implicit Places using invariants and state equation in 42793 ms returned []
Implicit Place search using SMT with State Equation took 45244 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 17:12:42] [INFO ] Invariant cache hit.
[2024-05-22 17:12:42] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38956ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39026ms
Finished structural reductions in LTL mode , in 1 iterations and 84467 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X p1), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X p1)), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND p0 p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 38 factoid took 712 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (39 resets) in 1844 ms. (21 steps per ms) remains 17/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 12/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 12/12 properties
[2024-05-22 17:13:23] [INFO ] Invariant cache hit.
[2024-05-22 17:13:23] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3605 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 17:13:23] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3605 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3605 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 74/3679 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3679 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/3681 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 17:13:30] [INFO ] Deduced a trap composed of 75 places in 3362 ms of which 21 ms to minimize.
SMT process timed out in 7157ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 3 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 3 with 3116 rules applied. Total rules applied 3672 place count 1847 transition count 8004
Drop transitions (Redundant composition of simpler transitions.) removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 3 with 1480 rules applied. Total rules applied 5152 place count 1847 transition count 6524
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5154 place count 1847 transition count 6522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 4 with 1640 rules applied. Total rules applied 6796 place count 1845 transition count 6522
Applied a total of 6796 rules in 1247 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1248 ms. Remains : 1845/3683 places, 6522/9840 transitions.
RANDOM walk for 40000 steps (213 resets) in 2387 ms. (16 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 78521 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 12
Probabilistic random walk after 78521 steps, saw 23031 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 6522 rows 1845 cols
[2024-05-22 17:13:36] [INFO ] Computed 42 invariants in 155 ms
[2024-05-22 17:13:36] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1767 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 17:13:36] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1767 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1767 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 74/1841 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 17:13:39] [INFO ] Deduced a trap composed of 49 places in 1302 ms of which 11 ms to minimize.
[2024-05-22 17:13:40] [INFO ] Deduced a trap composed of 51 places in 1370 ms of which 11 ms to minimize.
[2024-05-22 17:13:42] [INFO ] Deduced a trap composed of 86 places in 1439 ms of which 11 ms to minimize.
[2024-05-22 17:13:43] [INFO ] Deduced a trap composed of 52 places in 1391 ms of which 11 ms to minimize.
[2024-05-22 17:13:45] [INFO ] Deduced a trap composed of 53 places in 1378 ms of which 11 ms to minimize.
[2024-05-22 17:13:46] [INFO ] Deduced a trap composed of 55 places in 1296 ms of which 11 ms to minimize.
[2024-05-22 17:13:47] [INFO ] Deduced a trap composed of 55 places in 1275 ms of which 10 ms to minimize.
[2024-05-22 17:13:49] [INFO ] Deduced a trap composed of 51 places in 1277 ms of which 10 ms to minimize.
[2024-05-22 17:13:50] [INFO ] Deduced a trap composed of 51 places in 1316 ms of which 11 ms to minimize.
[2024-05-22 17:13:51] [INFO ] Deduced a trap composed of 52 places in 1313 ms of which 11 ms to minimize.
[2024-05-22 17:13:53] [INFO ] Deduced a trap composed of 53 places in 1329 ms of which 11 ms to minimize.
[2024-05-22 17:13:54] [INFO ] Deduced a trap composed of 55 places in 1301 ms of which 10 ms to minimize.
[2024-05-22 17:13:55] [INFO ] Deduced a trap composed of 56 places in 1292 ms of which 11 ms to minimize.
[2024-05-22 17:13:57] [INFO ] Deduced a trap composed of 53 places in 1242 ms of which 10 ms to minimize.
[2024-05-22 17:13:58] [INFO ] Deduced a trap composed of 55 places in 1255 ms of which 10 ms to minimize.
[2024-05-22 17:13:59] [INFO ] Deduced a trap composed of 53 places in 1228 ms of which 11 ms to minimize.
[2024-05-22 17:14:01] [INFO ] Deduced a trap composed of 52 places in 1257 ms of which 10 ms to minimize.
[2024-05-22 17:14:02] [INFO ] Deduced a trap composed of 54 places in 1176 ms of which 10 ms to minimize.
[2024-05-22 17:14:03] [INFO ] Deduced a trap composed of 51 places in 1123 ms of which 9 ms to minimize.
[2024-05-22 17:14:04] [INFO ] Deduced a trap composed of 51 places in 1109 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 17:14:05] [INFO ] Deduced a trap composed of 53 places in 1096 ms of which 9 ms to minimize.
[2024-05-22 17:14:06] [INFO ] Deduced a trap composed of 57 places in 1075 ms of which 9 ms to minimize.
[2024-05-22 17:14:07] [INFO ] Deduced a trap composed of 54 places in 1066 ms of which 9 ms to minimize.
[2024-05-22 17:14:08] [INFO ] Deduced a trap composed of 67 places in 1044 ms of which 9 ms to minimize.
[2024-05-22 17:14:10] [INFO ] Deduced a trap composed of 57 places in 1058 ms of which 9 ms to minimize.
[2024-05-22 17:14:11] [INFO ] Deduced a trap composed of 55 places in 976 ms of which 9 ms to minimize.
[2024-05-22 17:14:11] [INFO ] Deduced a trap composed of 53 places in 921 ms of which 9 ms to minimize.
[2024-05-22 17:14:12] [INFO ] Deduced a trap composed of 73 places in 905 ms of which 8 ms to minimize.
[2024-05-22 17:14:13] [INFO ] Deduced a trap composed of 65 places in 898 ms of which 8 ms to minimize.
[2024-05-22 17:14:14] [INFO ] Deduced a trap composed of 75 places in 898 ms of which 8 ms to minimize.
[2024-05-22 17:14:15] [INFO ] Deduced a trap composed of 49 places in 890 ms of which 8 ms to minimize.
[2024-05-22 17:14:16] [INFO ] Deduced a trap composed of 45 places in 816 ms of which 8 ms to minimize.
[2024-05-22 17:14:17] [INFO ] Deduced a trap composed of 51 places in 803 ms of which 7 ms to minimize.
[2024-05-22 17:14:18] [INFO ] Deduced a trap composed of 67 places in 754 ms of which 8 ms to minimize.
[2024-05-22 17:14:19] [INFO ] Deduced a trap composed of 64 places in 824 ms of which 8 ms to minimize.
[2024-05-22 17:14:19] [INFO ] Deduced a trap composed of 60 places in 803 ms of which 8 ms to minimize.
[2024-05-22 17:14:20] [INFO ] Deduced a trap composed of 57 places in 810 ms of which 7 ms to minimize.
[2024-05-22 17:14:21] [INFO ] Deduced a trap composed of 80 places in 776 ms of which 7 ms to minimize.
SMT process timed out in 45588ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 161 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 165 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
[2024-05-22 17:14:21] [INFO ] Invariant cache hit.
[2024-05-22 17:14:23] [INFO ] Implicit Places using invariants in 1978 ms returned []
[2024-05-22 17:14:23] [INFO ] Invariant cache hit.
[2024-05-22 17:14:25] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-22 17:14:55] [INFO ] Performed 801/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:15:25] [INFO ] Implicit Places using invariants and state equation in 61682 ms returned []
Implicit Place search using SMT with State Equation took 63662 ms to find 0 implicit places.
[2024-05-22 17:15:26] [INFO ] Redundant transitions in 496 ms returned []
Running 6482 sub problems to find dead transitions.
[2024-05-22 17:15:26] [INFO ] Invariant cache hit.
[2024-05-22 17:15:26] [INFO ] State equation strengthened by 6395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6482 unsolved
SMT process timed out in 36074ms, After SMT, problems are : Problem set: 0 solved, 6482 unsolved
Search for dead transitions found 0 dead transitions in 36124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100469 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X p1), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X p1)), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND p0 p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F p3), (F (NOT (AND (OR (NOT p0) p2) (OR p3 p2)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 38 factoid took 1221 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 105 reset in 757 ms.
Product exploration explored 100000 steps with 106 reset in 790 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 3683 transition count 9840
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 198 place count 3683 transition count 9840
Deduced a syphon composed of 239 places in 4 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 239 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 319 place count 3603 transition count 9760
Deduced a syphon composed of 159 places in 3 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 399 place count 3603 transition count 9760
Performed 1597 Post agglomeration using F-continuation condition.Transition count delta: -3036
Deduced a syphon composed of 1756 places in 3 ms
Iterating global reduction 1 with 1597 rules applied. Total rules applied 1996 place count 3603 transition count 12796
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 2153 place count 3446 transition count 12639
Deduced a syphon composed of 1599 places in 3 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 2310 place count 3446 transition count 12639
Deduced a syphon composed of 1599 places in 3 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 1 with 1480 rules applied. Total rules applied 3790 place count 3446 transition count 11159
Deduced a syphon composed of 1599 places in 2 ms
Applied a total of 3790 rules in 2444 ms. Remains 3446 /3683 variables (removed 237) and now considering 11159/9840 (removed -1319) transitions.
Running 11119 sub problems to find dead transitions.
// Phase 1: matrix 11159 rows 3446 cols
[2024-05-22 17:16:09] [INFO ] Computed 42 invariants in 378 ms
[2024-05-22 17:16:09] [INFO ] State equation strengthened by 4756 read => feed constraints.
(s3439 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
At refinement iteration 0 (INCLUDED_ONLY) 0/3445 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 11119 unsolved
SMT process timed out in 41881ms, After SMT, problems are : Problem set: 0 solved, 11119 unsolved
Search for dead transitions found 0 dead transitions in 41966ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3446/3683 places, 11159/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44426 ms. Remains : 3446/3683 places, 11159/9840 transitions.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 201 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 17:16:51] [INFO ] Computed 42 invariants in 425 ms
[2024-05-22 17:16:53] [INFO ] Implicit Places using invariants in 2435 ms returned []
[2024-05-22 17:16:53] [INFO ] Invariant cache hit.
[2024-05-22 17:16:56] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 17:17:26] [INFO ] Performed 315/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:17:40] [INFO ] Implicit Places using invariants and state equation in 46853 ms returned []
Implicit Place search using SMT with State Equation took 49291 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 17:17:40] [INFO ] Invariant cache hit.
[2024-05-22 17:17:40] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39141ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39220ms
Finished structural reductions in LTL mode , in 1 iterations and 88727 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-11 finished in 715793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X((G(p1) U X(p2))))||p0))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 197 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-22 17:18:19] [INFO ] Invariant cache hit.
[2024-05-22 17:18:21] [INFO ] Implicit Places using invariants in 2002 ms returned []
[2024-05-22 17:18:21] [INFO ] Invariant cache hit.
[2024-05-22 17:18:24] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 17:18:55] [INFO ] Performed 329/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:19:08] [INFO ] Implicit Places using invariants and state equation in 47012 ms returned []
Implicit Place search using SMT with State Equation took 49016 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 17:19:08] [INFO ] Invariant cache hit.
[2024-05-22 17:19:08] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38949ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39021ms
Finished structural reductions in LTL mode , in 1 iterations and 88245 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 982 ms.
Product exploration explored 100000 steps with 33333 reset in 963 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-12 finished in 90589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&G(p1)))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 839 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-22 17:19:51] [INFO ] Computed 42 invariants in 141 ms
[2024-05-22 17:19:52] [INFO ] Implicit Places using invariants in 1342 ms returned []
[2024-05-22 17:19:52] [INFO ] Invariant cache hit.
[2024-05-22 17:19:53] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:20:10] [INFO ] Implicit Places using invariants and state equation in 18418 ms returned []
Implicit Place search using SMT with State Equation took 19762 ms to find 0 implicit places.
[2024-05-22 17:20:11] [INFO ] Redundant transitions in 479 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-22 17:20:11] [INFO ] Invariant cache hit.
[2024-05-22 17:20:11] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34794ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34840ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55939 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-13
Product exploration explored 100000 steps with 490 reset in 945 ms.
Product exploration explored 100000 steps with 492 reset in 1011 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 139 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (196 resets) in 431 ms. (92 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
[2024-05-22 17:20:48] [INFO ] Invariant cache hit.
[2024-05-22 17:20:48] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:20:48] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-22 17:20:49] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:20:50] [INFO ] Deduced a trap composed of 60 places in 1392 ms of which 11 ms to minimize.
[2024-05-22 17:20:52] [INFO ] Deduced a trap composed of 50 places in 1386 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6521/8364 variables, 1843/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8364 variables, 4757/6646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 0/6646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5060ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 1 with 1640 rules applied. Total rules applied 1644 place count 1843 transition count 6519
Applied a total of 1644 rules in 450 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 450 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (213 resets) in 524 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 113091 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 1
Probabilistic random walk after 113091 steps, saw 29868 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-22 17:20:57] [INFO ] Computed 42 invariants in 162 ms
[2024-05-22 17:20:57] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:20:57] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:20:59] [INFO ] Deduced a trap composed of 67 places in 1357 ms of which 11 ms to minimize.
[2024-05-22 17:21:00] [INFO ] Deduced a trap composed of 64 places in 1399 ms of which 12 ms to minimize.
[2024-05-22 17:21:02] [INFO ] Deduced a trap composed of 55 places in 1348 ms of which 11 ms to minimize.
[2024-05-22 17:21:03] [INFO ] Deduced a trap composed of 48 places in 1312 ms of which 10 ms to minimize.
[2024-05-22 17:21:04] [INFO ] Deduced a trap composed of 46 places in 1316 ms of which 10 ms to minimize.
[2024-05-22 17:21:06] [INFO ] Deduced a trap composed of 72 places in 1305 ms of which 10 ms to minimize.
[2024-05-22 17:21:07] [INFO ] Deduced a trap composed of 59 places in 1244 ms of which 10 ms to minimize.
[2024-05-22 17:21:08] [INFO ] Deduced a trap composed of 45 places in 1174 ms of which 10 ms to minimize.
[2024-05-22 17:21:09] [INFO ] Deduced a trap composed of 47 places in 1108 ms of which 9 ms to minimize.
[2024-05-22 17:21:10] [INFO ] Deduced a trap composed of 47 places in 1114 ms of which 9 ms to minimize.
[2024-05-22 17:21:12] [INFO ] Deduced a trap composed of 45 places in 1099 ms of which 10 ms to minimize.
[2024-05-22 17:21:13] [INFO ] Deduced a trap composed of 65 places in 1032 ms of which 9 ms to minimize.
[2024-05-22 17:21:14] [INFO ] Deduced a trap composed of 48 places in 1081 ms of which 9 ms to minimize.
[2024-05-22 17:21:15] [INFO ] Deduced a trap composed of 45 places in 1022 ms of which 8 ms to minimize.
[2024-05-22 17:21:16] [INFO ] Deduced a trap composed of 56 places in 934 ms of which 9 ms to minimize.
[2024-05-22 17:21:17] [INFO ] Deduced a trap composed of 53 places in 927 ms of which 8 ms to minimize.
[2024-05-22 17:21:18] [INFO ] Deduced a trap composed of 50 places in 984 ms of which 8 ms to minimize.
[2024-05-22 17:21:19] [INFO ] Deduced a trap composed of 47 places in 908 ms of which 8 ms to minimize.
[2024-05-22 17:21:20] [INFO ] Deduced a trap composed of 53 places in 936 ms of which 9 ms to minimize.
[2024-05-22 17:21:21] [INFO ] Deduced a trap composed of 49 places in 915 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:21:22] [INFO ] Deduced a trap composed of 68 places in 910 ms of which 8 ms to minimize.
[2024-05-22 17:21:22] [INFO ] Deduced a trap composed of 54 places in 798 ms of which 8 ms to minimize.
[2024-05-22 17:21:23] [INFO ] Deduced a trap composed of 49 places in 746 ms of which 8 ms to minimize.
[2024-05-22 17:21:24] [INFO ] Deduced a trap composed of 50 places in 777 ms of which 7 ms to minimize.
[2024-05-22 17:21:25] [INFO ] Deduced a trap composed of 51 places in 805 ms of which 7 ms to minimize.
[2024-05-22 17:21:26] [INFO ] Deduced a trap composed of 56 places in 768 ms of which 7 ms to minimize.
[2024-05-22 17:21:26] [INFO ] Deduced a trap composed of 48 places in 706 ms of which 7 ms to minimize.
[2024-05-22 17:21:27] [INFO ] Deduced a trap composed of 47 places in 716 ms of which 7 ms to minimize.
[2024-05-22 17:21:28] [INFO ] Deduced a trap composed of 48 places in 735 ms of which 7 ms to minimize.
[2024-05-22 17:21:29] [INFO ] Deduced a trap composed of 56 places in 633 ms of which 6 ms to minimize.
[2024-05-22 17:21:29] [INFO ] Deduced a trap composed of 57 places in 658 ms of which 6 ms to minimize.
[2024-05-22 17:21:30] [INFO ] Deduced a trap composed of 45 places in 670 ms of which 7 ms to minimize.
[2024-05-22 17:21:31] [INFO ] Deduced a trap composed of 55 places in 689 ms of which 6 ms to minimize.
[2024-05-22 17:21:31] [INFO ] Deduced a trap composed of 53 places in 729 ms of which 7 ms to minimize.
[2024-05-22 17:21:32] [INFO ] Deduced a trap composed of 48 places in 764 ms of which 7 ms to minimize.
[2024-05-22 17:21:33] [INFO ] Deduced a trap composed of 47 places in 755 ms of which 7 ms to minimize.
[2024-05-22 17:21:34] [INFO ] Deduced a trap composed of 49 places in 753 ms of which 7 ms to minimize.
[2024-05-22 17:21:35] [INFO ] Deduced a trap composed of 55 places in 726 ms of which 7 ms to minimize.
[2024-05-22 17:21:35] [INFO ] Deduced a trap composed of 48 places in 665 ms of which 6 ms to minimize.
[2024-05-22 17:21:36] [INFO ] Deduced a trap composed of 47 places in 664 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:21:37] [INFO ] Deduced a trap composed of 47 places in 653 ms of which 7 ms to minimize.
[2024-05-22 17:21:37] [INFO ] Deduced a trap composed of 46 places in 608 ms of which 7 ms to minimize.
[2024-05-22 17:21:38] [INFO ] Deduced a trap composed of 46 places in 622 ms of which 6 ms to minimize.
[2024-05-22 17:21:39] [INFO ] Deduced a trap composed of 46 places in 617 ms of which 7 ms to minimize.
[2024-05-22 17:21:39] [INFO ] Deduced a trap composed of 45 places in 629 ms of which 6 ms to minimize.
[2024-05-22 17:21:40] [INFO ] Deduced a trap composed of 57 places in 613 ms of which 6 ms to minimize.
[2024-05-22 17:21:41] [INFO ] Deduced a trap composed of 52 places in 661 ms of which 6 ms to minimize.
[2024-05-22 17:21:41] [INFO ] Deduced a trap composed of 50 places in 629 ms of which 6 ms to minimize.
[2024-05-22 17:21:42] [INFO ] Deduced a trap composed of 56 places in 635 ms of which 6 ms to minimize.
[2024-05-22 17:21:43] [INFO ] Deduced a trap composed of 52 places in 647 ms of which 7 ms to minimize.
SMT process timed out in 45715ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 171 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 170 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-22 17:21:43] [INFO ] Invariant cache hit.
[2024-05-22 17:21:45] [INFO ] Implicit Places using invariants in 1926 ms returned []
[2024-05-22 17:21:45] [INFO ] Invariant cache hit.
[2024-05-22 17:21:46] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-22 17:22:17] [INFO ] Performed 662/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:22:47] [INFO ] Performed 1733/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 17:22:50] [INFO ] Implicit Places using invariants and state equation in 65177 ms returned []
Implicit Place search using SMT with State Equation took 67105 ms to find 0 implicit places.
[2024-05-22 17:22:51] [INFO ] Redundant transitions in 486 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-22 17:22:51] [INFO ] Invariant cache hit.
[2024-05-22 17:22:51] [INFO ] State equation strengthened by 6396 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36032ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103861 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 304 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 183 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-22 17:23:27] [INFO ] Computed 42 invariants in 134 ms
[2024-05-22 17:23:29] [INFO ] Implicit Places using invariants in 1264 ms returned []
[2024-05-22 17:23:29] [INFO ] Invariant cache hit.
[2024-05-22 17:23:30] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:23:48] [INFO ] Implicit Places using invariants and state equation in 19117 ms returned []
Implicit Place search using SMT with State Equation took 20387 ms to find 0 implicit places.
[2024-05-22 17:23:48] [INFO ] Redundant transitions in 464 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-22 17:23:48] [INFO ] Invariant cache hit.
[2024-05-22 17:23:48] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34932ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34981ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56035 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (195 resets) in 630 ms. (63 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2024-05-22 17:24:24] [INFO ] Invariant cache hit.
[2024-05-22 17:24:24] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:24:24] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-22 17:24:24] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:24:26] [INFO ] Deduced a trap composed of 60 places in 1417 ms of which 12 ms to minimize.
[2024-05-22 17:24:27] [INFO ] Deduced a trap composed of 50 places in 1394 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6521/8364 variables, 1843/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8364 variables, 4757/6646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8364/8366 variables, and 6646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1762/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:24:29] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-22 17:24:29] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-22 17:24:29] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 17:24:29] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-22 17:24:29] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 0 ms to minimize.
[2024-05-22 17:24:29] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-22 17:24:29] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-22 17:24:30] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-22 17:24:30] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 17:24:30] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1765 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/1841 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1843 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:24:31] [INFO ] Deduced a trap composed of 69 places in 1380 ms of which 11 ms to minimize.
[2024-05-22 17:24:33] [INFO ] Deduced a trap composed of 57 places in 1289 ms of which 10 ms to minimize.
[2024-05-22 17:24:34] [INFO ] Deduced a trap composed of 48 places in 1328 ms of which 10 ms to minimize.
SMT process timed out in 10189ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 1 with 1640 rules applied. Total rules applied 1644 place count 1843 transition count 6519
Applied a total of 1644 rules in 447 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 447 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (215 resets) in 544 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 113026 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 1
Probabilistic random walk after 113026 steps, saw 29854 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-22 17:24:38] [INFO ] Computed 42 invariants in 151 ms
[2024-05-22 17:24:38] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:24:38] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:24:40] [INFO ] Deduced a trap composed of 67 places in 1403 ms of which 10 ms to minimize.
[2024-05-22 17:24:41] [INFO ] Deduced a trap composed of 64 places in 1339 ms of which 10 ms to minimize.
[2024-05-22 17:24:42] [INFO ] Deduced a trap composed of 55 places in 1288 ms of which 11 ms to minimize.
[2024-05-22 17:24:44] [INFO ] Deduced a trap composed of 48 places in 1238 ms of which 10 ms to minimize.
[2024-05-22 17:24:45] [INFO ] Deduced a trap composed of 46 places in 1369 ms of which 11 ms to minimize.
[2024-05-22 17:24:46] [INFO ] Deduced a trap composed of 72 places in 1278 ms of which 10 ms to minimize.
[2024-05-22 17:24:48] [INFO ] Deduced a trap composed of 59 places in 1190 ms of which 10 ms to minimize.
[2024-05-22 17:24:49] [INFO ] Deduced a trap composed of 45 places in 1124 ms of which 9 ms to minimize.
[2024-05-22 17:24:50] [INFO ] Deduced a trap composed of 47 places in 1090 ms of which 9 ms to minimize.
[2024-05-22 17:24:51] [INFO ] Deduced a trap composed of 47 places in 1124 ms of which 10 ms to minimize.
[2024-05-22 17:24:52] [INFO ] Deduced a trap composed of 45 places in 1057 ms of which 9 ms to minimize.
[2024-05-22 17:24:53] [INFO ] Deduced a trap composed of 65 places in 1081 ms of which 9 ms to minimize.
[2024-05-22 17:24:54] [INFO ] Deduced a trap composed of 48 places in 1057 ms of which 9 ms to minimize.
[2024-05-22 17:24:55] [INFO ] Deduced a trap composed of 45 places in 949 ms of which 9 ms to minimize.
[2024-05-22 17:24:56] [INFO ] Deduced a trap composed of 56 places in 933 ms of which 7 ms to minimize.
[2024-05-22 17:24:57] [INFO ] Deduced a trap composed of 53 places in 935 ms of which 8 ms to minimize.
[2024-05-22 17:24:58] [INFO ] Deduced a trap composed of 50 places in 983 ms of which 9 ms to minimize.
[2024-05-22 17:24:59] [INFO ] Deduced a trap composed of 47 places in 914 ms of which 8 ms to minimize.
[2024-05-22 17:25:00] [INFO ] Deduced a trap composed of 53 places in 945 ms of which 8 ms to minimize.
[2024-05-22 17:25:01] [INFO ] Deduced a trap composed of 49 places in 915 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:25:02] [INFO ] Deduced a trap composed of 68 places in 904 ms of which 7 ms to minimize.
[2024-05-22 17:25:03] [INFO ] Deduced a trap composed of 54 places in 853 ms of which 8 ms to minimize.
[2024-05-22 17:25:04] [INFO ] Deduced a trap composed of 49 places in 795 ms of which 7 ms to minimize.
[2024-05-22 17:25:04] [INFO ] Deduced a trap composed of 50 places in 748 ms of which 8 ms to minimize.
[2024-05-22 17:25:05] [INFO ] Deduced a trap composed of 51 places in 747 ms of which 7 ms to minimize.
[2024-05-22 17:25:06] [INFO ] Deduced a trap composed of 56 places in 742 ms of which 7 ms to minimize.
[2024-05-22 17:25:07] [INFO ] Deduced a trap composed of 48 places in 764 ms of which 8 ms to minimize.
[2024-05-22 17:25:08] [INFO ] Deduced a trap composed of 47 places in 740 ms of which 8 ms to minimize.
[2024-05-22 17:25:08] [INFO ] Deduced a trap composed of 48 places in 760 ms of which 7 ms to minimize.
[2024-05-22 17:25:09] [INFO ] Deduced a trap composed of 56 places in 721 ms of which 6 ms to minimize.
[2024-05-22 17:25:10] [INFO ] Deduced a trap composed of 57 places in 712 ms of which 7 ms to minimize.
[2024-05-22 17:25:11] [INFO ] Deduced a trap composed of 45 places in 699 ms of which 7 ms to minimize.
[2024-05-22 17:25:11] [INFO ] Deduced a trap composed of 55 places in 691 ms of which 7 ms to minimize.
[2024-05-22 17:25:12] [INFO ] Deduced a trap composed of 53 places in 759 ms of which 7 ms to minimize.
[2024-05-22 17:25:13] [INFO ] Deduced a trap composed of 48 places in 757 ms of which 7 ms to minimize.
[2024-05-22 17:25:14] [INFO ] Deduced a trap composed of 47 places in 677 ms of which 6 ms to minimize.
[2024-05-22 17:25:14] [INFO ] Deduced a trap composed of 49 places in 774 ms of which 7 ms to minimize.
[2024-05-22 17:25:15] [INFO ] Deduced a trap composed of 55 places in 675 ms of which 6 ms to minimize.
[2024-05-22 17:25:16] [INFO ] Deduced a trap composed of 48 places in 669 ms of which 6 ms to minimize.
[2024-05-22 17:25:17] [INFO ] Deduced a trap composed of 47 places in 655 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:25:17] [INFO ] Deduced a trap composed of 47 places in 660 ms of which 6 ms to minimize.
[2024-05-22 17:25:18] [INFO ] Deduced a trap composed of 46 places in 655 ms of which 7 ms to minimize.
[2024-05-22 17:25:19] [INFO ] Deduced a trap composed of 46 places in 662 ms of which 6 ms to minimize.
[2024-05-22 17:25:19] [INFO ] Deduced a trap composed of 46 places in 641 ms of which 6 ms to minimize.
[2024-05-22 17:25:20] [INFO ] Deduced a trap composed of 45 places in 653 ms of which 7 ms to minimize.
[2024-05-22 17:25:21] [INFO ] Deduced a trap composed of 57 places in 638 ms of which 6 ms to minimize.
[2024-05-22 17:25:21] [INFO ] Deduced a trap composed of 52 places in 664 ms of which 7 ms to minimize.
[2024-05-22 17:25:22] [INFO ] Deduced a trap composed of 50 places in 657 ms of which 7 ms to minimize.
[2024-05-22 17:25:23] [INFO ] Deduced a trap composed of 56 places in 668 ms of which 6 ms to minimize.
[2024-05-22 17:25:23] [INFO ] Deduced a trap composed of 52 places in 671 ms of which 6 ms to minimize.
SMT process timed out in 45835ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 164 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 158 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-22 17:25:24] [INFO ] Invariant cache hit.
[2024-05-22 17:25:26] [INFO ] Implicit Places using invariants in 1922 ms returned []
[2024-05-22 17:25:26] [INFO ] Invariant cache hit.
[2024-05-22 17:25:27] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-22 17:25:58] [INFO ] Performed 666/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:26:28] [INFO ] Performed 1656/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 17:26:33] [INFO ] Implicit Places using invariants and state equation in 67651 ms returned []
Implicit Place search using SMT with State Equation took 69575 ms to find 0 implicit places.
[2024-05-22 17:26:34] [INFO ] Redundant transitions in 483 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-22 17:26:34] [INFO ] Invariant cache hit.
[2024-05-22 17:26:34] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 35959ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36008ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106241 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 341 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 493 reset in 980 ms.
Product exploration explored 100000 steps with 487 reset in 1012 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 145 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-22 17:27:13] [INFO ] Computed 42 invariants in 140 ms
[2024-05-22 17:27:14] [INFO ] Implicit Places using invariants in 1361 ms returned []
[2024-05-22 17:27:14] [INFO ] Invariant cache hit.
[2024-05-22 17:27:16] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:27:34] [INFO ] Implicit Places using invariants and state equation in 19568 ms returned []
Implicit Place search using SMT with State Equation took 20930 ms to find 0 implicit places.
[2024-05-22 17:27:34] [INFO ] Redundant transitions in 454 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-22 17:27:34] [INFO ] Invariant cache hit.
[2024-05-22 17:27:34] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35450ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35510ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57058 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-13 finished in 500191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X((p1 U p2))||G(p3))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((p1 U p2)||p0)&&((p1 U p2)||X((!p3 U (p4||G(!p3)))))))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-040-LTLFireability-06
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 708 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-22 17:28:11] [INFO ] Computed 42 invariants in 137 ms
[2024-05-22 17:28:12] [INFO ] Implicit Places using invariants in 1306 ms returned []
[2024-05-22 17:28:13] [INFO ] Invariant cache hit.
[2024-05-22 17:28:14] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:28:29] [INFO ] Implicit Places using invariants and state equation in 16439 ms returned []
Implicit Place search using SMT with State Equation took 17746 ms to find 0 implicit places.
Running 6481 sub problems to find dead transitions.
[2024-05-22 17:28:29] [INFO ] Invariant cache hit.
[2024-05-22 17:28:29] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34816ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34866ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 53329 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-06
Product exploration explored 100000 steps with 33252 reset in 1202 ms.
Product exploration explored 100000 steps with 33434 reset in 1226 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 162 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 4 states, 27 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 40000 steps (195 resets) in 801 ms. (49 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
[2024-05-22 17:29:07] [INFO ] Invariant cache hit.
[2024-05-22 17:29:07] [INFO ] State equation strengthened by 4757 read => feed constraints.
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-22 17:29:08] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-22 17:29:10] [INFO ] Deduced a trap composed of 68 places in 1417 ms of which 11 ms to minimize.
[2024-05-22 17:29:11] [INFO ] Deduced a trap composed of 69 places in 1347 ms of which 10 ms to minimize.
[2024-05-22 17:29:12] [INFO ] Deduced a trap composed of 49 places in 1311 ms of which 11 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1843/8366 variables, and 46 constraints, problems are : Problem set: 6 solved, 4 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/1845 constraints, ReadFeed: 0/4757 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 6 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 3/46 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-22 17:29:14] [INFO ] Deduced a trap composed of 62 places in 1414 ms of which 10 ms to minimize.
[2024-05-22 17:29:16] [INFO ] Deduced a trap composed of 51 places in 1440 ms of which 11 ms to minimize.
[2024-05-22 17:29:17] [INFO ] Deduced a trap composed of 49 places in 1422 ms of which 12 ms to minimize.
[2024-05-22 17:29:19] [INFO ] Deduced a trap composed of 46 places in 1295 ms of which 11 ms to minimize.
SMT process timed out in 11301ms, After SMT, problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 471 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (214 resets) in 1689 ms. (23 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-22 17:29:20] [INFO ] Computed 42 invariants in 161 ms
[2024-05-22 17:29:20] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 17:29:20] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-22 17:29:20] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 17:29:22] [INFO ] Deduced a trap composed of 67 places in 1425 ms of which 10 ms to minimize.
[2024-05-22 17:29:24] [INFO ] Deduced a trap composed of 65 places in 1284 ms of which 10 ms to minimize.
[2024-05-22 17:29:25] [INFO ] Deduced a trap composed of 50 places in 1193 ms of which 11 ms to minimize.
[2024-05-22 17:29:26] [INFO ] Deduced a trap composed of 55 places in 1288 ms of which 10 ms to minimize.
[2024-05-22 17:29:27] [INFO ] Deduced a trap composed of 83 places in 1379 ms of which 11 ms to minimize.
[2024-05-22 17:29:29] [INFO ] Deduced a trap composed of 51 places in 1277 ms of which 10 ms to minimize.
[2024-05-22 17:29:30] [INFO ] Deduced a trap composed of 54 places in 1206 ms of which 9 ms to minimize.
[2024-05-22 17:29:31] [INFO ] Deduced a trap composed of 49 places in 1169 ms of which 10 ms to minimize.
[2024-05-22 17:29:32] [INFO ] Deduced a trap composed of 47 places in 1156 ms of which 10 ms to minimize.
[2024-05-22 17:29:34] [INFO ] Deduced a trap composed of 50 places in 1121 ms of which 10 ms to minimize.
[2024-05-22 17:29:35] [INFO ] Deduced a trap composed of 48 places in 1128 ms of which 10 ms to minimize.
[2024-05-22 17:29:36] [INFO ] Deduced a trap composed of 55 places in 1096 ms of which 10 ms to minimize.
[2024-05-22 17:29:37] [INFO ] Deduced a trap composed of 49 places in 1159 ms of which 9 ms to minimize.
[2024-05-22 17:29:38] [INFO ] Deduced a trap composed of 87 places in 1197 ms of which 10 ms to minimize.
[2024-05-22 17:29:39] [INFO ] Deduced a trap composed of 70 places in 1142 ms of which 9 ms to minimize.
[2024-05-22 17:29:41] [INFO ] Deduced a trap composed of 74 places in 1149 ms of which 9 ms to minimize.
[2024-05-22 17:29:42] [INFO ] Deduced a trap composed of 47 places in 1014 ms of which 9 ms to minimize.
[2024-05-22 17:29:43] [INFO ] Deduced a trap composed of 65 places in 1075 ms of which 9 ms to minimize.
[2024-05-22 17:29:44] [INFO ] Deduced a trap composed of 60 places in 1033 ms of which 9 ms to minimize.
[2024-05-22 17:29:45] [INFO ] Deduced a trap composed of 50 places in 1004 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 17:29:46] [INFO ] Deduced a trap composed of 55 places in 914 ms of which 8 ms to minimize.
[2024-05-22 17:29:47] [INFO ] Deduced a trap composed of 51 places in 1008 ms of which 8 ms to minimize.
[2024-05-22 17:29:48] [INFO ] Deduced a trap composed of 53 places in 1043 ms of which 9 ms to minimize.
[2024-05-22 17:29:49] [INFO ] Deduced a trap composed of 55 places in 960 ms of which 9 ms to minimize.
[2024-05-22 17:29:50] [INFO ] Deduced a trap composed of 62 places in 910 ms of which 8 ms to minimize.
[2024-05-22 17:29:51] [INFO ] Deduced a trap composed of 60 places in 1021 ms of which 8 ms to minimize.
[2024-05-22 17:29:52] [INFO ] Deduced a trap composed of 53 places in 978 ms of which 10 ms to minimize.
[2024-05-22 17:29:53] [INFO ] Deduced a trap composed of 55 places in 1013 ms of which 9 ms to minimize.
[2024-05-22 17:29:54] [INFO ] Deduced a trap composed of 52 places in 981 ms of which 9 ms to minimize.
[2024-05-22 17:29:55] [INFO ] Deduced a trap composed of 53 places in 957 ms of which 10 ms to minimize.
[2024-05-22 17:29:56] [INFO ] Deduced a trap composed of 51 places in 981 ms of which 9 ms to minimize.
[2024-05-22 17:29:57] [INFO ] Deduced a trap composed of 50 places in 960 ms of which 9 ms to minimize.
[2024-05-22 17:29:58] [INFO ] Deduced a trap composed of 67 places in 1025 ms of which 9 ms to minimize.
[2024-05-22 17:29:59] [INFO ] Deduced a trap composed of 54 places in 942 ms of which 8 ms to minimize.
[2024-05-22 17:30:00] [INFO ] Deduced a trap composed of 54 places in 926 ms of which 9 ms to minimize.
[2024-05-22 17:30:01] [INFO ] Deduced a trap composed of 57 places in 932 ms of which 9 ms to minimize.
[2024-05-22 17:30:02] [INFO ] Deduced a trap composed of 59 places in 930 ms of which 8 ms to minimize.
[2024-05-22 17:30:03] [INFO ] Deduced a trap composed of 59 places in 926 ms of which 9 ms to minimize.
[2024-05-22 17:30:04] [INFO ] Deduced a trap composed of 68 places in 882 ms of which 8 ms to minimize.
[2024-05-22 17:30:05] [INFO ] Deduced a trap composed of 50 places in 878 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 17:30:06] [INFO ] Deduced a trap composed of 62 places in 866 ms of which 8 ms to minimize.
SMT process timed out in 45836ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 167 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 1843/1843 places, 6519/6519 transitions.
RANDOM walk for 40000 steps (213 resets) in 1400 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 95362 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 3
Probabilistic random walk after 95362 steps, saw 26440 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2024-05-22 17:30:09] [INFO ] Invariant cache hit.
[2024-05-22 17:30:09] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 17:30:10] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-22 17:30:10] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 17:30:12] [INFO ] Deduced a trap composed of 67 places in 1421 ms of which 11 ms to minimize.
[2024-05-22 17:30:13] [INFO ] Deduced a trap composed of 50 places in 1413 ms of which 11 ms to minimize.
[2024-05-22 17:30:14] [INFO ] Deduced a trap composed of 57 places in 1437 ms of which 11 ms to minimize.
[2024-05-22 17:30:16] [INFO ] Deduced a trap composed of 54 places in 1386 ms of which 11 ms to minimize.
[2024-05-22 17:30:17] [INFO ] Deduced a trap composed of 45 places in 1390 ms of which 11 ms to minimize.
[2024-05-22 17:30:19] [INFO ] Deduced a trap composed of 46 places in 1389 ms of which 11 ms to minimize.
[2024-05-22 17:30:20] [INFO ] Deduced a trap composed of 45 places in 1383 ms of which 11 ms to minimize.
[2024-05-22 17:30:22] [INFO ] Deduced a trap composed of 45 places in 1383 ms of which 11 ms to minimize.
[2024-05-22 17:30:23] [INFO ] Deduced a trap composed of 45 places in 1399 ms of which 11 ms to minimize.
[2024-05-22 17:30:24] [INFO ] Deduced a trap composed of 49 places in 1394 ms of which 11 ms to minimize.
[2024-05-22 17:30:26] [INFO ] Deduced a trap composed of 49 places in 1367 ms of which 11 ms to minimize.
[2024-05-22 17:30:27] [INFO ] Deduced a trap composed of 48 places in 1383 ms of which 11 ms to minimize.
[2024-05-22 17:30:29] [INFO ] Deduced a trap composed of 59 places in 1341 ms of which 11 ms to minimize.
[2024-05-22 17:30:30] [INFO ] Deduced a trap composed of 59 places in 1251 ms of which 10 ms to minimize.
[2024-05-22 17:30:31] [INFO ] Deduced a trap composed of 50 places in 1218 ms of which 10 ms to minimize.
[2024-05-22 17:30:32] [INFO ] Deduced a trap composed of 51 places in 1216 ms of which 10 ms to minimize.
[2024-05-22 17:30:34] [INFO ] Deduced a trap composed of 50 places in 1264 ms of which 10 ms to minimize.
[2024-05-22 17:30:35] [INFO ] Deduced a trap composed of 48 places in 1253 ms of which 10 ms to minimize.
[2024-05-22 17:30:36] [INFO ] Deduced a trap composed of 48 places in 1259 ms of which 10 ms to minimize.
[2024-05-22 17:30:38] [INFO ] Deduced a trap composed of 50 places in 1247 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 17:30:39] [INFO ] Deduced a trap composed of 54 places in 1224 ms of which 10 ms to minimize.
[2024-05-22 17:30:40] [INFO ] Deduced a trap composed of 52 places in 1198 ms of which 11 ms to minimize.
[2024-05-22 17:30:41] [INFO ] Deduced a trap composed of 59 places in 1203 ms of which 10 ms to minimize.
[2024-05-22 17:30:42] [INFO ] Deduced a trap composed of 49 places in 1181 ms of which 10 ms to minimize.
[2024-05-22 17:30:44] [INFO ] Deduced a trap composed of 48 places in 1182 ms of which 9 ms to minimize.
[2024-05-22 17:30:45] [INFO ] Deduced a trap composed of 81 places in 1215 ms of which 10 ms to minimize.
[2024-05-22 17:30:46] [INFO ] Deduced a trap composed of 72 places in 1241 ms of which 10 ms to minimize.
[2024-05-22 17:30:47] [INFO ] Deduced a trap composed of 47 places in 1187 ms of which 10 ms to minimize.
[2024-05-22 17:30:49] [INFO ] Deduced a trap composed of 47 places in 1137 ms of which 9 ms to minimize.
[2024-05-22 17:30:50] [INFO ] Deduced a trap composed of 49 places in 1146 ms of which 10 ms to minimize.
[2024-05-22 17:30:51] [INFO ] Deduced a trap composed of 50 places in 1076 ms of which 9 ms to minimize.
[2024-05-22 17:30:52] [INFO ] Deduced a trap composed of 71 places in 1046 ms of which 9 ms to minimize.
[2024-05-22 17:30:53] [INFO ] Deduced a trap composed of 51 places in 1046 ms of which 8 ms to minimize.
[2024-05-22 17:30:54] [INFO ] Deduced a trap composed of 51 places in 1043 ms of which 8 ms to minimize.
[2024-05-22 17:30:55] [INFO ] Deduced a trap composed of 50 places in 1028 ms of which 9 ms to minimize.
[2024-05-22 17:30:56] [INFO ] Deduced a trap composed of 50 places in 1028 ms of which 9 ms to minimize.
[2024-05-22 17:30:57] [INFO ] Deduced a trap composed of 48 places in 1036 ms of which 9 ms to minimize.
[2024-05-22 17:30:58] [INFO ] Deduced a trap composed of 47 places in 1003 ms of which 8 ms to minimize.
[2024-05-22 17:30:59] [INFO ] Deduced a trap composed of 62 places in 1000 ms of which 9 ms to minimize.
[2024-05-22 17:31:00] [INFO ] Deduced a trap composed of 68 places in 1001 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 17:31:01] [INFO ] Deduced a trap composed of 52 places in 950 ms of which 9 ms to minimize.
[2024-05-22 17:31:02] [INFO ] Deduced a trap composed of 51 places in 982 ms of which 8 ms to minimize.
[2024-05-22 17:31:03] [INFO ] Deduced a trap composed of 65 places in 988 ms of which 8 ms to minimize.
[2024-05-22 17:31:04] [INFO ] Deduced a trap composed of 53 places in 960 ms of which 8 ms to minimize.
[2024-05-22 17:31:05] [INFO ] Deduced a trap composed of 63 places in 991 ms of which 9 ms to minimize.
[2024-05-22 17:31:06] [INFO ] Deduced a trap composed of 52 places in 986 ms of which 8 ms to minimize.
[2024-05-22 17:31:07] [INFO ] Deduced a trap composed of 45 places in 962 ms of which 8 ms to minimize.
[2024-05-22 17:31:08] [INFO ] Deduced a trap composed of 46 places in 944 ms of which 8 ms to minimize.
[2024-05-22 17:31:09] [INFO ] Deduced a trap composed of 48 places in 970 ms of which 8 ms to minimize.
[2024-05-22 17:31:10] [INFO ] Deduced a trap composed of 49 places in 957 ms of which 9 ms to minimize.
[2024-05-22 17:31:11] [INFO ] Deduced a trap composed of 46 places in 929 ms of which 8 ms to minimize.
[2024-05-22 17:31:12] [INFO ] Deduced a trap composed of 48 places in 984 ms of which 9 ms to minimize.
[2024-05-22 17:31:13] [INFO ] Deduced a trap composed of 50 places in 969 ms of which 9 ms to minimize.
[2024-05-22 17:31:14] [INFO ] Deduced a trap composed of 48 places in 964 ms of which 9 ms to minimize.
[2024-05-22 17:31:15] [INFO ] Deduced a trap composed of 48 places in 959 ms of which 8 ms to minimize.
[2024-05-22 17:31:16] [INFO ] Deduced a trap composed of 53 places in 1033 ms of which 11 ms to minimize.
[2024-05-22 17:31:17] [INFO ] Deduced a trap composed of 47 places in 1053 ms of which 10 ms to minimize.
[2024-05-22 17:31:19] [INFO ] Deduced a trap composed of 60 places in 1010 ms of which 8 ms to minimize.
[2024-05-22 17:31:20] [INFO ] Deduced a trap composed of 51 places in 978 ms of which 9 ms to minimize.
[2024-05-22 17:31:20] [INFO ] Deduced a trap composed of 60 places in 929 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 17:31:21] [INFO ] Deduced a trap composed of 47 places in 882 ms of which 8 ms to minimize.
[2024-05-22 17:31:22] [INFO ] Deduced a trap composed of 59 places in 910 ms of which 8 ms to minimize.
[2024-05-22 17:31:23] [INFO ] Deduced a trap composed of 46 places in 879 ms of which 7 ms to minimize.
[2024-05-22 17:31:24] [INFO ] Deduced a trap composed of 46 places in 879 ms of which 8 ms to minimize.
[2024-05-22 17:31:25] [INFO ] Deduced a trap composed of 62 places in 870 ms of which 8 ms to minimize.
SMT process timed out in 75901ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 161 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 163 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-22 17:31:25] [INFO ] Invariant cache hit.
[2024-05-22 17:31:27] [INFO ] Implicit Places using invariants in 1830 ms returned []
[2024-05-22 17:31:27] [INFO ] Invariant cache hit.
[2024-05-22 17:31:29] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-22 17:31:59] [INFO ] Performed 712/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:32:29] [INFO ] Performed 1658/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 17:32:35] [INFO ] Implicit Places using invariants and state equation in 67587 ms returned []
Implicit Place search using SMT with State Equation took 69419 ms to find 0 implicit places.
[2024-05-22 17:32:35] [INFO ] Redundant transitions in 499 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-22 17:32:35] [INFO ] Invariant cache hit.
[2024-05-22 17:32:36] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36258ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106418 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X p4), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (AND (NOT p2) p0 (NOT p1))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X p4)), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) p1 p2 (NOT p3) p4)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2)), (G (OR p0 p1 p2 (NOT p3) p4)), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p1) p2 (NOT p3) p4)), (G (OR (NOT p0) (NOT p1) p2 (NOT p3) p4))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p3 p4))), (F (NOT p4)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (AND (OR (NOT p1) p3 p4) (OR (NOT p2) p3 p4)))), (F p2), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 44 factoid took 384 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 143 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-22 17:33:13] [INFO ] Computed 42 invariants in 139 ms
[2024-05-22 17:33:14] [INFO ] Implicit Places using invariants in 1256 ms returned []
[2024-05-22 17:33:14] [INFO ] Invariant cache hit.
[2024-05-22 17:33:15] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-22 17:33:30] [INFO ] Implicit Places using invariants and state equation in 16163 ms returned []
Implicit Place search using SMT with State Equation took 17420 ms to find 0 implicit places.
[2024-05-22 17:33:30] [INFO ] Redundant transitions in 460 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-22 17:33:30] [INFO ] Invariant cache hit.
[2024-05-22 17:33:30] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35426ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35473ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53515 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT p2)), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT p3)), (X p4), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (OR p1 p2 (NOT p3) p4)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT p3))), (X (X p4)), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 145 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Reduction of identical properties reduced properties to check from 14 to 12
RANDOM walk for 40000 steps (197 resets) in 3331 ms. (12 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
[2024-05-22 17:34:07] [INFO ] Invariant cache hit.
[2024-05-22 17:34:07] [INFO ] State equation strengthened by 4757 read => feed constraints.
Problem apf5 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 17:34:08] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 17:34:10] [INFO ] Deduced a trap composed of 68 places in 1444 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6521/8364 variables, 1843/1887 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8364 variables, 4757/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 0/6644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6646 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 17:34:14] [INFO ] Deduced a trap composed of 49 places in 1412 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6521/8364 variables, 1843/1888 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8364 variables, 4757/6645 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8364 variables, 4/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8364 variables, 0/6649 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/8366 variables, 2/6651 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8366/8366 variables, and 6651 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 10090ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 487 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (215 resets) in 2197 ms. (18 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 93101 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 4
Probabilistic random walk after 93101 steps, saw 26131 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-22 17:34:22] [INFO ] Computed 42 invariants in 155 ms
[2024-05-22 17:34:22] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 17:34:22] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-22 17:34:22] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 17:34:24] [INFO ] Deduced a trap composed of 62 places in 1382 ms of which 11 ms to minimize.
[2024-05-22 17:34:26] [INFO ] Deduced a trap composed of 46 places in 1396 ms of which 11 ms to minimize.
[2024-05-22 17:34:27] [INFO ] Deduced a trap composed of 60 places in 1373 ms of which 10 ms to minimize.
[2024-05-22 17:34:28] [INFO ] Deduced a trap composed of 51 places in 1362 ms of which 11 ms to minimize.
[2024-05-22 17:34:30] [INFO ] Deduced a trap composed of 51 places in 1328 ms of which 11 ms to minimize.
[2024-05-22 17:34:31] [INFO ] Deduced a trap composed of 55 places in 1308 ms of which 10 ms to minimize.
[2024-05-22 17:34:33] [INFO ] Deduced a trap composed of 53 places in 1327 ms of which 10 ms to minimize.
[2024-05-22 17:34:34] [INFO ] Deduced a trap composed of 51 places in 1286 ms of which 11 ms to minimize.
[2024-05-22 17:34:35] [INFO ] Deduced a trap composed of 54 places in 1197 ms of which 10 ms to minimize.
[2024-05-22 17:34:36] [INFO ] Deduced a trap composed of 65 places in 1266 ms of which 10 ms to minimize.
[2024-05-22 17:34:38] [INFO ] Deduced a trap composed of 52 places in 1186 ms of which 10 ms to minimize.
[2024-05-22 17:34:39] [INFO ] Deduced a trap composed of 53 places in 1129 ms of which 10 ms to minimize.
[2024-05-22 17:34:40] [INFO ] Deduced a trap composed of 51 places in 1125 ms of which 10 ms to minimize.
[2024-05-22 17:34:41] [INFO ] Deduced a trap composed of 53 places in 1157 ms of which 10 ms to minimize.
[2024-05-22 17:34:42] [INFO ] Deduced a trap composed of 48 places in 1123 ms of which 10 ms to minimize.
[2024-05-22 17:34:43] [INFO ] Deduced a trap composed of 51 places in 1130 ms of which 10 ms to minimize.
[2024-05-22 17:34:45] [INFO ] Deduced a trap composed of 47 places in 1132 ms of which 9 ms to minimize.
[2024-05-22 17:34:46] [INFO ] Deduced a trap composed of 46 places in 1091 ms of which 9 ms to minimize.
[2024-05-22 17:34:47] [INFO ] Deduced a trap composed of 56 places in 1080 ms of which 10 ms to minimize.
[2024-05-22 17:34:48] [INFO ] Deduced a trap composed of 61 places in 1011 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 17:34:49] [INFO ] Deduced a trap composed of 55 places in 1045 ms of which 9 ms to minimize.
[2024-05-22 17:34:50] [INFO ] Deduced a trap composed of 64 places in 1039 ms of which 9 ms to minimize.
[2024-05-22 17:34:51] [INFO ] Deduced a trap composed of 57 places in 996 ms of which 9 ms to minimize.
[2024-05-22 17:34:52] [INFO ] Deduced a trap composed of 54 places in 1001 ms of which 8 ms to minimize.
[2024-05-22 17:34:53] [INFO ] Deduced a trap composed of 55 places in 976 ms of which 9 ms to minimize.
[2024-05-22 17:34:54] [INFO ] Deduced a trap composed of 56 places in 987 ms of which 9 ms to minimize.
[2024-05-22 17:34:55] [INFO ] Deduced a trap composed of 55 places in 978 ms of which 10 ms to minimize.
[2024-05-22 17:34:56] [INFO ] Deduced a trap composed of 56 places in 992 ms of which 8 ms to minimize.
[2024-05-22 17:34:57] [INFO ] Deduced a trap composed of 53 places in 971 ms of which 8 ms to minimize.
[2024-05-22 17:34:58] [INFO ] Deduced a trap composed of 56 places in 979 ms of which 9 ms to minimize.
[2024-05-22 17:34:59] [INFO ] Deduced a trap composed of 61 places in 985 ms of which 8 ms to minimize.
[2024-05-22 17:35:00] [INFO ] Deduced a trap composed of 47 places in 932 ms of which 8 ms to minimize.
[2024-05-22 17:35:01] [INFO ] Deduced a trap composed of 57 places in 965 ms of which 8 ms to minimize.
[2024-05-22 17:35:02] [INFO ] Deduced a trap composed of 63 places in 943 ms of which 8 ms to minimize.
[2024-05-22 17:35:03] [INFO ] Deduced a trap composed of 77 places in 908 ms of which 8 ms to minimize.
[2024-05-22 17:35:04] [INFO ] Deduced a trap composed of 54 places in 840 ms of which 9 ms to minimize.
[2024-05-22 17:35:05] [INFO ] Deduced a trap composed of 69 places in 918 ms of which 8 ms to minimize.
[2024-05-22 17:35:06] [INFO ] Deduced a trap composed of 52 places in 883 ms of which 8 ms to minimize.
[2024-05-22 17:35:07] [INFO ] Deduced a trap composed of 76 places in 836 ms of which 8 ms to minimize.
[2024-05-22 17:35:07] [INFO ] Deduced a trap composed of 49 places in 830 ms of which 8 ms to minimize.
SMT process timed out in 45736ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 166 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 161 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-22 17:35:08] [INFO ] Invariant cache hit.
[2024-05-22 17:35:10] [INFO ] Implicit Places using invariants in 1904 ms returned []
[2024-05-22 17:35:10] [INFO ] Invariant cache hit.
[2024-05-22 17:35:11] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-22 17:35:42] [INFO ] Performed 675/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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 LTLFireability -timeout 360 -rebuildPNML