Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067600507.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DoubleExponent-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067600507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748748190916

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 03:23:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 03:23:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 03:23:12] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2025-06-01 03:23:12] [INFO ] Transformed 5304 places.
[2025-06-01 03:23:12] [INFO ] Transformed 4998 transitions.
[2025-06-01 03:23:12] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-100-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5300 transition count 4998
Applied a total of 4 rules in 1057 ms. Remains 5300 /5304 variables (removed 4) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 03:23:14] [INFO ] Invariants computation overflowed in 232 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:23:16] [INFO ] Implicit Places using invariants in 2298 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 03:23:17] [INFO ] Invariants computation overflowed in 114 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:23:56] [INFO ] Performed 3/5300 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2025-06-01 03:24:26] [INFO ] Performed 148/5300 implicitness test of which 0 returned IMPLICIT in 66 seconds.
[2025-06-01 03:24:56] [INFO ] Performed 366/5300 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2025-06-01 03:25:27] [INFO ] Performed 543/5300 implicitness test of which 0 returned IMPLICIT in 127 seconds.
[2025-06-01 03:25:27] [INFO ] Timeout of Implicit test with SMT after 127 seconds.
[2025-06-01 03:25:27] [INFO ] Implicit Places using invariants and state equation in 130071 ms returned []
Implicit Place search using SMT with State Equation took 132409 ms to find 0 implicit places.
Running 4997 sub problems to find dead transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 03:25:27] [INFO ] Invariants computation overflowed in 103 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30103 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 4997/4997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4997 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30069 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 0/4997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62662ms problems are : Problem set: 0 solved, 4997 unsolved
Search for dead transitions found 0 dead transitions in 62722ms
Starting structural reductions in LTL mode, iteration 1 : 5300/5304 places, 4998/4998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196245 ms. Remains : 5300/5304 places, 4998/4998 transitions.
Support contains 48 out of 5300 places after structural reductions.
[2025-06-01 03:26:30] [INFO ] Flatten gal took : 289 ms
[2025-06-01 03:26:30] [INFO ] Flatten gal took : 195 ms
[2025-06-01 03:26:31] [INFO ] Input system was already deterministic with 4998 transitions.
RANDOM walk for 40000 steps (1308 resets) in 1538 ms. (25 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (114 resets) in 161 ms. (24 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (114 resets) in 62 ms. (63 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (114 resets) in 60 ms. (65 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (112 resets) in 114 ms. (34 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (112 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (115 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (117 resets) in 58 ms. (67 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (107 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (117 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (112 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (115 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (117 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (109 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (112 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (115 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (114 resets) in 28 ms. (137 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (114 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (105 resets) in 55 ms. (71 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (109 resets) in 45 ms. (86 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (113 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (106 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (119 resets) in 36 ms. (108 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (112 resets) in 52 ms. (75 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (114 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (111 resets) in 115 ms. (34 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (112 resets) in 43 ms. (90 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (108 resets) in 43 ms. (90 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (114 resets) in 48 ms. (81 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (112 resets) in 56 ms. (70 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (115 resets) in 48 ms. (81 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (109 resets) in 53 ms. (74 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (121 resets) in 49 ms. (80 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (111 resets) in 43 ms. (90 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (119 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 49823 steps, run timeout after 3005 ms. (steps per millisecond=16 ) properties seen :0 out of 34
Probabilistic random walk after 49823 steps, saw 24918 distinct states, run finished after 3010 ms. (steps per millisecond=16 ) properties seen :0
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 03:26:36] [INFO ] Invariants computation overflowed in 109 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 126/174 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 603/777 variables, 220/268 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/777 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 1394/2171 variables, 615/883 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2171 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1983/4154 variables, 980/1863 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4154 variables, 0/1863 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 2077/6231 variables, 1079/2942 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6231/10298 variables, and 2942 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5009 ms.
Refiners :[State Equation: 2942/5300 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 126/174 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 603/777 variables, 220/268 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/777 variables, 34/302 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 1394/2171 variables, 615/917 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2171 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1983/4154 variables, 980/1897 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4154/10298 variables, and 1897 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5006 ms.
Refiners :[State Equation: 1863/5300 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10185ms problems are : Problem set: 0 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.38 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1143 transitions
Trivial Post-agglo rules discarded 1143 transitions
Performed 1143 trivial Post agglomeration. Transition count delta: 1143
Iterating post reduction 0 with 1146 rules applied. Total rules applied 1147 place count 5297 transition count 3853
Reduce places removed 1143 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 1158 rules applied. Total rules applied 2305 place count 4154 transition count 3838
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 2320 place count 4139 transition count 3838
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 197 Pre rules applied. Total rules applied 2320 place count 4139 transition count 3641
Deduced a syphon composed of 197 places in 184 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 3 with 394 rules applied. Total rules applied 2714 place count 3942 transition count 3641
Performed 889 Post agglomeration using F-continuation condition.Transition count delta: 889
Deduced a syphon composed of 889 places in 151 ms
Reduce places removed 889 places and 0 transitions.
Iterating global reduction 3 with 1778 rules applied. Total rules applied 4492 place count 3053 transition count 2752
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 66 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4694 place count 2952 transition count 2752
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 56 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 4874 place count 2862 transition count 2752
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4875 place count 2862 transition count 2751
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4876 place count 2861 transition count 2751
Free-agglomeration rule (complex) applied 406 times.
Iterating global reduction 4 with 406 rules applied. Total rules applied 5282 place count 2861 transition count 2345
Reduce places removed 406 places and 0 transitions.
Iterating post reduction 4 with 406 rules applied. Total rules applied 5688 place count 2455 transition count 2345
Partial Free-agglomeration rule applied 407 times.
Drop transitions (Partial Free agglomeration) removed 407 transitions
Iterating global reduction 5 with 407 rules applied. Total rules applied 6095 place count 2455 transition count 2345
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6096 place count 2454 transition count 2344
Applied a total of 6096 rules in 2516 ms. Remains 2454 /5300 variables (removed 2846) and now considering 2344/4998 (removed 2654) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2526 ms. Remains : 2454/5300 places, 2344/4998 transitions.
RANDOM walk for 40000 steps (5156 resets) in 593 ms. (67 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (341 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (340 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (336 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (348 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (336 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (331 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (320 resets) in 48 ms. (81 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (336 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (349 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (321 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (328 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (328 resets) in 22 ms. (173 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (323 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (344 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (324 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (353 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (343 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (343 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (334 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (334 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (334 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (337 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (358 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (331 resets) in 22 ms. (173 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (351 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (332 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (348 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (338 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (351 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (347 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (336 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (345 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (335 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (335 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 83680 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 34
Probabilistic random walk after 83680 steps, saw 41853 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 2344 rows 2454 cols
[2025-06-01 03:26:52] [INFO ] Invariants computation overflowed in 55 ms
[2025-06-01 03:26:52] [INFO ] State equation strengthened by 385 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 174/222 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 1596/1818 variables, 506/558 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1818 variables, 66/624 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1818 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 2543/4361 variables, 1528/2152 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4361/4798 variables, and 2403 constraints, problems are : Problem set: 0 solved, 34 unsolved in 45034 ms.
Refiners :[State Equation: 2082/2454 constraints, ReadFeed: 321/385 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 174/222 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 1596/1818 variables, 506/558 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1818 variables, 66/624 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1818 variables, 34/658 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1818 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 2543/4361 variables, 1528/2186 constraints. Problems are: Problem set: 0 solved, 34 unsolved
SMT process timed out in 90153ms, After SMT, problems are : Problem set: 0 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 2454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2454/2454 places, 2344/2344 transitions.
Applied a total of 0 rules in 122 ms. Remains 2454 /2454 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 2454/2454 places, 2344/2344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2454/2454 places, 2344/2344 transitions.
Applied a total of 0 rules in 115 ms. Remains 2454 /2454 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
// Phase 1: matrix 2344 rows 2454 cols
[2025-06-01 03:28:23] [INFO ] Invariants computation overflowed in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:28:26] [INFO ] Implicit Places using invariants in 3524 ms returned []
// Phase 1: matrix 2344 rows 2454 cols
[2025-06-01 03:28:26] [INFO ] Invariants computation overflowed in 57 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:28:27] [INFO ] State equation strengthened by 385 read => feed constraints.
[2025-06-01 03:28:58] [INFO ] Performed 56/2454 implicitness test of which 4 returned IMPLICIT in 30 seconds.
[2025-06-01 03:29:28] [INFO ] Performed 252/2454 implicitness test of which 20 returned IMPLICIT in 60 seconds.
[2025-06-01 03:30:02] [INFO ] Performed 493/2454 implicitness test of which 36 returned IMPLICIT in 94 seconds.
[2025-06-01 03:30:43] [INFO ] Performed 547/2454 implicitness test of which 41 returned IMPLICIT in 135 seconds.
[2025-06-01 03:31:06] [INFO ] Implicit Places using invariants and state equation in 160093 ms returned [20, 26, 49, 56, 78, 83, 104, 110, 131, 136, 159, 165, 185, 187, 191, 212, 219, 240, 245, 249, 268, 274, 294, 300, 323, 329, 351, 357, 377, 404, 409, 430, 436, 459, 486, 493, 515, 520, 524, 541, 547, 568, 574]
[2025-06-01 03:31:06] [INFO ] Actually due to overlaps returned [493, 249, 26, 409, 20, 187, 404, 486]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 163636 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2446/2454 places, 2344/2344 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2446 transition count 2341
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 2443 transition count 2341
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 2443 transition count 2341
Applied a total of 8 rules in 328 ms. Remains 2443 /2446 variables (removed 3) and now considering 2341/2344 (removed 3) transitions.
// Phase 1: matrix 2341 rows 2443 cols
[2025-06-01 03:31:07] [INFO ] Invariants computation overflowed in 54 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:31:10] [INFO ] Implicit Places using invariants in 3470 ms returned []
// Phase 1: matrix 2341 rows 2443 cols
[2025-06-01 03:31:10] [INFO ] Invariants computation overflowed in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:31:11] [INFO ] State equation strengthened by 385 read => feed constraints.
[2025-06-01 03:31:41] [INFO ] Performed 87/2443 implicitness test of which 4 returned IMPLICIT in 30 seconds.
[2025-06-01 03:32:12] [INFO ] Performed 295/2443 implicitness test of which 20 returned IMPLICIT in 60 seconds.
[2025-06-01 03:33:14] [INFO ] Performed 419/2443 implicitness test of which 25 returned IMPLICIT in 122 seconds.
[2025-06-01 03:33:45] [INFO ] Performed 461/2443 implicitness test of which 28 returned IMPLICIT in 153 seconds.
[2025-06-01 03:33:50] [INFO ] Implicit Places using invariants and state equation in 160101 ms returned [47, 54, 76, 81, 102, 108, 129, 134, 157, 163, 183, 188, 209, 216, 237, 242, 263, 269, 289, 295, 318, 324, 346, 352, 372, 422, 428, 451]
[2025-06-01 03:33:50] [INFO ] Actually due to overlaps returned [54, 47, 422, 451, 428]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 163586 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2438/2454 places, 2341/2344 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2438 transition count 2339
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 2436 transition count 2339
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 2436 transition count 2339
Applied a total of 5 rules in 327 ms. Remains 2436 /2438 variables (removed 2) and now considering 2339/2341 (removed 2) transitions.
// Phase 1: matrix 2339 rows 2436 cols
[2025-06-01 03:33:50] [INFO ] Invariants computation overflowed in 60 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:33:54] [INFO ] Implicit Places using invariants in 3504 ms returned []
// Phase 1: matrix 2339 rows 2436 cols
[2025-06-01 03:33:54] [INFO ] Invariants computation overflowed in 57 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:33:55] [INFO ] State equation strengthened by 385 read => feed constraints.
[2025-06-01 03:35:23] [INFO ] Performed 78/2436 implicitness test of which 2 returned IMPLICIT in 87 seconds.
[2025-06-01 03:35:53] [INFO ] Performed 286/2436 implicitness test of which 17 returned IMPLICIT in 117 seconds.
[2025-06-01 03:36:24] [INFO ] Performed 456/2436 implicitness test of which 23 returned IMPLICIT in 149 seconds.
[2025-06-01 03:36:34] [INFO ] Implicit Places using invariants and state equation in 160112 ms returned [73, 78, 99, 105, 126, 131, 154, 160, 180, 185, 206, 213, 234, 239, 260, 266, 286, 292, 315, 321, 343, 349, 369]
[2025-06-01 03:36:34] [INFO ] Actually due to overlaps returned [78, 73]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 163622 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2434/2454 places, 2339/2344 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2434 transition count 2338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2433 transition count 2338
Applied a total of 2 rules in 209 ms. Remains 2433 /2434 variables (removed 1) and now considering 2338/2339 (removed 1) transitions.
// Phase 1: matrix 2338 rows 2433 cols
[2025-06-01 03:36:34] [INFO ] Invariants computation overflowed in 53 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:36:37] [INFO ] Implicit Places using invariants in 3253 ms returned []
// Phase 1: matrix 2338 rows 2433 cols
[2025-06-01 03:36:38] [INFO ] Invariants computation overflowed in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:36:39] [INFO ] State equation strengthened by 385 read => feed constraints.
[2025-06-01 03:37:09] [INFO ] Performed 57/2433 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 03:37:40] [INFO ] Performed 263/2433 implicitness test of which 14 returned IMPLICIT in 60 seconds.
[2025-06-01 03:38:17] [INFO ] Performed 440/2433 implicitness test of which 21 returned IMPLICIT in 98 seconds.
[2025-06-01 03:39:18] [INFO ] Implicit Places using invariants and state equation in 160094 ms returned [96, 102, 123, 128, 151, 157, 177, 182, 203, 210, 231, 236, 257, 263, 283, 289, 312, 318, 340, 346, 366, 494]
[2025-06-01 03:39:18] [INFO ] Actually due to overlaps returned [102, 96, 494]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 163356 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 2430/2454 places, 2338/2344 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2430 transition count 2337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2429 transition count 2337
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 2429 transition count 2337
Applied a total of 3 rules in 318 ms. Remains 2429 /2430 variables (removed 1) and now considering 2337/2338 (removed 1) transitions.
// Phase 1: matrix 2337 rows 2429 cols
[2025-06-01 03:39:18] [INFO ] Invariants computation overflowed in 62 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:39:21] [INFO ] Implicit Places using invariants in 3196 ms returned []
// Phase 1: matrix 2337 rows 2429 cols
[2025-06-01 03:39:21] [INFO ] Invariants computation overflowed in 57 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:39:22] [INFO ] State equation strengthened by 385 read => feed constraints.
[2025-06-01 03:39:58] [INFO ] Performed 5/2429 implicitness test of which 0 returned IMPLICIT in 35 seconds.
[2025-06-01 03:40:33] [INFO ] Performed 7/2429 implicitness test of which 0 returned IMPLICIT in 70 seconds.
[2025-06-01 03:42:01] [INFO ] Performed 125/2429 implicitness test of which 2 returned IMPLICIT in 158 seconds.
[2025-06-01 03:42:01] [INFO ] Implicit Places using invariants and state equation in 160117 ms returned [120, 125]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 163320 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 2427/2454 places, 2337/2344 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2427 transition count 2336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2426 transition count 2336
Applied a total of 2 rules in 206 ms. Remains 2426 /2427 variables (removed 1) and now considering 2336/2337 (removed 1) transitions.
// Phase 1: matrix 2336 rows 2426 cols
[2025-06-01 03:42:01] [INFO ] Invariants computation overflowed in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:42:05] [INFO ] Implicit Places using invariants in 3235 ms returned []
// Phase 1: matrix 2336 rows 2426 cols
[2025-06-01 03:42:05] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:42:06] [INFO ] State equation strengthened by 385 read => feed constraints.
[2025-06-01 03:44:45] [INFO ] Performed 145/2426 implicitness test of which 1 returned IMPLICIT in 158 seconds.
[2025-06-01 03:44:45] [INFO ] Implicit Places using invariants and state equation in 160105 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 163347 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 2425/2454 places, 2336/2344 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2425 transition count 2336
Applied a total of 1 rules in 199 ms. Remains 2425 /2425 variables (removed 0) and now considering 2336/2336 (removed 0) transitions.
// Phase 1: matrix 2336 rows 2425 cols
[2025-06-01 03:44:45] [INFO ] Invariants computation overflowed in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:44:48] [INFO ] Implicit Places using invariants in 3253 ms returned []
// Phase 1: matrix 2336 rows 2425 cols
[2025-06-01 03:44:48] [INFO ] Invariants computation overflowed in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:44:49] [INFO ] State equation strengthened by 385 read => feed constraints.
[2025-06-01 03:45:22] [INFO ] Performed 57/2425 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2025-06-01 03:46:58] [INFO ] Performed 150/2425 implicitness test of which 1 returned IMPLICIT in 128 seconds.
[2025-06-01 03:47:28] [INFO ] Performed 359/2425 implicitness test of which 16 returned IMPLICIT in 158 seconds.
[2025-06-01 03:47:28] [INFO ] Implicit Places using invariants and state equation in 160094 ms returned [150, 170, 175, 196, 203, 224, 229, 250, 256, 276, 282, 305, 311, 333, 339, 359]
[2025-06-01 03:47:28] [INFO ] Actually due to overlaps returned [150]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 163356 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 2424/2454 places, 2336/2344 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2424 transition count 2335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2423 transition count 2335
Applied a total of 2 rules in 208 ms. Remains 2423 /2424 variables (removed 1) and now considering 2335/2336 (removed 1) transitions.
// Phase 1: matrix 2335 rows 2423 cols
[2025-06-01 03:47:29] [INFO ] Invariants computation overflowed in 75 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:47:32] [INFO ] Implicit Places using invariants in 3132 ms returned []
// Phase 1: matrix 2335 rows 2423 cols
[2025-06-01 03:47:32] [INFO ] Invariants computation overflowed in 70 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:47:33] [INFO ] State equation strengthened by 385 read => feed constraints.
[2025-06-01 03:48:09] [INFO ] Performed 31/2423 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2025-06-01 03:50:12] [INFO ] Implicit Places using invariants and state equation in 160105 ms returned []
Implicit Place search using SMT with State Equation took 163241 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 2423/2454 places, 2335/2344 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 1309378 ms. Remains : 2423/2454 places, 2335/2344 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.29 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0||X(p1)) U X(p2)))&&(G(p0) U p1)))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 705 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 03:50:13] [INFO ] Invariants computation overflowed in 107 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:50:15] [INFO ] Implicit Places using invariants in 1852 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 03:50:15] [INFO ] Invariants computation overflowed in 98 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:50:54] [INFO ] Performed 3/5300 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2025-06-01 03:51:24] [INFO ] Performed 161/5300 implicitness test of which 0 returned IMPLICIT in 66 seconds.
[2025-06-01 03:51:54] [INFO ] Performed 401/5300 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2025-06-01 03:52:25] [INFO ] Performed 596/5300 implicitness test of which 0 returned IMPLICIT in 127 seconds.
[2025-06-01 03:52:25] [INFO ] Timeout of Implicit test with SMT after 127 seconds.
[2025-06-01 03:52:25] [INFO ] Implicit Places using invariants and state equation in 130082 ms returned []
Implicit Place search using SMT with State Equation took 131937 ms to find 0 implicit places.
Running 4997 sub problems to find dead transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 03:52:25] [INFO ] Invariants computation overflowed in 101 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30060 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 4997/4997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4997 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30062 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 0/4997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62239ms problems are : Problem set: 0 solved, 4997 unsolved
Search for dead transitions found 0 dead transitions in 62252ms
Finished structural reductions in LTL mode , in 1 iterations and 194914 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-00
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 3 ms.
FORMULA DoubleExponent-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLCardinality-00 finished in 195726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((p1||G(!p0)))) U (G((p0||X((p1||G(!p0)))))||((p0||X((p1||G(!p0))))&&G(!p2)))))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 760 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 03:53:28] [INFO ] Invariants computation overflowed in 104 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:53:30] [INFO ] Implicit Places using invariants in 1899 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 03:53:30] [INFO ] Invariants computation overflowed in 109 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:54:09] [INFO ] Performed 3/5300 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2025-06-01 03:54:39] [INFO ] Performed 146/5300 implicitness test of which 0 returned IMPLICIT in 66 seconds.
[2025-06-01 03:55:10] [INFO ] Performed 364/5300 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2025-06-01 03:55:41] [INFO ] Performed 542/5300 implicitness test of which 0 returned IMPLICIT in 127 seconds.
[2025-06-01 03:55:41] [INFO ] Timeout of Implicit test with SMT after 127 seconds.
[2025-06-01 03:55:41] [INFO ] Implicit Places using invariants and state equation in 130491 ms returned []
Implicit Place search using SMT with State Equation took 132393 ms to find 0 implicit places.
Running 4997 sub problems to find dead transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 03:55:41] [INFO ] Invariants computation overflowed in 127 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30071 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 4997/4997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4997 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30064 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 0/4997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62387ms problems are : Problem set: 0 solved, 4997 unsolved
Search for dead transitions found 0 dead transitions in 62399ms
Finished structural reductions in LTL mode , in 1 iterations and 195570 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 276 ms :[false, (AND p0 (NOT p1)), false, true, p0, (AND p0 p2 (NOT p1)), p2, (AND p0 p2 p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-01
Product exploration explored 100000 steps with 3283 reset in 357 ms.
Product exploration explored 100000 steps with 3302 reset in 303 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 141 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[false, (AND p0 (NOT p1)), false, true, p0, (AND p0 p2 (NOT p1)), p2, (AND p0 p2 p1)]
Reduction of identical properties reduced properties to check from 15 to 13
RANDOM walk for 40000 steps (1331 resets) in 304 ms. (131 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1103 resets) in 233 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1133 resets) in 288 ms. (138 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1130 resets) in 225 ms. (177 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1152 resets) in 243 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1135 resets) in 278 ms. (143 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1109 resets) in 214 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1147 resets) in 244 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1118 resets) in 191 ms. (208 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1113 resets) in 193 ms. (206 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1121 resets) in 276 ms. (144 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1102 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1127 resets) in 193 ms. (206 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1162 resets) in 231 ms. (172 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 48165 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 13
Probabilistic random walk after 48165 steps, saw 24091 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 03:56:50] [INFO ] Invariants computation overflowed in 111 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf5 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 61/80 variables, 24/29 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 154/234 variables, 59/88 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/88 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 266/500 variables, 129/217 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/217 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 363/863 variables, 167/384 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/863 variables, 0/384 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 450/1313 variables, 235/619 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1313 variables, 0/619 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 406/1719 variables, 215/834 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1719 variables, 0/834 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 420/2139 variables, 206/1040 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2139 variables, 0/1040 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 467/2606 variables, 245/1285 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2606 variables, 0/1285 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 427/3033 variables, 216/1501 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3033 variables, 0/1501 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 462/3495 variables, 245/1746 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3495 variables, 0/1746 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 359/3854 variables, 192/1938 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3854 variables, 0/1938 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 340/4194 variables, 179/2117 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4194 variables, 0/2117 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 283/4477 variables, 152/2269 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4477 variables, 0/2269 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 261/4738 variables, 136/2405 constraints. Problems are: Problem set: 3 solved, 10 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 4738/10298 variables, and 2405 constraints, problems are : Problem set: 3 solved, 10 unsolved in 5013 ms.
Refiners :[State Equation: 2405/5300 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 61/80 variables, 24/29 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 10/39 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/39 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 154/234 variables, 59/98 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/98 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 266/500 variables, 129/227 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/227 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 363/863 variables, 167/394 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/863 variables, 0/394 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 450/1313 variables, 235/629 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1313 variables, 0/629 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 406/1719 variables, 215/844 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/844 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 420/2139 variables, 206/1050 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:58] [INFO ] Deduced a trap along path composed of 16 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:58] [INFO ] Deduced a trap along path composed of 17 places in 53 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:58] [INFO ] Deduced a trap along path composed of 33 places in 51 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2139 variables, 3/1053 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2139 variables, 0/1053 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 467/2606 variables, 245/1298 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:00] [INFO ] Deduced a trap along path composed of 6 places in 96 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:00] [INFO ] Deduced a trap along path composed of 22 places in 92 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:00] [INFO ] Deduced a trap along path composed of 16 places in 103 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:00] [INFO ] Deduced a trap along path composed of 19 places in 100 ms of which 3 ms to minimize.
SMT process timed out in 10213ms, After SMT, problems are : Problem set: 3 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1198 place count 5297 transition count 3802
Reduce places removed 1194 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2394 place count 4103 transition count 3800
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2396 place count 4101 transition count 3800
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3601
Deduced a syphon composed of 199 places in 164 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 2794 place count 3902 transition count 3601
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 60 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4600 place count 2999 transition count 2698
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 59 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4802 place count 2898 transition count 2698
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 43 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 4992 place count 2803 transition count 2698
Free-agglomeration rule (complex) applied 401 times.
Iterating global reduction 3 with 401 rules applied. Total rules applied 5393 place count 2803 transition count 2297
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 3 with 401 rules applied. Total rules applied 5794 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions (Partial Free agglomeration) removed 400 transitions
Iterating global reduction 4 with 400 rules applied. Total rules applied 6194 place count 2402 transition count 2297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 2401 transition count 2296
Applied a total of 6195 rules in 1611 ms. Remains 2401 /5300 variables (removed 2899) and now considering 2296/4998 (removed 2702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1613 ms. Remains : 2401/5300 places, 2296/4998 transitions.
RANDOM walk for 40000 steps (5109 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (3345 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3305 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3356 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (3334 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (3407 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3440 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3406 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3361 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3394 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (3383 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 87919 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 10
Probabilistic random walk after 87919 steps, saw 43967 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 2296 rows 2401 cols
[2025-06-01 03:57:05] [INFO ] Invariants computation overflowed in 41 ms
[2025-06-01 03:57:05] [INFO ] State equation strengthened by 395 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
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) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 877/902 variables, 187/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2720/3622 variables, 1353/1549 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3622 variables, 209/1758 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3622 variables, 0/1758 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4697/4697 variables, and 2614 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45043 ms.
Refiners :[State Equation: 2401/2401 constraints, ReadFeed: 213/395 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 877/902 variables, 187/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 10/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2720/3622 variables, 1353/1559 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3622/4697 variables, and 1768 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45024 ms.
Refiners :[State Equation: 1545/2401 constraints, ReadFeed: 213/395 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90143ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2296/2296 transitions.
Applied a total of 0 rules in 191 ms. Remains 2401 /2401 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 2401/2401 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2296/2296 transitions.
Applied a total of 0 rules in 182 ms. Remains 2401 /2401 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2401 cols
[2025-06-01 03:58:36] [INFO ] Invariants computation overflowed in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:58:58] [INFO ] Implicit Places using invariants in 22525 ms returned []
// Phase 1: matrix 2296 rows 2401 cols
[2025-06-01 03:58:58] [INFO ] Invariants computation overflowed in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:59:00] [INFO ] State equation strengthened by 395 read => feed constraints.
[2025-06-01 04:00:15] [INFO ] Performed 25/2401 implicitness test of which 2 returned IMPLICIT in 74 seconds.
[2025-06-01 04:01:19] [INFO ] Performed 54/2401 implicitness test of which 4 returned IMPLICIT in 138 seconds.
[2025-06-01 04:01:38] [INFO ] Implicit Places using invariants and state equation in 160096 ms returned [19, 25, 47, 54, 76, 81]
[2025-06-01 04:01:38] [INFO ] Actually due to overlaps returned [25, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 182634 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2399/2401 places, 2296/2296 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2399 transition count 2295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2398 transition count 2295
Applied a total of 2 rules in 379 ms. Remains 2398 /2399 variables (removed 1) and now considering 2295/2296 (removed 1) transitions.
// Phase 1: matrix 2295 rows 2398 cols
[2025-06-01 04:01:39] [INFO ] Invariants computation overflowed in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:02:02] [INFO ] Implicit Places using invariants in 22908 ms returned []
// Phase 1: matrix 2295 rows 2398 cols
[2025-06-01 04:02:02] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:02:03] [INFO ] State equation strengthened by 395 read => feed constraints.
[2025-06-01 04:02:37] [INFO ] Performed 7/2398 implicitness test of which 0 returned IMPLICIT in 33 seconds.
[2025-06-01 04:04:04] [INFO ] Performed 8/2398 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2025-06-01 04:04:04] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2025-06-01 04:04:04] [INFO ] Implicit Places using invariants and state equation in 122799 ms returned []
Implicit Place search using SMT with State Equation took 145712 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2398/2401 places, 2295/2296 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 328907 ms. Remains : 2398/2401 places, 2295/2296 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (OR (NOT p2) p0 p1)), (G (OR (NOT p2) p0)), (G (OR (NOT p2) p0 (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 122 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[false, (AND p0 (NOT p1)), (AND p2 (NOT p0) (NOT p1)), true, p0, (AND (NOT p1) p2), p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 285 ms :[false, (AND p0 (NOT p1)), (AND p2 (NOT p0) (NOT p1)), true, p0, (AND (NOT p1) p2), p2, (AND p1 p2)]
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 696 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 04:04:06] [INFO ] Invariants computation overflowed in 105 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:04:08] [INFO ] Implicit Places using invariants in 1792 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 04:04:08] [INFO ] Invariants computation overflowed in 99 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:04:48] [INFO ] Performed 3/5300 implicitness test of which 0 returned IMPLICIT in 37 seconds.
[2025-06-01 04:05:18] [INFO ] Performed 136/5300 implicitness test of which 0 returned IMPLICIT in 67 seconds.
[2025-06-01 04:05:48] [INFO ] Performed 344/5300 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2025-06-01 04:06:18] [INFO ] Performed 537/5300 implicitness test of which 0 returned IMPLICIT in 127 seconds.
[2025-06-01 04:06:18] [INFO ] Timeout of Implicit test with SMT after 127 seconds.
[2025-06-01 04:06:18] [INFO ] Implicit Places using invariants and state equation in 130591 ms returned []
Implicit Place search using SMT with State Equation took 132401 ms to find 0 implicit places.
Running 4997 sub problems to find dead transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 04:06:18] [INFO ] Invariants computation overflowed in 100 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30074 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 4997/4997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4997 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30059 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 0/4997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62221ms problems are : Problem set: 0 solved, 4997 unsolved
Search for dead transitions found 0 dead transitions in 62230ms
Finished structural reductions in LTL mode , in 1 iterations and 195337 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 158 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[false, (AND p0 (NOT p1)), (AND p2 (NOT p0) (NOT p1)), true, p0, (AND (NOT p1) p2), p2, (AND p1 p2)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (1328 resets) in 219 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1130 resets) in 317 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1139 resets) in 218 ms. (182 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1123 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1111 resets) in 239 ms. (166 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1121 resets) in 237 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1143 resets) in 236 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1146 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1135 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1123 resets) in 295 ms. (135 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1154 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 50005 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 10
Probabilistic random walk after 50005 steps, saw 25009 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 04:07:26] [INFO ] Invariants computation overflowed in 99 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
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) 14/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 61/80 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 154/234 variables, 59/88 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 266/500 variables, 129/217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 363/863 variables, 167/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/863 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 450/1313 variables, 235/619 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1313 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 406/1719 variables, 215/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1719 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 420/2139 variables, 206/1040 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2139 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 467/2606 variables, 245/1285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2606 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 427/3033 variables, 216/1501 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3033 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 462/3495 variables, 245/1746 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3495 variables, 0/1746 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 359/3854 variables, 192/1938 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3854 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 340/4194 variables, 179/2117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4194 variables, 0/2117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 283/4477 variables, 152/2269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4477 variables, 0/2269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4738/10298 variables, and 2405 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5018 ms.
Refiners :[State Equation: 2405/5300 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 14/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 61/80 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 154/234 variables, 59/98 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 266/500 variables, 129/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 363/863 variables, 167/394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/863 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 450/1313 variables, 235/629 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1313 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 406/1719 variables, 215/844 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 420/2139 variables, 206/1050 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:07:34] [INFO ] Deduced a trap along path composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2139 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2139 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 467/2606 variables, 245/1296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:07:36] [INFO ] Deduced a trap along path composed of 9 places in 87 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:07:36] [INFO ] Deduced a trap along path composed of 6 places in 78 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:07:36] [INFO ] Deduced a trap along path composed of 17 places in 84 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:07:36] [INFO ] Deduced a trap along path composed of 16 places in 85 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:07:36] [INFO ] Deduced a trap along path composed of 16 places in 77 ms of which 2 ms to minimize.
SMT process timed out in 10170ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1198 place count 5297 transition count 3802
Reduce places removed 1194 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2394 place count 4103 transition count 3800
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2396 place count 4101 transition count 3800
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3601
Deduced a syphon composed of 199 places in 174 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 2794 place count 3902 transition count 3601
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 64 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4600 place count 2999 transition count 2698
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 56 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4802 place count 2898 transition count 2698
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 54 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 4992 place count 2803 transition count 2698
Free-agglomeration rule (complex) applied 401 times.
Iterating global reduction 3 with 401 rules applied. Total rules applied 5393 place count 2803 transition count 2297
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 3 with 401 rules applied. Total rules applied 5794 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions (Partial Free agglomeration) removed 400 transitions
Iterating global reduction 4 with 400 rules applied. Total rules applied 6194 place count 2402 transition count 2297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 2401 transition count 2296
Applied a total of 6195 rules in 1593 ms. Remains 2401 /5300 variables (removed 2899) and now considering 2296/4998 (removed 2702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1594 ms. Remains : 2401/5300 places, 2296/4998 transitions.
RANDOM walk for 40000 steps (5114 resets) in 255 ms. (156 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (3369 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (3355 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (3351 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3447 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3320 resets) in 213 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (3423 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (3447 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3441 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (3377 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3357 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 87660 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 10
Probabilistic random walk after 87660 steps, saw 43838 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 2296 rows 2401 cols
[2025-06-01 04:07:42] [INFO ] Invariants computation overflowed in 41 ms
[2025-06-01 04:07:42] [INFO ] State equation strengthened by 395 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
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) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 877/902 variables, 187/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2720/3622 variables, 1353/1549 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3622 variables, 209/1758 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3622 variables, 0/1758 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem apf1 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4697/4697 variables, and 2614 constraints, problems are : Problem set: 1 solved, 9 unsolved in 45045 ms.
Refiners :[State Equation: 2401/2401 constraints, ReadFeed: 213/395 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 877/902 variables, 187/193 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 3/196 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 9/205 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2720/3622 variables, 1353/1558 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3622 variables, 209/1767 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:09:08] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:09:08] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:09:09] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:09:09] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:09:09] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:09:09] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:09:09] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:09:10] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:09:10] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3622 variables, 0/1767 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4697/4697 variables, and 2623 constraints, problems are : Problem set: 1 solved, 9 unsolved in 45030 ms.
Refiners :[State Equation: 2401/2401 constraints, ReadFeed: 213/395 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/9 constraints]
After SMT, in 90148ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2296/2296 transitions.
Applied a total of 0 rules in 191 ms. Remains 2401 /2401 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 2401/2401 places, 2296/2296 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 124 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[false, (AND p0 (NOT p1)), (AND p2 (NOT p0) (NOT p1)), true, p0, (AND (NOT p1) p2), p2, p2]
Stuttering acceptance computed with spot in 255 ms :[false, (AND p0 (NOT p1)), (AND p2 (NOT p0) (NOT p1)), true, p0, (AND (NOT p1) p2), p2, p2]
Stuttering acceptance computed with spot in 282 ms :[false, (AND p0 (NOT p1)), (AND p2 (NOT p0) (NOT p1)), true, p0, (AND (NOT p1) p2), p2, p2]
Product exploration explored 100000 steps with 3348 reset in 300 ms.
Product exploration explored 100000 steps with 3350 reset in 282 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 244 ms :[false, (AND p0 (NOT p1)), (AND p2 (NOT p0) (NOT p1)), true, p0, (AND (NOT p1) p2), p2, p2]
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1194 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 5300 transition count 4998
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 1194 place count 5300 transition count 5196
Deduced a syphon composed of 1394 places in 235 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 1394 place count 5300 transition count 5196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1396 place count 5298 transition count 5194
Deduced a syphon composed of 1392 places in 201 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1398 place count 5298 transition count 5194
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: -201
Deduced a syphon composed of 2292 places in 137 ms
Iterating global reduction 1 with 900 rules applied. Total rules applied 2298 place count 5298 transition count 5395
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2299 place count 5297 transition count 5394
Deduced a syphon composed of 2291 places in 137 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2300 place count 5297 transition count 5394
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -664
Deduced a syphon composed of 2392 places in 124 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2401 place count 5297 transition count 6058
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2502 place count 5196 transition count 5856
Deduced a syphon composed of 2291 places in 122 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2603 place count 5196 transition count 5856
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -620
Deduced a syphon composed of 2388 places in 132 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 2700 place count 5196 transition count 6476
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 2797 place count 5099 transition count 6282
Deduced a syphon composed of 2291 places in 116 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 2894 place count 5099 transition count 6282
Deduced a syphon composed of 2291 places in 117 ms
Applied a total of 2894 rules in 4451 ms. Remains 5099 /5300 variables (removed 201) and now considering 6282/4998 (removed -1284) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 04:09:19] [INFO ] Redundant transitions in 523 ms returned []
Running 6281 sub problems to find dead transitions.
// Phase 1: matrix 6282 rows 5099 cols
[2025-06-01 04:09:19] [INFO ] Invariants computation overflowed in 233 ms
[2025-06-01 04:09:19] [INFO ] State equation strengthened by 200 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5098/11381 variables, and 0 constraints, problems are : Problem set: 0 solved, 6281 unsolved in 30081 ms.
Refiners :[State Equation: 0/5099 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 6281/6281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5098/11381 variables, and 0 constraints, problems are : Problem set: 0 solved, 6281 unsolved in 30071 ms.
Refiners :[State Equation: 0/5099 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/6281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63916ms problems are : Problem set: 0 solved, 6281 unsolved
Search for dead transitions found 0 dead transitions in 63927ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5099/5300 places, 6282/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68924 ms. Remains : 5099/5300 places, 6282/4998 transitions.
Built C files in :
/tmp/ltsmin2042501730200238845
[2025-06-01 04:10:23] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2042501730200238845
Running compilation step : cd /tmp/ltsmin2042501730200238845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2042501730200238845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2042501730200238845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 766 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 04:10:27] [INFO ] Invariants computation overflowed in 106 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:10:29] [INFO ] Implicit Places using invariants in 1841 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 04:10:29] [INFO ] Invariants computation overflowed in 98 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:11:09] [INFO ] Performed 3/5300 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2025-06-01 04:11:39] [INFO ] Performed 146/5300 implicitness test of which 0 returned IMPLICIT in 67 seconds.
[2025-06-01 04:12:09] [INFO ] Performed 361/5300 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2025-06-01 04:12:41] [INFO ] Performed 541/5300 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2025-06-01 04:12:41] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2025-06-01 04:12:41] [INFO ] Implicit Places using invariants and state equation in 131592 ms returned []
Implicit Place search using SMT with State Equation took 133437 ms to find 0 implicit places.
Running 4997 sub problems to find dead transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2025-06-01 04:12:41] [INFO ] Invariants computation overflowed in 101 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.0)
(s2021 1.0)
(s2022 1.0)
(s2023 1.0)
(s2024 1.0)
(s2025 1.0)
(s2026 1.0)
(s2027 1.0)
(s2028 1.0)
(s2029 1.0)
(s2030 1.0)
(s2031 1.0)
(s2032 1.0)
(s2033 1.0)
(s2034 1.0)
(s2035 1.0)
(s2036 1.0)
(s2037 1.0)
(s2038 1.0)
(s2039 1.0)
(s2040 1.0)
(s2041 1.0)
(s2042 1.0)
(s2043 1.0)
(s2044 1.0)
(s2045 1.0)
(s2046 1.0)
(s2047 1.0)
(s2048 1.0)
(s2049 1.0)
(s2050 1.0)
(s2051 1.0)
(s2052 1.0)
(s2053 1.0)
(s2054 1.0)
(s2055 1.0)
(s2056 1.0)
(s2057 1.0)
(s2058 1.0)
(s2059 1.0)
(s2060 1.0)
(s2061 1.0)
(s2062 1.0)
(s2063 1.0)
(s2064 1.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 1.0)
(s2073 1.0)
(s2074 1.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 1.0)
(s2081 1.0)
(s2082 1.0)
(s2083 1.0)
(s2084 1.0)
(s2085 1.0)
(s2086 1.0)
(s2087 1.0)
(s2088 1.0)
(s2089 1.0)
(s2090 1.0)
(s2091 1.0)
(s2092 1.0)
(s2093 1.0)
(s2094 1.0)
(s2095 1.0)
(s2096 1.0)
(s2097 1.0)
(s2098 1.0)
(s2099 1.0)
(s2100 1.0)
(s2101 1.0)
(s2102 1.0)
(s2103 1.0)
(s2104 1.0)
(s2105 1.0)
(s2106 1.0)
(s2107 1.0)
(s2108 1.0)
(s2109 1.0)
(s2110 1.0)
(s2111 1.0)
(s2112 1.0)
(s2113 1.0)
(s2114 1.0)
(s2115 1.0)
(s2116 1.0)
(s2117 1.0)
(s2118 1.0)
(s2119 1.0)
(s2120 1.0)
(s2121 1.0)
(s2122 1.0)
(s2123 1.0)
(s2124 1.0)
(s2125 1.0)
(s2126 1.0)
(s2127 1.0)
(s2128 1.0)
(s2129 1.0)
(s2130 1.0)
(s2131 1.0)
(s2132 1.0)
(s2133 1.0)
(s2134 1.0)
(s2135 1.0)
(s2136 1.0)
(s2137 1.0)
(s2138 1.0)
(s2139 1.0)
(s2140 1.0)
(s2141 1.0)
(s2142 1.0)
(s2143 1.0)
(s2144 1.0)
(s2145 1.0)
(s2146 1.0)
(s2147 1.0)
(s2148 1.0)
(s2149 1.0)
(s2150 1.0)
(s2151 1.0)
(s2152 1.0)
(s2153 1.0)
(s2154 1.0)
(s2155 1.0)
(s2156 1.0)
(s2157 1.0)
(s2158 1.0)
(s2159 1.0)
(s2160 1.0)
(s2161 1.0)
(s2162 1.0)
(s2163 1.0)
(s2164 1.0)
(s2165 1.0)
(s2166 1.0)
(s2167 1.0)
(s2168 1.0)
(s2169 1.0)
(s2170 1.0)
(s2171 1.0)
(s2172 1.0)
(s2173 1.0)
(s2174 1.0)
(s2175 1.0)
(s2176 1.0)
(s2177 1.0)
(s2178 1.0)
(s2179 1.0)
(s2180 1.0)
(s2181 1.0)
(s2182 1.0)
(s2183 1.0)
(s2184 1.0)
(s2185 1.0)
(s2186 1.0)
(s2187 1.0)
(s2188 1.0)
(s2189 1.0)
(s2190 1.0)
(s2191 1.0)
(s2192 1.0)
(s2193 1.0)
(s2194 1.0)
(s2195 1.0)
(s2196 1.0)
(s2197 1.0)
(s2198 1.0)
(s2199 1.0)
(s2200 1.0)
(s2201 1.0)
(s2202 1.0)
(s2203 1.0)
(s2204 1.0)
(s2205 1.0)
(s2206 1.0)
(s2207 1.0)
(s2208 1.0)
(s2209 1.0)
(s2210 1.0)
(s2211 1.0)
(s2212 1.0)
(s2213 1.0)
(s2214 1.0)
(s2215 1.0)
(s2216 1.0)
(s2217 1.0)
(s2218 1.0)
(s2219 1.0)
(s2220 1.0)
(s2221 1.0)
(s2222 1.0)
(s2223 1.0)
(s2224 1.0)
(s2225 1.0)
(s2226 1.0)
(s2227 1.0)
(s2228 1.0)
(s2229 1.0)
(s2230 1.0)
(s2231 1.0)
(s2232 1.0)
(s2233 1.0)
(s2234 1.0)
(s2235 1.0)
(s2236 1.0)
(s2237 1.0)
(s2238 1.0)
(s2239 1.0)
(s2240 1.0)
(s2241 1.0)
(s2242 1.0)
(s2243 1.0)
(s2244 1.0)
(s2245 1.0)
(s2246 1.0)
(s2247 1.0)
(s2248 1.0)
(s2249 1.0)
(s2250 1.0)
(s2251 1.0)
(s2252 1.0)
(s2253 1.0)
(s2254 1.0)
(s2255 1.0)
(s2256 1.0)
(s2257 1.0)
(s2258 1.0)
(s2259 1.0)
(s2260 1.0)
(s2261 1.0)
(s2262 1.0)
(s2263 1.0)
(s2264 1.0)
(s2265 1.0)
(s2266 1.0)
(s2267 1.0)
(s2268 1.0)
(s2269 1.0)
(s2270 1.0)
(s2271 1.0)
(s2272 1.0)
(s2273 1.0)
(s2274 1.0)
(s2275 1.0)
(s2276 1.0)
(s2277 1.0)
(s2278 1.0)
(s2279 1.0)
(s2280 1.0)
(s2281 1.0)
(s2282 1.0)
(s2283 1.0)
(s2284 1.0)
(s2285 1.0)
(s2286 1.0)
(s2287 1.0)
(s2288 1.0)
(s2289 1.0)
(s2290 1.0)
(s2291 1.0)
(s2292 1.0)
(s2293 1.0)
(s2294 1.0)
(s2295 1.0)
(s2296 1.0)
(s2297 1.0)
(s2298 1.0)
(s2299 1.0)
(s2300 1.0)
(s2301 1.0)
(s2302 1.0)
(s2303 1.0)
(s2304 1.0)
(s2305 1.0)
(s2306 1.0)
(s2307 1.0)
(s2308 1.0)
(s2309 1.0)
(s2310 1.0)
(s2311 1.0)
(s2312 1.0)
(s2313 1.0)
(s2314 1.0)
(s2315 1.0)
(s2316 1.0)
(s2317 1.0)
(s2318 1.0)
(s2319 1.0)
(s2320 1.0)
(s2321 1.0)
(s2322 1.0)
(s2323 1.0)
(s2324 1.0)
(s2325 1.0)
(s2326 1.0)
(s2327 1.0)
(s2328 1.0)
(s2329 1.0)
(s2330 1.0)
(s2331 1.0)
(s2332 1.0)
(s2333 1.0)
(s2334 1.0)
(s2335 1.0)
(s2336 1.0)
(s2337 1.0)
(s2338 1.0)
(s2339 1.0)
(s2340 1.0)
(s2341 1.0)
(s2342 1.0)
(s2343 1.0)
(s2344 1.0)
(s2345 1.0)
(s2346 1.0)
(s2347 1.0)
(s2348 1.0)
(s2349 1.0)
(s2350 1.0)
(s2351 1.0)
(s2352 1.0)
(s2353 1.0)
(s2354 1.0)
(s2355 1.0)
(s2356 1.0)
(s2357 1.0)
(s2358 1.0)
(s2359 1.0)
(s2360 1.0)
(s2361 1.0)
(s2362 1.0)
(s2363 1.0)
(s2364 1.0)
(s2365 1.0)
(s2366 1.0)
(s2367 1.0)
(s2368 1.0)
(s2369 1.0)
(s2370 1.0)
(s2371 1.0)
(s2372 1.0)
(s2373 1.0)
(s2374 1.0)
(s2375 1.0)
(s2376 1.0)
(s2377 1.0)
(s2378 1.0)
(s2379 1.0)
(s2380 1.0)
(s2381 1.0)
(s2382 1.0)
(s2383 1.0)
(s2384 1.0)
(s2385 1.0)
(s2386 1.0)
(s2387 1.0)
(s2388 1.0)
(s2389 1.0)
(s2390 1.0)
(s2391 1.0)
(s2392 1.0)
(s2393 1.0)
(s2394 1.0)
(s2395 1.0)
(s2396 1.0)
(s2397 1.0)
(s2398 1.0)
(s2399 1.0)
(s2400 1.0)
(s2401 1.0)
(s2402 1.0)
(s2403 1.0)
(s2404 1.0)
(s2405 1.0)
(s2406 1.0)
(s2407 1.0)
(s2408 1.0)
(s2409 1.0)
(s2410 1.0)
(s2411 1.0)
(s2412 1.0)
(s2413 1.0)
(s2414 1.0)
(s2415 1.0)
(s2416 1.0)
(s2417 1.0)
(s2418 1.0)
(s2419 1.0)
(s2420 1.0)
(s2421 1.0)
(s2422 1.0)
(s2423 1.0)
(s2424 1.0)
(s2425 1.0)
(s2426 1.0)
(s2427 1.0)
(s2428 1.0)
(s2429 1.0)
(s2430 1.0)
(s2431 1.0)
(s2432 1.0)
(s2433 1.0)
(s2434 1.0)
(s2435 1.0)
(s2436 1.0)
(s2437 1.0)
(s2438 1.0)
(s2439 1.0)
(s2440 1.0)
(s2441 1.0)
(s2442 1.0)
(s2443 1.0)
(s2444 1.0)
(s2445 1.0)
(s2446 1.0)
(s2447 1.0)
(s2448 1.0)
(s2449 1.0)
(s2450 1.0)
(s2451 1.0)
(s2452 1.0)
(s2453 1.0)
(s2454 1.0)
(s2455 1.0)
(s2456 1.0)
(s2457 1.0)
(s2458 1.0)
(s2459 1.0)
(s2460 1.0)
(s2461 1.0)
(s2462 1.0)
(s2463 1.0)
(s2464 1.0)
(s2465 1.0)
(s2466 1.0)
(s2467 1.0)
(s2468 1.0)
(s2469 1.0)
(s2470 1.0)
(s2471 1.0)
(s2472 1.0)
(s2473 1.0)
(s2474 1.0)
(s2475 1.0)
(s2476 1.0)
(s2477 1.0)
(s2478 1.0)
(s2479 1.0)
(s2480 1.0)
(s2481 1.0)
(s2482 1.0)
(s2483 1.0)
(s2484 1.0)
(s2485 1.0)
(s2486 1.0)
(s2487 1.0)
(s2488 1.0)
(s2489 1.0)
(s2490 1.0)
(s2491 1.0)
(s2492 1.0)
(s2493 1.0)
(s2494 1.0)
(s2495 1.0)
(s2496 1.0)
(s2497 1.0)
(s2498 1.0)
(s2499 1.0)
(s2500 1.0)
(s2501 1.0)
(s2502 1.0)
(s2503 1.0)
(s2504 1.0)
(s2505 1.0)
(s2506 1.0)
(s2507 1.0)
(s2508 1.0)
(s2509 1.0)
(s2510 1.0)
(s2511 1.0)
(s2512 1.0)
(s2513 1.0)
(s2514 1.0)
(s2515 1.0)
(s2516 1.0)
(s2517 1.0)
(s2518 1.0)
(s2519 1.0)
(s2520 1.0)
(s2521 1.0)
(s2522 1.0)
(s2523 1.0)
(s2524 1.0)
(s2525 1.0)
(s2526 1.0)
(s2527 1.0)
(s2528 1.0)
(s2529 1.0)
(s2530 1.0)
(s2531 1.0)
(s2532 1.0)
(s2533 1.0)
(s2534 1.0)
(s2535 1.0)
(s2536 1.0)
(s2537 1.0)
(s2538 1.0)
(s2539 1.0)
(s2540 1.0)
(s2541 1.0)
(s2542 1.0)
(s2543 1.0)
(s2544 1.0)
(s2545 1.0)
(s2546 1.0)
(s2547 1.0)
(s2548 1.0)
(s2549 1.0)
(s2550 1.0)
(s2551 1.0)
(s2552 1.0)
(s2553 1.0)
(s2554 1.0)
(s2555 1.0)
(s2556 1.0)
(s2557 1.0)
(s2558 1.0)
(s2559 1.0)
(s2560 1.0)
(s2561 1.0)
(s2562 1.0)
(s2563 1.0)
(s2564 1.0)
(s2565 1.0)
(s2566 1.0)
(s2567 1.0)
(s2568 1.0)
(s2569 1.0)
(s2570 1.0)
(s2571 1.0)
(s2572 1.0)
(s2573 1.0)
(s2574 1.0)
(s2575 1.0)
(s2576 1.0)
(s2577 1.0)
(s2578 1.0)
(s2579 1.0)
(s2580 1.0)
(s2581 1.0)
(s2582 1.0)
(s2583 1.0)
(s2584 1.0)
(s2585 1.0)
(s2586 1.0)
(s2587 1.0)
(s2588 1.0)
(s2589 1.0)
(s2590 1.0)
(s2591 1.0)
(s2592 1.0)
(s2593 1.0)
(s2594 1.0)
(s2595 1.0)
(s2596 1.0)
(s2597 1.0)
(s2598 1.0)
(s2599 1.0)
(s2600 1.0)
(s2601 1.0)
(s2602 1.0)
(s2603 1.0)
(s2604 1.0)
(s2605 1.0)
(s2606 1.0)
(s2607 1.0)
(s2608 1.0)
(s2609 1.0)
(s2610 1.0)
(s2611 1.0)
(s2612 1.0)
(s2613 1.0)
(s2614 1.0)
(s2615 1.0)
(s2616 1.0)
(s2617 1.0)
(s2618 1.0)
(s2619 1.0)
(s2620 1.0)
(s2621 1.0)
(s2622 1.0)
(s2623 1.0)
(s2624 1.0)
(s2625 1.0)
(s2626 1.0)
(s2627 1.0)
(s2628 1.0)
(s2629 1.0)
(s2630 1.0)
(s2631 1.0)
(s2632 1.0)
(s2633 1.0)
(s2634 1.0)
(s2635 1.0)
(s2636 1.0)
(s2637 1.0)
(s2638 1.0)
(s2639 1.0)
(s2640 1.0)
(s2641 1.0)
(s2642 1.0)
(s2643 1.0)
(s2644 1.0)
(s2645 1.0)
(s2646 1.0)
(s2647 1.0)
(s2648 1.0)
(s2649 1.0)
(s2650 1.0)
(s2651 1.0)
(s2652 1.0)
(s2653 1.0)
(s2654 1.0)
(s2655 1.0)
(s2656 1.0)
(s2657 1.0)
(s2658 1.0)
(s2659 1.0)
(s2660 1.0)
(s2661 1.0)
(s2662 1.0)
(s2663 1.0)
(s2664 1.0)
(s2665 1.0)
(s2666 1.0)
(s2667 1.0)
(s2668 1.0)
(s2669 1.0)
(s2670 1.0)
(s2671 1.0)
(s2672 1.0)
(s2673 1.0)
(s2674 1.0)
(s2675 1.0)
(s2676 1.0)
(s2677 1.0)
(s2678 1.0)
(s2679 1.0)
(s2680 1.0)
(s2681 1.0)
(s2682 1.0)
(s2683 1.0)
(s2684 1.0)
(s2685 1.0)
(s2686 1.0)
(s2687 1.0)
(s2688 1.0)
(s2689 1.0)
(s2690 1.0)
(s2691 1.0)
(s2692 1.0)
(s2693 1.0)
(s2694 1.0)
(s2695 1.0)
(s2696 1.0)
(s2697 1.0)
(s2698 1.0)
(s2699 1.0)
(s2700 1.0)
(s2701 1.0)
(s2702 1.0)
(s2703 1.0)
(s2704 1.0)
(s2705 1.0)
(s2706 1.0)
(s2707 1.0)
(s2708 1.0)
(s2709 1.0)
(s2710 1.0)
(s2711 1.0)
(s2712 1.0)
(s2713 1.0)
(s2714 1.0)
(s2715 1.0)
(s2716 1.0)
(s2717 1.0)
(s2718 1.0)
(s2719 1.0)
(s2720 1.0)
(s2721 1.0)
(s2722 1.0)
(s2723 1.0)
(s2724 1.0)
(s2725 1.0)
(s2726 1.0)
(s2727 1.0)
(s2728 1.0)
(s2729 1.0)
(s2730 1.0)
(s2731 1.0)
(s2732 1.0)
(s2733 1.0)
(s2734 1.0)
(s2735 1.0)
(s2736 1.0)
(s2737 1.0)
(s2738 1.0)
(s2739 1.0)
(s2740 1.0)
(s2741 1.0)
(s2742 1.0)
(s2743 1.0)
(s2744 1.0)
(s2745 1.0)
(s2746 1.0)
(s2747 1.0)
(s2748 1.0)
(s2749 1.0)
(s2750 1.0)
(s2751 1.0)
(s2752 1.0)
(s2753 1.0)
(s2754 1.0)
(s2755 1.0)
(s2756 1.0)
(s2757 1.0)
(s2758 1.0)
(s2759 1.0)
(s2760 1.0)
(s2761 1.0)
(s2762 1.0)
(s2763 1.0)
(s2764 1.0)
(s2765 1.0)
(s2766 1.0)
(s2767 1.0)
(s2768 1.0)
(s2769 1.0)
(s2770 1.0)
(s2771 1.0)
(s2772 1.0)
(s2773 1.0)
(s2774 1.0)
(s2775 1.0)
(s2776 1.0)
(s2777 1.0)
(s2778 1.0)
(s2779 1.0)
(s2780 1.0)
(s2781 1.0)
(s2782 1.0)
(s2783 1.0)
(s2784 1.0)
(s2785 1.0)
(s2786 1.0)
(s2787 1.0)
(s2788 1.0)
(s2789 1.0)
(s2790 1.0)
(s2791 1.0)
(s2792 1.0)
(s2793 1.0)
(s2794 1.0)
(s2795 1.0)
(s2796 1.0)
(s2797 1.0)
(s2798 1.0)
(s2799 1.0)
(s2800 1.0)
(s2801 1.0)
(s2802 1.0)
(s2803 1.0)
(s2804 1.0)
(s2805 1.0)
(s2806 1.0)
(s2807 1.0)
(s2808 1.0)
(s2809 1.0)
(s2810 1.0)
(s2811 1.0)
(s2812 1.0)
(s2813 1.0)
(s2814 1.0)
(s2815 1.0)
(s2816 1.0)
(s2817 1.0)
(s2818 1.0)
(s2819 1.0)
(s2820 1.0)
(s2821 1.0)
(s2822 1.0)
(s2823 1.0)
(s2824 1.0)
(s2825 1.0)
(s2826 1.0)
(s2827 1.0)
(s2828 1.0)
(s2829 1.0)
(s2830 1.0)
(s2831 1.0)
(s2832 1.0)
(s2833 1.0)
(s2834 1.0)
(s2835 1.0)
(s2836 1.0)
(s2837 1.0)
(s2838 1.0)
(s2839 1.0)
(s2840 1.0)
(s2841 1.0)
(s2842 1.0)
(s2843 1.0)
(s2844 1.0)
(s2845 1.0)
(s2846 1.0)
(s2847 1.0)
(s2848 1.0)
(s2849 1.0)
(s2850 1.0)
(s2851 1.0)
(s2852 1.0)
(s2853 1.0)
(s2854 1.0)
(s2855 1.0)
(s2856 1.0)
(s2857 1.0)
(s2858 1.0)
(s2859 1.0)
(s2860 1.0)
(s2861 1.0)
(s2862 1.0)
(s2863 1.0)
(s2864 1.0)
(s2865 1.0)
(s2866 1.0)
(s2867 1.0)
(s2868 1.0)
(s2869 1.0)
(s2870 1.0)
(s2871 1.0)
(s2872 1.0)
(s2873 1.0)
(s2874 1.0)
(s2875 1.0)
(s2876 1.0)
(s2877 1.0)
(s2878 1.0)
(s2879 1.0)
(s2880 1.0)
(s2881 1.0)
(s2882 1.0)
(s2883 1.0)
(s2884 1.0)
(s2885 1.0)
(s2886 1.0)
(s2887 1.0)
(s2888 1.0)
(s2889 1.0)
(s2890 1.0)
(s2891 1.0)
(s2892 1.0)
(s2893 1.0)
(s2894 1.0)
(s2895 1.0)
(s2896 1.0)
(s2897 1.0)
(s2898 1.0)
(s2899 1.0)
(s2900 1.0)
(s2901 1.0)
(s2902 1.0)
(s2903 1.0)
(s2904 1.0)
(s2905 1.0)
(s2906 1.0)
(s2907 1.0)
(s2908 1.0)
(s2909 1.0)
(s2910 1.0)
(s2911 1.0)
(s2912 1.0)
(s2913 1.0)
(s2914 1.0)
(s2915 1.0)
(s2916 1.0)
(s2917 1.0)
(s2918 1.0)
(s2919 1.0)
(s2920 1.0)
(s2921 1.0)
(s2922 1.0)
(s2923 1.0)
(s2924 1.0)
(s2925 1.0)
(s2926 1.0)
(s2927 1.0)
(s2928 1.0)
(s2929 1.0)
(s2930 1.0)
(s2931 1.0)
(s2932 1.0)
(s2933 1.0)
(s2934 1.0)
(s2935 1.0)
(s2936 1.0)
(s2937 1.0)
(s2938 1.0)
(s2939 1.0)
(s2940 1.0)
(s2941 1.0)
(s2942 1.0)
(s2943 1.0)
(s2944 1.0)
(s2945 1.0)
(s2946 1.0)
(s2947 1.0)
(s2948 1.0)
(s2949 1.0)
(s2950 1.0)
(s2951 1.0)
(s2952 1.0)
(s2953 1.0)
(s2954 1.0)
(s2955 1.0)
(s2956 1.0)
(s2957 1.0)
(s2958 1.0)
(s2959 1.0)
(s2960 1.0)
(s2961 1.0)
(s2962 1.0)
(s2963 1.0)
(s2964 1.0)
(s2965 1.0)
(s2966 1.0)
(s2967 1.0)
(s2968 1.0)
(s2969 1.0)
(s2970 1.0)
(s2971 1.0)
(s2972 1.0)
(s2973 1.0)
(s2974 1.0)
(s2975 1.0)
(s2976 1.0)
(s2977 1.0)
(s2978 1.0)
(s2979 1.0)
(s2980 1.0)
(s2981 1.0)
(s2982 1.0)
(s2983 1.0)
(s2984 1.0)
(s2985 1.0)
(s2986 1.0)
(s2987 1.0)
(s2988 1.0)
(s2989 1.0)
(s2990 1.0)
(s2991 1.0)
(s2992 1.0)
(s2993 1.0)
(s2994 1.0)
(s2995 1.0)
(s2996 1.0)
(s2997 1.0)
(s2998 1.0)
(s2999 1.0)
(s3000 1.0)
(s3001 1.0)
(s3002 1.0)
(s3003 1.0)
(s3004 1.0)
(s3005 1.0)
(s3006 1.0)
(s3007 1.0)
(s3008 1.0)
(s3009 1.0)
(s3010 1.0)
(s3011 1.0)
(s3012 1.0)
(s3013 1.0)
(s3014 1.0)
(s3015 1.0)
(s3016 1.0)
(s3017 1.0)
(s3018 1.0)
(s3019 1.0)
(s3020 1.0)
(s3021 1.0)
(s3022 1.0)
(s3023 1.0)
(s3024 1.0)
(s3025 1.0)
(s3026 1.0)
(s3027 1.0)
(s3028 1.0)
(s3029 1.0)
(s3030 1.0)
(s3031 1.0)
(s3032 1.0)
(s3033 1.0)
(s3034 1.0)
(s3035 1.0)
(s3036 1.0)
(s3037 1.0)
(s3038 1.0)
(s3039 1.0)
(s3040 1.0)
(s3041 1.0)
(s3042 1.0)
(s3043 1.0)
(s3044 1.0)
(s3045 1.0)
(s3046 1.0)
(s3047 1.0)
(s3048 1.0)
(s3049 1.0)
(s3050 1.0)
(s3051 1.0)
(s3052 1.0)
(s3053 1.0)
(s3054 1.0)
(s3055 1.0)
(s3056 1.0)
(s3057 1.0)
(s3058 1.0)
(s3059 1.0)
(s3060 1.0)
(s3061 1.0)
(s3062 1.0)
(s3063 1.0)
(s3064 1.0)
(s3065 1.0)
(s3066 1.0)
(s3067 1.0)
(s3068 1.0)
(s3069 1.0)
(s3070 1.0)
(s3071 1.0)
(s3072 1.0)
(s3073 1.0)
(s3074 1.0)
(s3075 1.0)
(s3076 1.0)
(s3077 1.0)
(s3078 1.0)
(s3079 1.0)
(s3080 1.0)
(s3081 1.0)
(s3082 1.0)
(s3083 1.0)
(s3084 1.0)
(s3085 1.0)
(s3086 1.0)
(s3087 1.0)
(s3088 1.0)
(s3089 1.0)
(s3090 1.0)
(s3091 1.0)
(s3092 1.0)
(s3093 1.0)
(s3094 1.0)
(s3095 1.0)
(s3096 1.0)
(s3097 1.0)
(s3098 1.0)
(s3099 1.0)
(s3100 1.0)
(s3101 1.0)
(s3102 1.0)
(s3103 1.0)
(s3104 1.0)
(s3105 1.0)
(s3106 1.0)
(s3107 1.0)
(s3108 1.0)
(s3109 1.0)
(s3110 1.0)
(s3111 1.0)
(s3112 1.0)
(s3113 1.0)
(s3114 1.0)
(s3115 1.0)
(s3116 1.0)
(s3117 1.0)
(s3118 1.0)
(s3119 1.0)
(s3120 1.0)
(s3121 1.0)
(s3122 1.0)
(s3123 1.0)
(s3124 1.0)
(s3125 1.0)
(s3126 1.0)
(s3127 1.0)
(s3128 1.0)
(s3129 1.0)
(s3130 1.0)
(s3131 1.0)
(s3132 1.0)
(s3133 1.0)
(s3134 1.0)
(s3135 1.0)
(s3136 1.0)
(s3137 1.0)
(s3138 1.0)
(s3139 1.0)
(s3140 1.0)
(s3141 1.0)
(s3142 1.0)
(s3143 1.0)
(s3144 1.0)
(s3145 1.0)
(s3146 1.0)
(s3147 1.0)
(s3148 1.0)
(s3149 1.0)
(s3150 1.0)
(s3151 1.0)
(s3152 1.0)
(s3153 1.0)
(s3154 1.0)
(s3155 1.0)
(s3156 1.0)
(s3157 1.0)
(s3158 1.0)
(s3159 1.0)
(s3160 1.0)
(s3161 1.0)
(s3162 1.0)
(s3163 1.0)
(s3164 1.0)
(s3165 1.0)
(s3166 1.0)
(s3167 1.0)
(s3168 1.0)
(s3169 1.0)
(s3170 1.0)
(s3171 1.0)
(s3172 1.0)
(s3173 1.0)
(s3174 1.0)
(s3175 1.0)
(s3176 1.0)
(s3177 1.0)
(s3178 1.0)
(s3179 1.0)
(s3180 1.0)
(s3181 1.0)
(s3182 1.0)
(s3183 1.0)
(s3184 1.0)
(s3185 1.0)
(s3186 1.0)
(s3187 1.0)
(s3188 1.0)
(s3189 1.0)
(s3190 1.0)
(s3191 1.0)
(s3192 1.0)
(s3193 1.0)
(s3194 1.0)
(s3195 1.0)
(s3196 1.0)
(s3197 1.0)
(s3198 1.0)
(s3199 1.0)
(s3200 1.0)
(s3201 1.0)
(s3202 1.0)
(s3203 1.0)
(s3204 1.0)
(s3205 1.0)
(s3206 1.0)
(s3207 1.0)
(s3208 1.0)
(s3209 1.0)
(s3210 1.0)
(s3211 1.0)
(s3212 1.0)
(s3213 1.0)
(s3214 1.0)
(s3215 1.0)
(s3216 1.0)
(s3217 1.0)
(s3218 1.0)
(s3219 1.0)
(s3220 1.0)
(s3221 1.0)
(s3222 1.0)
(s3223 1.0)
(s3224 1.0)
(s3225 1.0)
(s3226 1.0)
(s3227 1.0)
(s3228 1.0)
(s3229 1.0)
(s3230 1.0)
(s3231 1.0)
(s3232 1.0)
(s3233 1.0)
(s3234 1.0)
(s3235 1.0)
(s3236 1.0)
(s3237 1.0)
(s3238 1.0)
(s3239 1.0)
(s3240 1.0)
(s3241 1.0)
(s3242 1.0)
(s3243 1.0)
(s3244 1.0)
(s3245 1.0)
(s3246 1.0)
(s3247 1.0)
(s3248 1.0)
(s3249 1.0)
(s3250 1.0)
(s3251 1.0)
(s3252 1.0)
(s3253 1.0)
(s3254 1.0)
(s3255 1.0)
(s3256 1.0)
(s3257 1.0)
(s3258 1.0)
(s3259 1.0)
(s3260 1.0)
(s3261 1.0)
(s3262 1.0)
(s3263 1.0)
(s3264 1.0)
(s3265 1.0)
(s3266 1.0)
(s3267 1.0)
(s3268 1.0)
(s3269 1.0)
(s3270 1.0)
(s3271 1.0)
(s3272 1.0)
(s3273 1.0)
(s3274 1.0)
(s3275 1.0)
(s3276 1.0)
(s3277 1.0)
(s3278 1.0)
(s3279 1.0)
(s3280 1.0)
(s3281 1.0)
(s3282 1.0)
(s3283 1.0)
(s3284 1.0)
(s3285 1.0)
(s3286 1.0)
(s3287 1.0)
(s3288 1.0)
(s3289 1.0)
(s3290 1.0)
(s3291 1.0)
(s3292 1.0)
(s3293 1.0)
(s3294 1.0)
(s3295 1.0)
(s3296 1.0)
(s3297 1.0)
(s3298 1.0)
(s3299 1.0)
(s3300 1.0)
(s3301 1.0)
(s3302 1.0)
(s3303 1.0)
(s3304 1.0)
(s3305 1.0)
(s3306 1.0)
(s3307 1.0)
(s3308 1.0)
(s3309 1.0)
(s3310 1.0)
(s3311 1.0)
(s3312 1.0)
(s3313 1.0)
(s3314 1.0)
(s3315 1.0)
(s3316 1.0)
(s3317 1.0)
(s3318 1.0)
(s3319 1.0)
(s3320 1.0)
(s3321 1.0)
(s3322 1.0)
(s3323 1.0)
(s3324 1.0)
(s3325 1.0)
(s3326 1.0)
(s3327 1.0)
(s3328 1.0)
(s3329 1.0)
(s3330 1.0)
(s3331 1.0)
(s3332 1.0)
(s3333 1.0)
(s3334 1.0)
(s3335 1.0)
(s3336 1.0)
(s3337 1.0)
(s3338 1.0)
(s3339 1.0)
(s3340 1.0)
(s3341 1.0)
(s3342 1.0)
(s3343 1.0)
(s3344 1.0)
(s3345 1.0)
(s3346 1.0)
(s3347 1.0)
(s3348 1.0)
(s3349 1.0)
(s3350 1.0)
(s3351 1.0)
(s3352 1.0)
(s3353 1.0)
(s3354 1.0)
(s3355 1.0)
(s3356 1.0)
(s3357 1.0)
(s3358 1.0)
(s3359 1.0)
(s3360 1.0)
(s3361 1.0)
(s3362 1.0)
(s3363 1.0)
(s3364 1.0)
(s3365 1.0)
(s3366 1.0)
(s3367 1.0)
(s3368 1.0)
(s3369 1.0)
(s3370 1.0)
(s3371 1.0)
(s3372 1.0)
(s3373 1.0)
(s3374 1.0)
(s3375 1.0)
(s3376 1.0)
(s3377 1.0)
(s3378 1.0)
(s3379 1.0)
(s3380 1.0)
(s3381 1.0)
(s3382 1.0)
(s3383 1.0)
(s3384 1.0)
(s3385 1.0)
(s3386 1.0)
(s3387 1.0)
(s3388 1.0)
(s3389 1.0)
(s3390 1.0)
(s3391 1.0)
(s3392 1.0)
(s3393 1.0)
(s3394 1.0)
(s3395 1.0)
(s3396 1.0)
(s3397 1.0)
(s3398 1.0)
(s3399 1.0)
(s3400 1.0)
(s3401 1.0)
(s3402 1.0)
(s3403 1.0)
(s3404 1.0)
(s3405 1.0)
(s3406 1.0)
(s3407 1.0)
(s3408 1.0)
(s3409 1.0)
(s3410 1.0)
(s3411 1.0)
(s3412 1.0)
(s3413 1.0)
(s3414 1.0)
(s3415 1.0)
(s3416 1.0)
(s3417 1.0)
(s3418 1.0)
(s3419 1.0)
(s3420 1.0)
(s3421 1.0)
(s3422 1.0)
(s3423 1.0)
(s3424 1.0)
(s3425 1.0)
(s3426 1.0)
(s3427 1.0)
(s3428 1.0)
(s3429 1.0)
(s3430 1.0)
(s3431 1.0)
(s3432 1.0)
(s3433 1.0)
(s3434 1.0)
(s3435 1.0)
(s3436 1.0)
(s3437 1.0)
(s3438 1.0)
(s3439 1.0)
(s3440 1.0)
(s3441 1.0)
(s3442 1.0)
(s3443 1.0)
(s3444 1.0)
(s3445 1.0)
(s3446 1.0)
(s3447 1.0)
(s3448 1.0)
(s3449 1.0)
(s3450 1.0)
(s3451 1.0)
(s3452 1.0)
(s3453 1.0)
(s3454 1.0)
(s3455 1.0)
(s3456 1.0)
(s3457 1.0)
(s3458 1.0)
(s3459 1.0)
(s3460 1.0)
(s3461 1.0)
(s3462 1.0)
(s3463 1.0)
(s3464 1.0)
(s3465 1.0)
(s3466 1.0)
(s3467 1.0)
(s3468 1.0)
(s3469 1.0)
(s3470 1.0)
(s3471 1.0)
(s3472 1.0)
(s3473 1.0)
(s3474 1.0)
(s3475 1.0)
(s3476 1.0)
(s3477 1.0)
(s3478 1.0)
(s3479 1.0)
(s3480 1.0)
(s3481 1.0)
(s3482 1.0)
(s3483 1.0)
(s3484 1.0)
(s3485 1.0)
(s3486 1.0)
(s3487 1.0)
(s3488 1.0)
(s3489 1.0)
(s3490 1.0)
(s3491 1.0)
(s3492 1.0)
(s3493 1.0)
(s3494 1.0)
(s3495 1.0)
(s3496 1.0)
(s3497 1.0)
(s3498 1.0)
(s3499 1.0)
(s3500 1.0)
(s3501 1.0)
(s3502 1.0)
(s3503 1.0)
(s3504 1.0)
(s3505 1.0)
(s3506 1.0)
(s3507 1.0)
(s3508 1.0)
(s3509 1.0)
(s3510 1.0)
(s3511 1.0)
(s3512 1.0)
(s3513 1.0)
(s3514 1.0)
(s3515 1.0)
(s3516 1.0)
(s3517 1.0)
(s3518 1.0)
(s3519 1.0)
(s3520 1.0)
(s3521 1.0)
(s3522 1.0)
(s3523 1.0)
(s3524 1.0)
(s3525 1.0)
(s3526 1.0)
(s3527 1.0)
(s3528 1.0)
(s3529 1.0)
(s3530 1.0)
(s3531 1.0)
(s3532 1.0)
(s3533 1.0)
(s3534 1.0)
(s3535 1.0)
(s3536 1.0)
(s3537 1.0)
(s3538 1.0)
(s3539 1.0)
(s3540 1.0)
(s3541 1.0)
(s3542 1.0)
(s3543 1.0)
(s3544 1.0)
(s3545 1.0)
(s3546 1.0)
(s3547 1.0)
(s3548 1.0)
(s3549 1.0)
(s3550 1.0)
(s3551 1.0)
(s3552 1.0)
(s3553 1.0)
(s3554 1.0)
(s3555 1.0)
(s3556 1.0)
(s3557 1.0)
(s3558 1.0)
(s3559 1.0)
(s3560 1.0)
(s3561 1.0)
(s3562 1.0)
(s3563 1.0)
(s3564 1.0)
(s3565 1.0)
(s3566 1.0)
(s3567 1.0)
(s3568 1.0)
(s3569 1.0)
(s3570 1.0)
(s3571 1.0)
(s3572 1.0)
(s3573 1.0)
(s3574 1.0)
(s3575 1.0)
(s3576 1.0)
(s3577 1.0)
(s3578 1.0)
(s3579 1.0)
(s3580 1.0)
(s3581 1.0)
(s3582 1.0)
(s3583 1.0)
(s3584 1.0)
(s3585 1.0)
(s3586 1.0)
(s3587 1.0)
(s3588 1.0)
(s3589 1.0)
(s3590 1.0)
(s3591 1.0)
(s3592 1.0)
(s3593 1.0)
(s3594 1.0)
(s3595 1.0)
(s3596 1.0)
(s3597 1.0)
(s3598 1.0)
(s3599 1.0)
(s3600 1.0)
(s3601 1.0)
(s3602 1.0)
(s3603 1.0)
(s3604 1.0)
(s3605 1.0)
(s3606 1.0)
(s3607 1.0)
(s3608 1.0)
(s3609 1.0)
(s3610 1.0)
(s3611 1.0)
(s3612 1.0)
(s3613 1.0)
(s3614 1.0)
(s3615 1.0)
(s3616 1.0)
(s3617 1.0)
(s3618 1.0)
(s3619 1.0)
(s3620 1.0)
(s3621 1.0)
(s3622 1.0)
(s3623 1.0)
(s3624 1.0)
(s3625 1.0)
(s3626 1.0)
(s3627 1.0)
(s3628 1.0)
(s3629 1.0)
(s3630 1.0)
(s3631 1.0)
(s3632 1.0)
(s3633 1.0)
(s3634 1.0)
(s3635 1.0)
(s3636 1.0)
(s3637 1.0)
(s3638 1.0)
(s3639 1.0)
(s3640 1.0)
(s3641 1.0)
(s3642 1.0)
(s3643 1.0)
(s3644 1.0)
(s3645 1.0)
(s3646 1.0)
(s3647 1.0)
(s3648 1.0)
(s3649 1.0)
(s3650 1.0)
(s3651 1.0)
(s3652 1.0)
(s3653 1.0)
(s3654 1.0)
(s3655 1.0)
(s3656 1.0)
(s3657 1.0)
(s3658 1.0)
(s3659 1.0)
(s3660 1.0)
(s3661 1.0)
(s3662 1.0)
(s3663 1.0)
(s3664 1.0)
(s3665 1.0)
(s3666 1.0)
(s3667 1.0)
(s3668 1.0)
(s3669 1.0)
(s3670 1.0)
(s3671 1.0)
(s3672 1.0)
(s3673 1.0)
(s3674 1.0)
(s3675 1.0)
(s3676 1.0)
(s3677 1.0)
(s3678 1.0)
(s3679 1.0)
(s3680 1.0)
(s3681 1.0)
(s3682 1.0)
(s3683 1.0)
(s3684 1.0)
(s3685 1.0)
(s3686 1.0)
(s3687 1.0)
(s3688 1.0)
(s3689 1.0)
(s3690 1.0)
(s3691 1.0)
(s3692 1.0)
(s3693 1.0)
(s3694 1.0)
(s3695 1.0)
(s3696 1.0)
(s3697 1.0)
(s3698 1.0)
(s3699 1.0)
(s3700 1.0)
(s3701 1.0)
(s3702 1.0)
(s3703 1.0)
(s3704 1.0)
(s3705 1.0)
(s3706 1.0)
(s3707 1.0)
(s3708 1.0)
(s3709 1.0)
(s3710 1.0)
(s3711 1.0)
(s3712 1.0)
(s3713 1.0)
(s3714 1.0)
(s3715 1.0)
(s3716 1.0)
(s3717 1.0)
(s3718 1.0)
(s3719 1.0)
(s3720 1.0)
(s3721 1.0)
(s3722 1.0)
(s3723 1.0)
(s3724 1.0)
(s3725 1.0)
(s3726 1.0)
(s3727 1.0)
(s3728 1.0)
(s3729 1.0)
(s3730 1.0)
(s3731 1.0)
(s3732 1.0)
(s3733 1.0)
(s3734 1.0)
(s3735 1.0)
(s3736 1.0)
(s3737 1.0)
(s3738 1.0)
(s3739 1.0)
(s3740 1.0)
(s3741 1.0)
(s3742 1.0)
(s3743 1.0)
(s3744 1.0)
(s3745 1.0)
(s3746 1.0)
(s3747 1.0)
(s3748 1.0)
(s3749 1.0)
(s3750 1.0)
(s3751 1.0)
(s3752 1.0)
(s3753 1.0)
(s3754 1.0)
(s3755 1.0)
(s3756 1.0)
(s3757 1.0)
(s3758 1.0)
(s3759 1.0)
(s3760 1.0)
(s3761 1.0)
(s3762 1.0)
(s3763 1.0)
(s3764 1.0)
(s3765 1.0)
(s3766 1.0)
(s3767 1.0)
(s3768 1.0)
(s3769 1.0)
(s3770 1.0)
(s3771 1.0)
(s3772 1.0)
(s3773 1.0)
(s3774 1.0)
(s3775 1.0)
(s3776 1.0)
(s3777 1.0)
(s3778 1.0)
(s3779 1.0)
(s3780 1.0)
(s3781 1.0)
(s3782 1.0)
(s3783 1.0)
(s3784 1.0)
(s3785 1.0)
(s3786 1.0)
(s3787 1.0)
(s3788 1.0)
(s3789 1.0)
(s3790 1.0)
(s3791 1.0)
(s3792 1.0)
(s3793 1.0)
(s3794 1.0)
(s3795 1.0)
(s3796 1.0)
(s3797 1.0)
(s3798 1.0)
(s3799 1.0)
(s3800 1.0)
(s3801 1.0)
(s3802 1.0)
(s3803 1.0)
(s3804 1.0)
(s3805 1.0)
(s3806 1.0)
(s3807 1.0)
(s3808 1.0)
(s3809 1.0)
(s3810 1.0)
(s3811 1.0)
(s3812 1.0)
(s3813 1.0)
(s3814 1.0)
(s3815 1.0)
(s3816 1.0)
(s3817 1.0)
(s3818 1.0)
(s3819 1.0)
(s3820 1.0)
(s3821 1.0)
(s3822 1.0)
(s3823 1.0)
(s3824 1.0)
(s3825 1.0)
(s3826 1.0)
(s3827 1.0)
(s3828 1.0)
(s3829 1.0)
(s3830 1.0)
(s3831 1.0)
(s3832 1.0)
(s3833 1.0)
(s3834 1.0)
(s3835 1.0)
(s3836 1.0)
(s3837 1.0)
(s3838 1.0)
(s3839 1.0)
(s3840 1.0)
(s3841 1.0)
(s3842 1.0)
(s3843 1.0)
(s3844 1.0)
(s3845 1.0)
(s3846 1.0)
(s3847 1.0)
(s3848 1.0)
(s3849 1.0)
(s3850 1.0)
(s3851 1.0)
(s3852 1.0)
(s3853 1.0)
(s3854 1.0)
(s3855 1.0)
(s3856 1.0)
(s3857 1.0)
(s3858 1.0)
(s3859 1.0)
(s3860 1.0)
(s3861 1.0)
(s3862 1.0)
(s3863 1.0)
(s3864 1.0)
(s3865 1.0)
(s3866 1.0)
(s3867 1.0)
(s3868 1.0)
(s3869 1.0)
(s3870 1.0)
(s3871 1.0)
(s3872 1.0)
(s3873 1.0)
(s3874 1.0)
(s3875 1.0)
(s3876 1.0)
(s3877 1.0)
(s3878 1.0)
(s3879 1.0)
(s3880 1.0)
(s3881 1.0)
(s3882 1.0)
(s3883 1.0)
(s3884 1.0)
(s3885 1.0)
(s3886 1.0)
(s3887 1.0)
(s3888 1.0)
(s3889 1.0)
(s3890 1.0)
(s3891 1.0)
(s3892 1.0)
(s3893 1.0)
(s3894 1.0)
(s3895 1.0)
(s3896 1.0)
(s3897 1.0)
(s3898 1.0)
(s3899 1.0)
(s3900 1.0)
(s3901 1.0)
(s3902 1.0)
(s3903 1.0)
(s3904 1.0)
(s3905 1.0)
(s3906 1.0)
(s3907 1.0)
(s3908 1.0)
(s3909 1.0)
(s3910 1.0)
(s3911 1.0)
(s3912 1.0)
(s3913 1.0)
(s3914 1.0)
(s3915 1.0)
(s3916 1.0)
(s3917 1.0)
(s3918 1.0)
(s3919 1.0)
(s3920 1.0)
(s3921 1.0)
(s3922 1.0)
(s3923 1.0)
(s3924 1.0)
(s3925 1.0)
(s3926 1.0)
(s3927 1.0)
(s3928 1.0)
(s3929 1.0)
(s3930 1.0)
(s3931 1.0)
(s3932 1.0)
(s3933 1.0)
(s3934 1.0)
(s3935 1.0)
(s3936 1.0)
(s3937 1.0)
(s3938 1.0)
(s3939 1.0)
(s3940 1.0)
(s3941 1.0)
(s3942 1.0)
(s3943 1.0)
(s3944 1.0)
(s3945 1.0)
(s3946 1.0)
(s3947 1.0)
(s3948 1.0)
(s3949 1.0)
(s3950 1.0)
(s3951 1.0)
(s3952 1.0)
(s3953 1.0)
(s3954 1.0)
(s3955 1.0)
(s3956 1.0)
(s3957 1.0)
(s3958 1.0)
(s3959 1.0)
(s3960 1.0)
(s3961 1.0)
(s3962 1.0)
(s3963 1.0)
(s3964 1.0)
(s3965 1.0)
(s3966 1.0)
(s3967 1.0)
(s3968 1.0)
(s3969 1.0)
(s3970 1.0)
(s3971 1.0)
(s3972 1.0)
(s3973 1.0)
(s3974 1.0)
(s3975 1.0)
(s3976 1.0)
(s3977 1.0)
(s3978 1.0)
(s3979 1.0)
(s3980 1.0)
(s3981 1.0)
(s3982 1.0)
(s3983 1.0)
(s3984 1.0)
(s3985 1.0)
(s3986 1.0)
(s3987 1.0)
(s3988 1.0)
(s3989 1.0)
(s3990 1.0)
(s3991 1.0)
(s3992 1.0)
(s3993 1.0)
(s3994 1.0)
(s3995 1.0)
(s3996 1.0)
(s3997 1.0)
(s3998 1.0)
(s3999 1.0)
(s4000 1.0)
(s4001 1.0)
(s4002 1.0)
(s4003 1.0)
(s4004 1.0)
(s4005 1.0)
(s4006 1.0)
(s4007 1.0)
(s4008 1.0)
(s4009 1.0)
(s4010 1.0)
(s4011 1.0)
(s4012 1.0)
(s4013 1.0)
(s4014 1.0)
(s4015 1.0)
(s4016 1.0)
(s4017 1.0)
(s4018 1.0)
(s4019 1.0)
(s4020 1.0)
(s4021 1.0)
(s4022 1.0)
(s4023 1.0)
(s4024 1.0)
(s4025 1.0)
(s4026 1.0)
(s4027 1.0)
(s4028 1.0)
(s4029 1.0)
(s4030 1.0)
(s4031 1.0)
(s4032 1.0)
(s4033 1.0)
(s4034 1.0)
(s4035 1.0)
(s4036 1.0)
(s4037 1.0)
(s4038 1.0)
(s4039 1.0)
(s4040 1.0)
(s4041 1.0)
(s4042 1.0)
(s4043 1.0)
(s4044 1.0)
(s4045 1.0)
(s4046 1.0)
(s4047 1.0)
(s4048 1.0)
(s4049 1.0)
(s4050 1.0)
(s4051 1.0)
(s4052 1.0)
(s4053 1.0)
(s4054 1.0)
(s4055 1.0)
(s4056 1.0)
(s4057 1.0)
(s4058 1.0)
(s4059 1.0)
(s4060 1.0)
(s4061 1.0)
(s4062 1.0)
(s4063 1.0)
(s4064 1.0)
(s4065 1.0)
(s4066 1.0)
(s4067 1.0)
(s4068 1.0)
(s4069 1.0)
(s4070 1.0)
(s4071 1.0)
(s4072 1.0)
(s4073 1.0)
(s4074 1.0)
(s4075 1.0)
(s4076 1.0)
(s4077 1.0)
(s4078 1.0)
(s4079 1.0)
(s4080 1.0)
(s4081 1.0)
(s4082 1.0)
(s4083 1.0)
(s4084 1.0)
(s4085 1.0)
(s4086 1.0)
(s4087 1.0)
(s4088 1.0)
(s4089 1.0)
(s4090 1.0)
(s4091 1.0)
(s4092 1.0)
(s4093 1.0)
(s4094 1.0)
(s4095 1.0)
(s4096 1.0)
(s4097 1.0)
(s4098 1.0)
(s4099 1.0)
(s4100 1.0)
(s4101 1.0)
(s4102 1.0)
(s4103 1.0)
(s4104 1.0)
(s4105 1.0)
(s4106 1.0)
(s4107 1.0)
(s4108 1.0)
(s4109 1.0)
(s4110 1.0)
(s4111 1.0)
(s4112 1.0)
(s4113 1.0)
(s4114 1.0)
(s4115 1.0)
(s4116 1.0)
(s4117 1.0)
(s4118 1.0)
(s4119 1.0)
(s4120 1.0)
(s4121 1.0)
(s4122 1.0)
(s4123 1.0)
(s4124 1.0)
(s4125 1.0)
(s4126 1.0)
(s4127 1.0)
(s4128 1.0)
(s4129 1.0)
(s4130 1.0)
(s4131 1.0)
(s4132 1.0)
(s4133 1.0)
(s4134 1.0)
(s4135 1.0)
(s4136 1.0)
(s4137 1.0)
(s4138 1.0)
(s4139 1.0)
(s4140 timeout
1.0)
(s4141 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30079 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 4997/4997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4997 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s38 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1timeout
)
(s39 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30065 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 0/4997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62206ms problems are : Problem set: 0 solved, 4997 unsolved
Search for dead transitions found 0 dead transitions in 62214ms
Finished structural reductions in LTL mode , in 1 iterations and 196435 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Built C files in :
/tmp/ltsmin18381350509318465456
[2025-06-01 04:13:43] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18381350509318465456
Running compilation step : cd /tmp/ltsmin18381350509318465456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18381350509318465456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18381350509318465456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-01 04:13:47] [INFO ] Flatten gal took : 138 ms
[2025-06-01 04:13:47] [INFO ] Flatten gal took : 133 ms
[2025-06-01 04:13:47] [INFO ] Time to serialize gal into /tmp/LTL7275391856341300011.gal : 34 ms
[2025-06-01 04:13:47] [INFO ] Time to serialize properties into /tmp/LTL15106826278870084924.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7275391856341300011.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7463308541522285642.hoa' '-atoms' '/tmp/LTL15106826278870084924.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15106826278870084924.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7463308541522285642.hoa
Detected timeout of ITS tools.
[2025-06-01 04:14:03] [INFO ] Flatten gal took : 125 ms
[2025-06-01 04:14:03] [INFO ] Flatten gal took : 128 ms
[2025-06-01 04:14:03] [INFO ] Time to serialize gal into /tmp/LTL9753139215235303894.gal : 25 ms
[2025-06-01 04:14:03] [INFO ] Time to serialize properties into /tmp/LTL14855318873723279351.ltl : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9753139215235303894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14855318873723279351.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(p3266<=p4830)")||(X(("(p164<=p4007)")||(G("(p3266>p4830)")))))U((G(("(p3266<=p4830)")||(X(("(p164<=p4007)")||(G("(p3266>p4830)"...274
Formula 0 simplified : F"((p3266<=p4830)&&(p4385>=2))" U (!"(p3266<=p4830)" & X(!"(p164<=p4007)" & F!"(p3266>p4830)"))
Detected timeout of ITS tools.
[2025-06-01 04:14:18] [INFO ] Flatten gal took : 110 ms
[2025-06-01 04:14:18] [INFO ] Applying decomposition
[2025-06-01 04:14:18] [INFO ] Flatten gal took : 112 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph201867055927442548.txt' '-o' '/tmp/graph201867055927442548.bin' '-w' '/tmp/graph201867055927442548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph201867055927442548.bin' '-l' '-1' '-v' '-w' '/tmp/graph201867055927442548.weights' '-q' '0' '-e' '0.001'
[2025-06-01 04:14:18] [INFO ] Decomposing Gal with order
[2025-06-01 04:14:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 04:14:20] [INFO ] Removed a total of 1415 redundant transitions.
[2025-06-01 04:14:20] [INFO ] Flatten gal took : 352 ms
[2025-06-01 04:14:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 262 ms.
[2025-06-01 04:14:22] [INFO ] Time to serialize gal into /tmp/LTL15959087532002481331.gal : 71 ms
[2025-06-01 04:14:22] [INFO ] Time to serialize properties into /tmp/LTL16528536094790149552.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15959087532002481331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16528536094790149552.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("(gu1810.p3266<=gu1810.p4830)")||(X(("(gu307.p164<=gu307.p4007)")||(G("(gu1810.p3266>gu1810.p4830)")))))U((G(("(gu1810.p3266<=gu1...443
Formula 0 simplified : F"((gu1810.p3266<=gu1810.p4830)&&(gi1.gi1.gi1.gi0.gi0.gi0.gi1.gu1603.p4385>=2))" U (!"(gu1810.p3266<=gu1810.p4830)" & X(!"(gu307.p16...207
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-100-LTLCardinality-01 finished in 1269781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F((p0&&G(p1))))) U (!p0||F(p2)))))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1195 place count 5299 transition count 3802
Reduce places removed 1195 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2392 place count 4104 transition count 3800
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2394 place count 4102 transition count 3800
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2394 place count 4102 transition count 3600
Deduced a syphon composed of 200 places in 167 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2794 place count 3902 transition count 3600
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 61 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 47 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 43 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4992 place count 2803 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4993 place count 2802 transition count 2698
Applied a total of 4993 rules in 1200 ms. Remains 2802 /5300 variables (removed 2498) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2802 cols
[2025-06-01 04:14:39] [INFO ] Invariants computation overflowed in 60 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:14:40] [INFO ] Implicit Places using invariants in 1277 ms returned []
// Phase 1: matrix 2698 rows 2802 cols
[2025-06-01 04:14:40] [INFO ] Invariants computation overflowed in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:14:41] [INFO ] State equation strengthened by 198 read => feed constraints.
[2025-06-01 04:15:11] [INFO ] Performed 69/2802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 04:16:45] [INFO ] Performed 104/2802 implicitness test of which 0 returned IMPLICIT in 123 seconds.
[2025-06-01 04:16:45] [INFO ] Timeout of Implicit test with SMT after 123 seconds.
[2025-06-01 04:16:45] [INFO ] Implicit Places using invariants and state equation in 125203 ms returned []
Implicit Place search using SMT with State Equation took 126490 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 04:16:45] [INFO ] Redundant transitions in 183 ms returned []
Running 2697 sub problems to find dead transitions.
// Phase 1: matrix 2698 rows 2802 cols
[2025-06-01 04:16:45] [INFO ] Invariants computation overflowed in 57 ms
[2025-06-01 04:16:45] [INFO ] State equation strengthened by 198 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2801/5500 variables, and 0 constraints, problems are : Problem set: 0 solved, 2697 unsolved in 30041 ms.
Refiners :[State Equation: 0/2802 constraints, ReadFeed: 0/198 constraints, PredecessorRefiner: 2697/2697 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2697 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2801/5500 variables, and 0 constraints, problems are : Problem set: 0 solved, 2697 unsolved in 30038 ms.
Refiners :[State Equation: 0/2802 constraints, ReadFeed: 0/198 constraints, PredecessorRefiner: 0/2697 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60840ms problems are : Problem set: 0 solved, 2697 unsolved
Search for dead transitions found 0 dead transitions in 60845ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2802/5300 places, 2698/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188737 ms. Remains : 2802/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND p0 (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-02
Product exploration explored 100000 steps with 13953 reset in 184 ms.
Product exploration explored 100000 steps with 14022 reset in 188 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8878 edges and 2802 vertex of which 2800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 125 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND p0 (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (5505 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (3238 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (3266 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (3321 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (3267 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (3213 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (3255 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (3260 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (3280 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (3268 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 80429 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 9
Probabilistic random walk after 80429 steps, saw 40226 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 2698 rows 2802 cols
[2025-06-01 04:17:51] [INFO ] Invariants computation overflowed in 49 ms
[2025-06-01 04:17:51] [INFO ] State equation strengthened by 198 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 108/129 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 299/428 variables, 127/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 11/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 392/820 variables, 204/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 13/396 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 373/1193 variables, 188/584 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1193 variables, 16/600 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1193 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 381/1574 variables, 195/795 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1574 variables, 15/810 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1574 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 284/1858 variables, 163/973 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1858 variables, 10/983 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1858 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 211/2069 variables, 112/1095 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2069 variables, 8/1103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2069 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2223/5500 variables, and 1190 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5021 ms.
Refiners :[State Equation: 1116/2802 constraints, ReadFeed: 74/198 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 108/129 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 299/428 variables, 127/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 11/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 392/820 variables, 204/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 13/405 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/820 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 373/1193 variables, 188/593 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1193 variables, 16/609 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:57] [INFO ] Deduced a trap along path composed of 2 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:57] [INFO ] Deduced a trap along path composed of 12 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:57] [INFO ] Deduced a trap along path composed of 11 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:57] [INFO ] Deduced a trap along path composed of 8 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:57] [INFO ] Deduced a trap along path composed of 16 places in 43 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1193 variables, 5/614 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1193 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 381/1574 variables, 195/809 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1574 variables, 15/824 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:58] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:59] [INFO ] Deduced a trap along path composed of 8 places in 58 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:59] [INFO ] Deduced a trap along path composed of 11 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:59] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:59] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:59] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:59] [INFO ] Deduced a trap along path composed of 5 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:59] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:59] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:59] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:59] [INFO ] Deduced a trap along path composed of 5 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:17:59] [INFO ] Deduced a trap along path composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1574 variables, 12/836 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1574 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1858/5500 variables, and 999 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5014 ms.
Refiners :[State Equation: 917/2802 constraints, ReadFeed: 56/198 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 17/17 constraints]
After SMT, in 10104ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 2698/2698 transitions.
Graph (complete) has 8478 edges and 2802 vertex of which 2800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2800 transition count 2696
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2800 transition count 2695
Deduced a syphon composed of 1 places in 42 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2799 transition count 2695
Free-agglomeration rule (complex) applied 394 times.
Iterating global reduction 1 with 394 rules applied. Total rules applied 399 place count 2799 transition count 2301
Reduce places removed 394 places and 0 transitions.
Iterating post reduction 1 with 394 rules applied. Total rules applied 793 place count 2405 transition count 2301
Partial Free-agglomeration rule applied 399 times.
Drop transitions (Partial Free agglomeration) removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1192 place count 2405 transition count 2301
Applied a total of 1192 rules in 526 ms. Remains 2405 /2802 variables (removed 397) and now considering 2301/2698 (removed 397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 526 ms. Remains : 2405/2802 places, 2301/2698 transitions.
RANDOM walk for 40000 steps (5012 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (3392 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (3402 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (3389 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (3325 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (3417 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (3379 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (3391 resets) in 108 ms. (366 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (3323 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (3349 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 89582 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 9
Probabilistic random walk after 89582 steps, saw 44817 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 2301 rows 2405 cols
[2025-06-01 04:18:05] [INFO ] Invariants computation overflowed in 32 ms
[2025-06-01 04:18:05] [INFO ] State equation strengthened by 396 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 758/781 variables, 124/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2612/3393 variables, 1253/1390 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3393 variables, 209/1599 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3393 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4706/4706 variables, and 2622 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45037 ms.
Refiners :[State Equation: 2405/2405 constraints, ReadFeed: 217/396 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 758/781 variables, 124/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 9/146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/781 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2612/3393 variables, 1253/1399 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3393 variables, 209/1608 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3393 variables, 0/1608 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf4 is UNSAT
Problem apf7 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4706/4706 variables, and 2631 constraints, problems are : Problem set: 2 solved, 7 unsolved in 45045 ms.
Refiners :[State Equation: 2405/2405 constraints, ReadFeed: 217/396 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90140ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2405/2405 places, 2301/2301 transitions.
Applied a total of 0 rules in 152 ms. Remains 2405 /2405 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 2405/2405 places, 2301/2301 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p2 p1)), (G (OR p2 p0))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 132 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Support contains 1 out of 2802 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2802/2802 places, 2698/2698 transitions.
Applied a total of 0 rules in 137 ms. Remains 2802 /2802 variables (removed 0) and now considering 2698/2698 (removed 0) transitions.
// Phase 1: matrix 2698 rows 2802 cols
[2025-06-01 04:19:36] [INFO ] Invariants computation overflowed in 59 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:19:37] [INFO ] Implicit Places using invariants in 1230 ms returned []
// Phase 1: matrix 2698 rows 2802 cols
[2025-06-01 04:19:37] [INFO ] Invariants computation overflowed in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:19:38] [INFO ] State equation strengthened by 198 read => feed constraints.
[2025-06-01 04:20:08] [INFO ] Performed 71/2802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 04:21:41] [INFO ] Performed 104/2802 implicitness test of which 0 returned IMPLICIT in 123 seconds.
[2025-06-01 04:21:41] [INFO ] Timeout of Implicit test with SMT after 123 seconds.
[2025-06-01 04:21:41] [INFO ] Implicit Places using invariants and state equation in 124477 ms returned []
Implicit Place search using SMT with State Equation took 125710 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 04:21:41] [INFO ] Redundant transitions in 67 ms returned []
Running 2697 sub problems to find dead transitions.
// Phase 1: matrix 2698 rows 2802 cols
[2025-06-01 04:21:42] [INFO ] Invariants computation overflowed in 75 ms
[2025-06-01 04:21:42] [INFO ] State equation strengthened by 198 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 timeout
1.0)
(s774 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2801/5500 variables, and 0 constraints, problems are : Problem set: 0 solved, 2697 unsolved in 30042 ms.
Refiners :[State Equation: 0/2802 constraints, ReadFeed: 0/198 constraints, PredecessorRefiner: 2697/2697 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2697 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2801/5500 variables, and 0 constraints, problems are : Problem set: 0 solved, 2697 unsolved in 30037 ms.
Refiners :[State Equation: 0/2802 constraints, ReadFeed: 0/198 constraints, PredecessorRefiner: 0/2697 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60813ms problems are : Problem set: 0 solved, 2697 unsolved
Search for dead transitions found 0 dead transitions in 60818ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 186744 ms. Remains : 2802/2802 places, 2698/2698 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8878 edges and 2802 vertex of which 2800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (5512 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3245 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 97615 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 1
Probabilistic random walk after 97615 steps, saw 48813 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 2698 rows 2802 cols
[2025-06-01 04:22:46] [INFO ] Invariants computation overflowed in 55 ms
[2025-06-01 04:22:46] [INFO ] State equation strengthened by 198 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/23 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/77 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 83/160 variables, 44/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 74/234 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 81/315 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 92/407 variables, 47/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/407 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/407 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/512 variables, 52/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/512 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/512 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 109/621 variables, 55/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/621 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/621 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 110/731 variables, 56/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/731 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/731 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 114/845 variables, 58/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/845 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/845 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 110/955 variables, 56/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/955 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/955 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 112/1067 variables, 57/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1067 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1067 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 110/1177 variables, 56/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1177 variables, 4/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1177 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 110/1287 variables, 56/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1287 variables, 4/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1287 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 110/1397 variables, 56/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1397 variables, 4/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1397 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 112/1509 variables, 57/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1509 variables, 4/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1509 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 110/1619 variables, 56/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1619 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1619 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 110/1729 variables, 56/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1729 variables, 4/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1729 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 110/1839 variables, 56/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1839 variables, 4/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1839 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 110/1949 variables, 56/1044 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1949 variables, 4/1048 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1949 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 110/2059 variables, 56/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2059 variables, 4/1108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2059 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 110/2169 variables, 56/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2169 variables, 4/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2169 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 110/2279 variables, 56/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2279 variables, 4/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2279 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 110/2389 variables, 56/1284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2389 variables, 4/1288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2389 variables, 0/1288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 112/2501 variables, 57/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2501 variables, 4/1349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2501 variables, 0/1349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 110/2611 variables, 56/1405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2611 variables, 4/1409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2611 variables, 0/1409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 110/2721 variables, 56/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2721 variables, 4/1469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2721 variables, 0/1469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 110/2831 variables, 56/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2831 variables, 4/1529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2831 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 110/2941 variables, 56/1585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2941 variables, 4/1589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2941 variables, 0/1589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 110/3051 variables, 56/1645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/3051 variables, 4/1649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/3051 variables, 0/1649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 110/3161 variables, 56/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/3161 variables, 4/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/3161 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 110/3271 variables, 56/1765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/3271 variables, 4/1769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/3271 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 110/3381 variables, 56/1825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/3381 variables, 4/1829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/3381 variables, 0/1829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 110/3491 variables, 56/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/3491 variables, 4/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/3491 variables, 0/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 110/3601 variables, 56/1945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/3601 variables, 4/1949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/3601 variables, 0/1949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 110/3711 variables, 56/2005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/3711 variables, 4/2009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/3711 variables, 0/2009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 108/3819 variables, 56/2065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/3819 variables, 3/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/3819 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 93/3912 variables, 50/2118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/3912 variables, 2/2120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/3912 variables, 0/2120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 63/3975 variables, 36/2156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/3975 variables, 2/2158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/3975 variables, 0/2158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 55/4030 variables, 28/2186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/4030 variables, 2/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/4030 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 55/4085 variables, 28/2216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/4085 variables, 2/2218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/4085 variables, 0/2218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 55/4140 variables, 28/2246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/4140 variables, 2/2248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4140/5500 variables, and 2248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5012 ms.
Refiners :[State Equation: 2101/2802 constraints, ReadFeed: 147/198 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/23 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/77 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 83/160 variables, 44/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 74/234 variables, 38/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 81/315 variables, 38/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 92/407 variables, 47/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/407 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 105/512 variables, 52/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/512 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/512 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 109/621 variables, 55/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/621 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/621 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/731 variables, 56/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/731 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/731 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 114/845 variables, 58/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/845 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/845 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 110/955 variables, 56/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/955 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/955 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 112/1067 variables, 57/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1067 variables, 4/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1067 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 110/1177 variables, 56/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1177 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1177 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 110/1287 variables, 56/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1287 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1287 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 110/1397 variables, 56/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1397 variables, 4/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1397 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 112/1509 variables, 57/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1509 variables, 4/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1509 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 110/1619 variables, 56/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1619 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1619 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 110/1729 variables, 56/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1729 variables, 4/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1729 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 110/1839 variables, 56/985 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1839 variables, 4/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:22:52] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:22:52] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/1839 variables, 2/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1839 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 110/1949 variables, 56/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1949 variables, 4/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1949 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 110/2059 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2059 variables, 4/1111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:22:53] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/2059 variables, 1/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2059 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 110/2169 variables, 56/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2169 variables, 4/1172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:22:53] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/2169 variables, 1/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2169 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 110/2279 variables, 56/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2279 variables, 4/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:22:53] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 74 (INCLUDED_ONLY) 0/2279 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2279 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 110/2389 variables, 56/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2389 variables, 4/1294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:22:54] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 0 ms to minimize.
At refinement iteration 78 (INCLUDED_ONLY) 0/2389 variables, 1/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2389 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 112/2501 variables, 57/1352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2501 variables, 4/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:22:54] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 82 (INCLUDED_ONLY) 0/2501 variables, 1/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2501 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 110/2611 variables, 56/1413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2611 variables, 4/1417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:22:54] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 86 (INCLUDED_ONLY) 0/2611 variables, 1/1418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2611 variables, 0/1418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 110/2721 variables, 56/1474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2721 variables, 4/1478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2721 variables, 0/1478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 110/2831 variables, 56/1534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2831 variables, 4/1538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:22:55] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 93 (INCLUDED_ONLY) 0/2831 variables, 1/1539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2831 variables, 0/1539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 110/2941 variables, 56/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2941 variables, 4/1599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2941 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 110/3051 variables, 56/1655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/3051 variables, 4/1659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:22:56] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 0 ms to minimize.
At refinement iteration 100 (INCLUDED_ONLY) 0/3051 variables, 1/1660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3051/5500 variables, and 1660 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5019 ms.
Refiners :[State Equation: 1539/2802 constraints, ReadFeed: 110/198 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 10/10 constraints]
After SMT, in 10104ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 2698/2698 transitions.
Graph (complete) has 8478 edges and 2802 vertex of which 2800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 2800 transition count 2694
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 2798 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 2798 transition count 2693
Deduced a syphon composed of 1 places in 40 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 2797 transition count 2693
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 41 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 2794 transition count 2690
Free-agglomeration rule (complex) applied 393 times.
Iterating global reduction 2 with 393 rules applied. Total rules applied 408 place count 2794 transition count 2297
Reduce places removed 393 places and 0 transitions.
Iterating post reduction 2 with 393 rules applied. Total rules applied 801 place count 2401 transition count 2297
Partial Free-agglomeration rule applied 399 times.
Drop transitions (Partial Free agglomeration) removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1200 place count 2401 transition count 2297
Applied a total of 1200 rules in 636 ms. Remains 2401 /2802 variables (removed 401) and now considering 2297/2698 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 636 ms. Remains : 2401/2802 places, 2297/2698 transitions.
RANDOM walk for 40000 steps (5079 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3338 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 119172 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 1
Probabilistic random walk after 119172 steps, saw 59633 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 2297 rows 2401 cols
[2025-06-01 04:23:00] [INFO ] Invariants computation overflowed in 70 ms
[2025-06-01 04:23:00] [INFO ] State equation strengthened by 398 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 645/649 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/649 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2603/3252 variables, 1205/1281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3252 variables, 201/1482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3252 variables, 0/1482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860067600507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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