Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067600514.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-200, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067600514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K 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 3.5M 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-200-CTLFireability-2023-12
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2023-13
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2023-14
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2023-15
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-00
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-01
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-02
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-03
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-04
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-05
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-06
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-07
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-08
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-09
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-10
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748752274645

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-01 04:31:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 04:31:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 04:31:16] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2025-06-01 04:31:16] [INFO ] Transformed 10604 places.
[2025-06-01 04:31:16] [INFO ] Transformed 9998 transitions.
[2025-06-01 04:31:16] [INFO ] Parsed PT model containing 10604 places and 9998 transitions and 28194 arcs in 497 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 169 out of 10604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 10600 transition count 9998
Applied a total of 4 rules in 3675 ms. Remains 10600 /10604 variables (removed 4) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 04:31:23] [INFO ] Invariants computation overflowed in 332 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:31:28] [INFO ] Implicit Places using invariants in 5438 ms returned []
Implicit Place search using SMT only with invariants took 5482 ms to find 0 implicit places.
Running 9997 sub problems to find dead transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 04:31:29] [INFO ] Invariants computation overflowed in 299 ms
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 Real declared 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30195 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 9997/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9997 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 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30136 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 0/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69144ms problems are : Problem set: 0 solved, 9997 unsolved
Search for dead transitions found 0 dead transitions in 69201ms
Starting structural reductions in LTL mode, iteration 1 : 10600/10604 places, 9998/9998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78421 ms. Remains : 10600/10604 places, 9998/9998 transitions.
Support contains 169 out of 10600 places after structural reductions.
[2025-06-01 04:32:40] [INFO ] Flatten gal took : 545 ms
[2025-06-01 04:32:40] [INFO ] Flatten gal took : 332 ms
[2025-06-01 04:32:41] [INFO ] Input system was already deterministic with 9998 transitions.
Support contains 158 out of 10600 places (down from 169) after GAL structural reductions.
RANDOM walk for 40000 steps (1304 resets) in 1581 ms. (25 steps per ms) remains 87/88 properties
BEST_FIRST walk for 4001 steps (106 resets) in 198 ms. (20 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (104 resets) in 53 ms. (74 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (117 resets) in 63 ms. (62 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (108 resets) in 124 ms. (32 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (112 resets) in 47 ms. (83 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (112 resets) in 48 ms. (81 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (106 resets) in 54 ms. (72 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 47 ms. (83 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (111 resets) in 45 ms. (86 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (108 resets) in 42 ms. (93 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (115 resets) in 50 ms. (78 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (112 resets) in 227 ms. (17 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (114 resets) in 46 ms. (85 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (117 resets) in 49 ms. (80 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (111 resets) in 44 ms. (88 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (116 resets) in 60 ms. (65 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (109 resets) in 59 ms. (66 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (115 resets) in 60 ms. (65 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (108 resets) in 60 ms. (65 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (112 resets) in 64 ms. (61 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (105 resets) in 65 ms. (60 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (106 resets) in 68 ms. (57 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (118 resets) in 67 ms. (58 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (110 resets) in 57 ms. (68 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (110 resets) in 52 ms. (75 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (106 resets) in 62 ms. (63 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 57 ms. (68 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (108 resets) in 68 ms. (57 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (107 resets) in 60 ms. (65 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (113 resets) in 50 ms. (78 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (112 resets) in 68 ms. (57 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (104 resets) in 70 ms. (56 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (108 resets) in 67 ms. (58 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (120 resets) in 70 ms. (56 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (112 resets) in 72 ms. (54 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (114 resets) in 66 ms. (59 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (113 resets) in 255 ms. (15 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (108 resets) in 61 ms. (64 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (112 resets) in 62 ms. (63 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 57 ms. (68 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (107 resets) in 49 ms. (80 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (113 resets) in 50 ms. (78 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (107 resets) in 49 ms. (80 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 48 ms. (81 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (105 resets) in 42 ms. (93 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (114 resets) in 44 ms. (88 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (113 resets) in 38 ms. (102 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (113 resets) in 41 ms. (95 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 40 ms. (97 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (119 resets) in 43 ms. (90 steps per ms) remains 87/87 properties
Interrupted probabilistic random walk after 31998 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 87
Probabilistic random walk after 31998 steps, saw 16005 distinct states, run finished after 3007 ms. (steps per millisecond=10 ) properties seen :0
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 04:32:50] [INFO ] Invariants computation overflowed in 264 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/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 409/566 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1700/2266 variables, 674/831 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2266 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 3340/5606 variables, 1520/2351 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5606/20598 variables, and 2351 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5018 ms.
Refiners :[State Equation: 2351/10600 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 409/566 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1700/2266 variables, 674/831 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2266 variables, 87/918 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 2266/20598 variables, and 918 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5016 ms.
Refiners :[State Equation: 831/10600 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10488ms problems are : Problem set: 0 solved, 87 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 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 2243 transitions
Trivial Post-agglo rules discarded 2243 transitions
Performed 2243 trivial Post agglomeration. Transition count delta: 2243
Iterating post reduction 0 with 2246 rules applied. Total rules applied 2247 place count 10597 transition count 7753
Reduce places removed 2243 places and 0 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Iterating post reduction 1 with 2292 rules applied. Total rules applied 4539 place count 8354 transition count 7704
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 4588 place count 8305 transition count 7704
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 408 Pre rules applied. Total rules applied 4588 place count 8305 transition count 7296
Deduced a syphon composed of 408 places in 1342 ms
Reduce places removed 408 places and 0 transitions.
Iterating global reduction 3 with 816 rules applied. Total rules applied 5404 place count 7897 transition count 7296
Performed 1725 Post agglomeration using F-continuation condition.Transition count delta: 1725
Deduced a syphon composed of 1725 places in 274 ms
Reduce places removed 1725 places and 0 transitions.
Iterating global reduction 3 with 3450 rules applied. Total rules applied 8854 place count 6172 transition count 5571
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 254 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9056 place count 6071 transition count 5571
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 465 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9258 place count 5970 transition count 5571
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 387 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9460 place count 5869 transition count 5571
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 72 places in 383 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 9604 place count 5797 transition count 5571
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 9611 place count 5797 transition count 5564
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 9618 place count 5790 transition count 5564
Free-agglomeration rule (complex) applied 824 times.
Iterating global reduction 4 with 824 rules applied. Total rules applied 10442 place count 5790 transition count 4740
Reduce places removed 824 places and 0 transitions.
Iterating post reduction 4 with 824 rules applied. Total rules applied 11266 place count 4966 transition count 4740
Partial Free-agglomeration rule applied 798 times.
Drop transitions (Partial Free agglomeration) removed 798 transitions
Iterating global reduction 5 with 798 rules applied. Total rules applied 12064 place count 4966 transition count 4740
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 12065 place count 4965 transition count 4739
Applied a total of 12065 rules in 9979 ms. Remains 4965 /10600 variables (removed 5635) and now considering 4739/9998 (removed 5259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9981 ms. Remains : 4965/10600 places, 4739/9998 transitions.
RANDOM walk for 40000 steps (5114 resets) in 973 ms. (41 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (339 resets) in 48 ms. (81 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (367 resets) in 31 ms. (125 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (331 resets) in 45 ms. (86 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (361 resets) in 46 ms. (85 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (336 resets) in 55 ms. (71 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (340 resets) in 53 ms. (74 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (325 resets) in 55 ms. (71 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (343 resets) in 42 ms. (93 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (351 resets) in 55 ms. (71 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (329 resets) in 50 ms. (78 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (328 resets) in 42 ms. (93 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (340 resets) in 41 ms. (95 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (343 resets) in 41 ms. (95 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (326 resets) in 51 ms. (76 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (354 resets) in 38 ms. (102 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (335 resets) in 44 ms. (88 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (344 resets) in 49 ms. (80 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (333 resets) in 43 ms. (90 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (337 resets) in 47 ms. (83 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (359 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (335 resets) in 35 ms. (111 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (341 resets) in 27 ms. (142 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (344 resets) in 28 ms. (138 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (343 resets) in 30 ms. (129 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (335 resets) in 30 ms. (129 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (318 resets) in 30 ms. (129 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (331 resets) in 29 ms. (133 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (341 resets) in 31 ms. (125 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (337 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (329 resets) in 29 ms. (133 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (348 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (337 resets) in 30 ms. (129 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (349 resets) in 28 ms. (138 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (347 resets) in 27 ms. (142 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (324 resets) in 27 ms. (142 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (333 resets) in 30 ms. (129 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (351 resets) in 29 ms. (133 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (358 resets) in 26 ms. (148 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (323 resets) in 26 ms. (148 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (331 resets) in 26 ms. (148 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (336 resets) in 25 ms. (153 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (308 resets) in 28 ms. (137 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (336 resets) in 28 ms. (137 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (343 resets) in 27 ms. (142 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (342 resets) in 27 ms. (142 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (337 resets) in 30 ms. (129 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (332 resets) in 35 ms. (111 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (349 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (349 resets) in 31 ms. (125 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (336 resets) in 31 ms. (125 steps per ms) remains 87/87 properties
Interrupted probabilistic random walk after 54618 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 87
Probabilistic random walk after 54618 steps, saw 27322 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
// Phase 1: matrix 4739 rows 4965 cols
[2025-06-01 04:33:15] [INFO ] Invariants computation overflowed in 118 ms
[2025-06-01 04:33:15] [INFO ] State equation strengthened by 750 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/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 547/704 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 3397/4101 variables, 1213/1385 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4101 variables, 124/1509 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4101 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8852/9704 variables, and 4400 constraints, problems are : Problem set: 0 solved, 87 unsolved in 45053 ms.
Refiners :[State Equation: 4261/4965 constraints, ReadFeed: 139/750 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 547/704 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 3397/4101 variables, 1213/1385 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4101 variables, 124/1509 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4101 variables, 76/1585 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4101/9704 variables, and 1585 constraints, problems are : Problem set: 0 solved, 87 unsolved in 45027 ms.
Refiners :[State Equation: 1370/4965 constraints, ReadFeed: 139/750 constraints, PredecessorRefiner: 76/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90288ms problems are : Problem set: 0 solved, 87 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 4965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4965/4965 places, 4739/4739 transitions.
Applied a total of 0 rules in 560 ms. Remains 4965 /4965 variables (removed 0) and now considering 4739/4739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 4965/4965 places, 4739/4739 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4965/4965 places, 4739/4739 transitions.
Applied a total of 0 rules in 538 ms. Remains 4965 /4965 variables (removed 0) and now considering 4739/4739 (removed 0) transitions.
// Phase 1: matrix 4739 rows 4965 cols
[2025-06-01 04:34:46] [INFO ] Invariants computation overflowed in 123 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:34:57] [INFO ] Implicit Places using invariants in 11303 ms returned []
// Phase 1: matrix 4739 rows 4965 cols
[2025-06-01 04:34:57] [INFO ] Invariants computation overflowed in 113 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:35:00] [INFO ] State equation strengthened by 750 read => feed constraints.
[2025-06-01 04:37:37] [INFO ] Performed 2/4965 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2025-06-01 04:37:37] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2025-06-01 04:37:37] [INFO ] Implicit Places using invariants and state equation in 160256 ms returned []
Implicit Place search using SMT with State Equation took 171560 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 04:37:38] [INFO ] Redundant transitions in 337 ms returned []
Running 4738 sub problems to find dead transitions.
// Phase 1: matrix 4739 rows 4965 cols
[2025-06-01 04:37:38] [INFO ] Invariants computation overflowed in 129 ms
[2025-06-01 04:37:38] [INFO ] State equation strengthened by 750 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 Real declared 4964/9704 variables, and 0 constraints, problems are : Problem set: 0 solved, 4738 unsolved in 30068 ms.
Refiners :[State Equation: 0/4965 constraints, ReadFeed: 0/750 constraints, PredecessorRefiner: 4738/4180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4738 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 4964/9704 variables, and 0 constraints, problems are : Problem set: 0 solved, 4738 unsolved in 30078 ms.
Refiners :[State Equation: 0/4965 constraints, ReadFeed: 0/750 constraints, PredecessorRefiner: 558/4180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64366ms problems are : Problem set: 0 solved, 4738 unsolved
Search for dead transitions found 0 dead transitions in 64392ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236856 ms. Remains : 4965/4965 places, 4739/4739 transitions.
[2025-06-01 04:38:43] [INFO ] Flatten gal took : 274 ms
[2025-06-01 04:38:43] [INFO ] Flatten gal took : 265 ms
[2025-06-01 04:38:44] [INFO ] Input system was already deterministic with 9998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.48 ms
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4415 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 04:38:48] [INFO ] Invariants computation overflowed in 334 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:38:53] [INFO ] Implicit Places using invariants in 5338 ms returned []
Implicit Place search using SMT only with invariants took 5339 ms to find 0 implicit places.
Running 9997 sub problems to find dead transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 04:38:54] [INFO ] Invariants computation overflowed in 278 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 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30108 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 9997/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9997 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 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30125 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 0/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69365ms problems are : Problem set: 0 solved, 9997 unsolved
Search for dead transitions found 0 dead transitions in 69390ms
Finished structural reductions in LTL mode , in 1 iterations and 79168 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2025-06-01 04:40:03] [INFO ] Flatten gal took : 236 ms
[2025-06-01 04:40:03] [INFO ] Flatten gal took : 220 ms
[2025-06-01 04:40:04] [INFO ] Input system was already deterministic with 9998 transitions.
[2025-06-01 04:40:04] [INFO ] Flatten gal took : 234 ms
[2025-06-01 04:40:04] [INFO ] Flatten gal took : 247 ms
[2025-06-01 04:40:04] [INFO ] Time to serialize gal into /tmp/CTLFireability261504498800584227.gal : 87 ms
[2025-06-01 04:40:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14678449152321312340.ctl : 6 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability261504498800584227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14678449152321312340.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 04:40:35] [INFO ] Flatten gal took : 214 ms
[2025-06-01 04:40:35] [INFO ] Applying decomposition
[2025-06-01 04:40:35] [INFO ] Flatten gal took : 219 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/graph6774926983532941945.txt' '-o' '/tmp/graph6774926983532941945.bin' '-w' '/tmp/graph6774926983532941945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6774926983532941945.bin' '-l' '-1' '-v' '-w' '/tmp/graph6774926983532941945.weights' '-q' '0' '-e' '0.001'
[2025-06-01 04:40:36] [INFO ] Decomposing Gal with order
[2025-06-01 04:40:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 04:40:46] [INFO ] Removed a total of 2860 redundant transitions.
[2025-06-01 04:40:47] [INFO ] Flatten gal took : 653 ms
[2025-06-01 04:40:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 164 labels/synchronizations in 292 ms.
[2025-06-01 04:40:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14900634723962276937.gal : 134 ms
[2025-06-01 04:40:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7760920184201444698.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14900634723962276937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7760920184201444698.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2398 transitions
Trivial Post-agglo rules discarded 2398 transitions
Performed 2398 trivial Post agglomeration. Transition count delta: 2398
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2398 place count 10599 transition count 7599
Reduce places removed 2398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4797 place count 8201 transition count 7598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4798 place count 8200 transition count 7598
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4798 place count 8200 transition count 7198
Deduced a syphon composed of 400 places in 1262 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5598 place count 7800 transition count 7198
Performed 1401 Post agglomeration using F-continuation condition.Transition count delta: 1401
Deduced a syphon composed of 1401 places in 569 ms
Reduce places removed 1401 places and 0 transitions.
Iterating global reduction 3 with 2802 rules applied. Total rules applied 8400 place count 6399 transition count 5797
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8401 place count 6398 transition count 5796
Applied a total of 8401 rules in 5491 ms. Remains 6398 /10600 variables (removed 4202) and now considering 5796/9998 (removed 4202) transitions.
// Phase 1: matrix 5796 rows 6398 cols
[2025-06-01 04:41:23] [INFO ] Invariants computation overflowed in 213 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:41:27] [INFO ] Implicit Places using invariants in 3726 ms returned []
// Phase 1: matrix 5796 rows 6398 cols
[2025-06-01 04:41:27] [INFO ] Invariants computation overflowed in 216 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:41:31] [INFO ] State equation strengthened by 398 read => feed constraints.
[2025-06-01 04:43:15] [INFO ] Performed 1/6398 implicitness test of which 0 returned IMPLICIT in 104 seconds.
[2025-06-01 04:44:07] [INFO ] Implicit Places using invariants and state equation in 160407 ms returned []
Implicit Place search using SMT with State Equation took 164136 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 04:44:08] [INFO ] Redundant transitions in 506 ms returned []
Running 5795 sub problems to find dead transitions.
// Phase 1: matrix 5796 rows 6398 cols
[2025-06-01 04:44:08] [INFO ] Invariants computation overflowed in 193 ms
[2025-06-01 04:44:08] [INFO ] State equation strengthened by 398 read => feed constraints.
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 Real declared 6397/12194 variables, and 0 constraints, problems are : Problem set: 0 solved, 5795 unsolved in 30087 ms.
Refiners :[State Equation: 0/6398 constraints, ReadFeed: 0/398 constraints, PredecessorRefiner: 5795/5795 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5795 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 6397/12194 variables, and 0 constraints, problems are : Problem set: 0 solved, 5795 unsolved in 30067 ms.
Refiners :[State Equation: 0/6398 constraints, ReadFeed: 0/398 constraints, PredecessorRefiner: 0/5795 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63418ms problems are : Problem set: 0 solved, 5795 unsolved
Search for dead transitions found 0 dead transitions in 63431ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6398/10600 places, 5796/9998 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 233591 ms. Remains : 6398/10600 places, 5796/9998 transitions.
[2025-06-01 04:45:11] [INFO ] Flatten gal took : 148 ms
[2025-06-01 04:45:11] [INFO ] Flatten gal took : 156 ms
[2025-06-01 04:45:12] [INFO ] Input system was already deterministic with 5796 transitions.
RANDOM walk for 40000 steps (4119 resets) in 375 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2668 resets) in 343 ms. (116 steps per ms) remains 1/1 properties
[2025-06-01 04:45:12] [INFO ] Flatten gal took : 320 ms
[2025-06-01 04:45:12] [INFO ] Flatten gal took : 160 ms
[2025-06-01 04:45:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6587708352393656646.gal : 24 ms
[2025-06-01 04:45:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13704913130903093011.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6587708352393656646.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13704913130903093011.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13704913130903093011.prop.
Interrupted probabilistic random walk after 66309 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 66309 steps, saw 33165 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 5796 rows 6398 cols
[2025-06-01 04:45:15] [INFO ] Invariants computation overflowed in 228 ms
[2025-06-01 04:45:15] [INFO ] State equation strengthened by 398 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/31 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/83 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 97/180 variables, 47/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 96/276 variables, 52/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 98/374 variables, 51/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/374 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/374 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 114/488 variables, 59/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 119/607 variables, 62/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/607 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/607 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 122/729 variables, 64/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/729 variables, 4/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/729 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 122/851 variables, 64/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/851 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/851 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 122/973 variables, 64/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/973 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/973 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 122/1095 variables, 64/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1095 variables, 4/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1095 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 122/1217 variables, 64/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1217 variables, 4/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1217 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 122/1339 variables, 64/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1339 variables, 4/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1339 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 122/1461 variables, 64/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1461 variables, 4/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1461 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 122/1583 variables, 64/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1583 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1583 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 122/1705 variables, 64/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1705 variables, 4/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1705 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 122/1827 variables, 64/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1827 variables, 4/1003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1827 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 122/1949 variables, 64/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1949 variables, 4/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1949 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 122/2071 variables, 64/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2071 variables, 4/1139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2071 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 122/2193 variables, 64/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2193 variables, 4/1207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2193 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 122/2315 variables, 64/1271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2315 variables, 4/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2315 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 122/2437 variables, 64/1339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2437 variables, 4/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2437 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 122/2559 variables, 64/1407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2559 variables, 4/1411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2559 variables, 0/1411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 122/2681 variables, 64/1475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2681 variables, 4/1479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2681 variables, 0/1479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 122/2803 variables, 64/1543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2803 variables, 4/1547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2803 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 122/2925 variables, 64/1611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2925 variables, 4/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2925 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 122/3047 variables, 64/1679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/3047 variables, 4/1683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/3047 variables, 0/1683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 122/3169 variables, 64/1747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/3169 variables, 4/1751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/3169 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 122/3291 variables, 64/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/3291 variables, 4/1819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/3291 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 122/3413 variables, 64/1883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/3413 variables, 4/1887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/3413 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 122/3535 variables, 64/1951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/3535 variables, 4/1955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/3535 variables, 0/1955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 122/3657 variables, 64/2019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/3657 variables, 4/2023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/3657 variables, 0/2023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 122/3779 variables, 64/2087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/3779 variables, 4/2091 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/3779 variables, 0/2091 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 122/3901 variables, 64/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/3901 variables, 4/2159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/3901 variables, 0/2159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 122/4023 variables, 64/2223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/4023 variables, 4/2227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/4023 variables, 0/2227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 122/4145 variables, 64/2291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/4145 variables, 4/2295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/4145 variables, 0/2295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 122/4267 variables, 64/2359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/4267 variables, 4/2363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/4267 variables, 0/2363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 122/4389 variables, 64/2427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/4389 variables, 4/2431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/4389 variables, 0/2431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 122/4511 variables, 64/2495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/4511 variables, 4/2499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/4511 variables, 0/2499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 122/4633 variables, 64/2563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4633/12194 variables, and 2567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5023 ms.
Refiners :[State Equation: 2418/6398 constraints, ReadFeed: 149/398 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/31 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/83 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 97/180 variables, 47/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 96/276 variables, 52/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 98/374 variables, 51/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/374 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/374 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 114/488 variables, 59/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/488 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 119/607 variables, 62/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/607 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/607 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 122/729 variables, 64/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/729 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/729 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 122/851 variables, 64/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/851 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/851 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 122/973 variables, 64/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/973 variables, 4/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/973 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 122/1095 variables, 64/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1095 variables, 4/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1095 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 122/1217 variables, 64/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1217 variables, 4/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1217 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 122/1339 variables, 64/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1339 variables, 4/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1339 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 122/1461 variables, 64/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1461 variables, 4/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1461 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 122/1583 variables, 64/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1583 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1583 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 122/1705 variables, 64/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1705 variables, 4/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1705 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 122/1827 variables, 64/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1827 variables, 4/1004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1827 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 122/1949 variables, 64/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1949 variables, 4/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1949 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 122/2071 variables, 64/1136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2071 variables, 4/1140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2071 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 122/2193 variables, 64/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2193/12194 variables, and 1208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3146 ms.
Refiners :[State Equation: 1138/6398 constraints, ReadFeed: 69/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8426ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 6398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6398/6398 places, 5796/5796 transitions.
Graph (complete) has 16179 edges and 6398 vertex of which 6396 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
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 6395 transition count 5794
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 6395 transition count 5793
Deduced a syphon composed of 1 places in 556 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 6394 transition count 5793
Performed 403 Post agglomeration using F-continuation condition.Transition count delta: 403
Deduced a syphon composed of 403 places in 446 ms
Reduce places removed 403 places and 0 transitions.
Iterating global reduction 1 with 806 rules applied. Total rules applied 812 place count 5991 transition count 5390
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 398 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 1 with 202 rules applied. Total rules applied 1014 place count 5890 transition count 5390
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 373 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 1 with 202 rules applied. Total rules applied 1216 place count 5789 transition count 5390
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 352 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 1 with 202 rules applied. Total rules applied 1418 place count 5688 transition count 5390
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 326 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 1 with 190 rules applied. Total rules applied 1608 place count 5593 transition count 5390
Free-agglomeration rule (complex) applied 794 times.
Iterating global reduction 1 with 794 rules applied. Total rules applied 2402 place count 5593 transition count 4596
Reduce places removed 794 places and 0 transitions.
Iterating post reduction 1 with 794 rules applied. Total rules applied 3196 place count 4799 transition count 4596
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions (Partial Free agglomeration) removed 801 transitions
Iterating global reduction 2 with 801 rules applied. Total rules applied 3997 place count 4799 transition count 4596
Applied a total of 3997 rules in 7187 ms. Remains 4799 /6398 variables (removed 1599) and now considering 4596/5796 (removed 1200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7188 ms. Remains : 4799/6398 places, 4596/5796 transitions.
RANDOM walk for 4000000 steps (508434 resets) in 16942 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (336253 resets) in 10492 ms. (381 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 48
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :48 after 100
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :100 after 493
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :493 after 1557
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1557 after 14207
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :14207 after 119372
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :119372 after 416826
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :416826 after 951702
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :951702 after 5.93996e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :5.93996e+07 after 6.92261e+08
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :6.92261e+08 after 3.09919e+09
Interrupted probabilistic random walk after 578042 steps, run timeout after 21001 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 578042 steps, saw 289212 distinct states, run finished after 21001 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 04:45:59] [INFO ] Invariants computation overflowed in 84 ms
[2025-06-01 04:45:59] [INFO ] State equation strengthened by 798 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1360/1368 variables, 183/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1368 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :3.09919e+09 after 1.08343e+10
At refinement iteration 5 (OVERLAPS) 5258/6626 variables, 2462/2647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6626 variables, 404/3051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6626 variables, 0/3051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.08343e+10 after 2.9993e+10
After SMT solving in domain Real declared 9395/9395 variables, and 5203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45017 ms.
Refiners :[State Equation: 4799/4799 constraints, ReadFeed: 404/798 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1360/1368 variables, 183/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1368 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1368 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5258/6626 variables, 2462/2648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6626 variables, 404/3052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6626 variables, 0/3052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :2.9993e+10 after 7.28939e+10
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9395/9395 variables, and 5204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33145 ms.
Refiners :[State Equation: 4799/4799 constraints, ReadFeed: 404/798 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 78384ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 4799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 795 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 796 ms. Remains : 4799/4799 places, 4596/4596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 762 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 04:47:19] [INFO ] Invariants computation overflowed in 93 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:47:50] [INFO ] Performed 2938/4799 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 04:48:11] [INFO ] Implicit Places using invariants in 51997 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 04:48:11] [INFO ] Invariants computation overflowed in 88 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:48:15] [INFO ] State equation strengthened by 798 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :7.28939e+10 after 1.58769e+11
[2025-06-01 04:50:51] [INFO ] Performed 2/4799 implicitness test of which 0 returned IMPLICIT in 156 seconds.
[2025-06-01 04:50:51] [INFO ] Timeout of Implicit test with SMT after 156 seconds.
[2025-06-01 04:50:51] [INFO ] Implicit Places using invariants and state equation in 160231 ms returned []
Implicit Place search using SMT with State Equation took 212232 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 04:50:52] [INFO ] Redundant transitions in 237 ms returned []
Running 4595 sub problems to find dead transitions.
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 04:50:52] [INFO ] Invariants computation overflowed in 94 ms
[2025-06-01 04:50:52] [INFO ] State equation strengthened by 798 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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)
(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)
(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)timeout

(s1796 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4798/9395 variables, and 0 constraints, problems are : Problem set: 0 solved, 4595 unsolved in 30062 ms.
Refiners :[State Equation: 0/4799 constraints, ReadFeed: 0/798 constraints, PredecessorRefiner: 4595/3588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4595 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 4798/9395 variables, and 0 constraints, problems are : Problem set: 0 solved, 4595 unsolved in 30063 ms.
Refiners :[State Equation: 0/4799 constraints, ReadFeed: 0/798 constraints, PredecessorRefiner: 1007/3588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64916ms problems are : Problem set: 0 solved, 4595 unsolved
Search for dead transitions found 0 dead transitions in 64947ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278213 ms. Remains : 4799/4799 places, 4596/4596 transitions.
RANDOM walk for 400000 steps (51045 resets) in 3052 ms. (131 steps per ms) remains 2/2 properties
Running SMT prover for 2 properties.
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 04:51:58] [INFO ] Invariants computation overflowed in 88 ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 04:52:06] [INFO ] After 7487ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-06-01 04:52:06] [INFO ] State equation strengthened by 798 read => feed constraints.
[2025-06-01 04:52:52] [INFO ] After 46206ms SMT Verify possible using 798 Read/Feed constraints in real domain returned unsat :0 sat :0
[2025-06-01 04:52:52] [INFO ] After 54198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
RANDOM walk for 4000000 steps (509072 resets) in 17591 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (337109 resets) in 10439 ms. (383 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 577203 steps, run timeout after 21001 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 577203 steps, saw 288790 distinct states, run finished after 21001 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 04:53:21] [INFO ] Invariants computation overflowed in 92 ms
[2025-06-01 04:53:21] [INFO ] State equation strengthened by 798 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1360/1368 variables, 183/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1368 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5258/6626 variables, 2462/2647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6626 variables, 404/3051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6626 variables, 0/3051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9395/9395 variables, and 5203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27145 ms.
Refiners :[State Equation: 4799/4799 constraints, ReadFeed: 404/798 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1360/1368 variables, 183/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1368 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1368 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5258/6626 variables, 2462/2648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6626 variables, 404/3052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6626 variables, 0/3052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4194304
SDD size :1.58769e+11 after 3.20675e+11
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9395/9395 variables, and 5204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37004 ms.
Refiners :[State Equation: 4799/4799 constraints, ReadFeed: 404/798 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64288ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 4799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 807 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 807 ms. Remains : 4799/4799 places, 4596/4596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 765 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 04:54:27] [INFO ] Invariants computation overflowed in 92 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:54:57] [INFO ] Performed 2970/4799 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2025-06-01 04:55:13] [INFO ] Flatten gal took : 153 ms
[2025-06-01 04:55:13] [INFO ] Applying decomposition
[2025-06-01 04:55:13] [INFO ] Flatten gal took : 162 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/graph861540438115529766.txt' '-o' '/tmp/graph861540438115529766.bin' '-w' '/tmp/graph861540438115529766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph861540438115529766.bin' '-l' '-1' '-v' '-w' '/tmp/graph861540438115529766.weights' '-q' '0' '-e' '0.001'
[2025-06-01 04:55:13] [INFO ] Decomposing Gal with order
[2025-06-01 04:55:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 04:55:16] [INFO ] Removed a total of 1295 redundant transitions.
[2025-06-01 04:55:16] [INFO ] Flatten gal took : 237 ms
[2025-06-01 04:55:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 35 ms.
[2025-06-01 04:55:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5359891735582684414.gal : 56 ms
[2025-06-01 04:55:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4077144523823262365.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5359891735582684414.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4077144523823262365.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4077144523823262365.prop.
[2025-06-01 04:55:18] [INFO ] Implicit Places using invariants in 51161 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 04:55:18] [INFO ] Invariants computation overflowed in 95 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 04:55:21] [INFO ] State equation strengthened by 798 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 530
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :530 after 2193
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2193 after 2502
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2502 after 1.45015e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.45015e+06 after 2.30857e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.30857e+06 after 7.51644e+06
[2025-06-01 04:57:58] [INFO ] Performed 2/4799 implicitness test of which 0 returned IMPLICIT in 156 seconds.
[2025-06-01 04:57:58] [INFO ] Timeout of Implicit test with SMT after 156 seconds.
[2025-06-01 04:57:58] [INFO ] Implicit Places using invariants and state equation in 160217 ms returned []
Implicit Place search using SMT with State Equation took 211380 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 04:57:58] [INFO ] Redundant transitions in 256 ms returned []
Running 4595 sub problems to find dead transitions.
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 04:57:58] [INFO ] Invariants computation overflowed in 84 ms
[2025-06-01 04:57:58] [INFO ] State equation strengthened by 798 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 Real declared 4798/9395 variables, and 0 constraints, problems are : Problem set: 0 solved, 4595 unsolved in 30067 ms.
Refiners :[State Equation: 0/4799 constraints, ReadFeed: 0/798 constraints, PredecessorRefiner: 4595/3588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4595 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 4798/9395 variables, and 0 constraints, problems are : Problem set: 0 solved, 4595 unsolved in 30063 ms.
Refiners :[State Equation: 0/4799 constraints, ReadFeed: 0/798 constraints, PredecessorRefiner: 1007/3588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64936ms problems are : Problem set: 0 solved, 4595 unsolved
Search for dead transitions found 0 dead transitions in 64976ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277439 ms. Remains : 4799/4799 places, 4596/4596 transitions.
RANDOM walk for 400000 steps (50965 resets) in 1923 ms. (207 steps per ms) remains 2/2 properties
Running SMT prover for 2 properties.
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 04:59:04] [INFO ] Invariants computation overflowed in 86 ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 04:59:13] [INFO ] After 7712ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-06-01 04:59:13] [INFO ] State equation strengthened by 798 read => feed constraints.
[2025-06-01 05:00:01] [INFO ] After 48281ms SMT Verify possible using 798 Read/Feed constraints in real domain returned unsat :0 sat :0
[2025-06-01 05:00:01] [INFO ] After 56504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
RANDOM walk for 40000 steps (5164 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3331 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 83494 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 83494 steps, saw 41763 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 05:00:05] [INFO ] Invariants computation overflowed in 93 ms
[2025-06-01 05:00:05] [INFO ] State equation strengthened by 798 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 797/802 variables, 181/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/802 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3823/9395 variables, and 1410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1851 ms.
Refiners :[State Equation: 1410/4799 constraints, ReadFeed: 0/798 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 797/802 variables, 181/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/802 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3823/9395 variables, and 1411 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1665 ms.
Refiners :[State Equation: 1410/4799 constraints, ReadFeed: 0/798 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3657ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 4799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4799 transition count 4594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 4797 transition count 4594
Applied a total of 4 rules in 2245 ms. Remains 4797 /4799 variables (removed 2) and now considering 4594/4596 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2248 ms. Remains : 4797/4799 places, 4594/4596 transitions.
RANDOM walk for 40000 steps (5122 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3338 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 84317 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 84317 steps, saw 42168 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 4594 rows 4797 cols
[2025-06-01 05:00:15] [INFO ] Invariants computation overflowed in 59 ms
[2025-06-01 05:00:15] [INFO ] State equation strengthened by 798 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1358/1363 variables, 181/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1363 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5259/6622 variables, 2463/2645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6622/9391 variables, and 3049 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21977 ms.
Refiners :[State Equation: 2645/4797 constraints, ReadFeed: 404/798 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 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1358/1363 variables, 181/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1363 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1363 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5259/6622 variables, 2463/2646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6622/9391 variables, and 3050 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12677 ms.
Refiners :[State Equation: 2645/4797 constraints, ReadFeed: 404/798 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34782ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 4797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4594/4594 transitions.
Applied a total of 0 rules in 1435 ms. Remains 4797 /4797 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1437 ms. Remains : 4797/4797 places, 4594/4594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4594/4594 transitions.
Applied a total of 0 rules in 1407 ms. Remains 4797 /4797 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
// Phase 1: matrix 4594 rows 4797 cols
[2025-06-01 05:00:53] [INFO ] Invariants computation overflowed in 66 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:01:23] [INFO ] Performed 889/4797 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 05:01:54] [INFO ] Performed 1626/4797 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-01 05:02:24] [INFO ] Performed 2406/4797 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-01 05:02:54] [INFO ] Performed 3313/4797 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2025-06-01 05:02:54] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2025-06-01 05:02:54] [INFO ] Implicit Places using invariants in 121559 ms returned []
// Phase 1: matrix 4594 rows 4797 cols
[2025-06-01 05:02:54] [INFO ] Invariants computation overflowed in 84 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:02:58] [INFO ] State equation strengthened by 798 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-01 05:05:34] [INFO ] Performed 2/4797 implicitness test of which 0 returned IMPLICIT in 156 seconds.
[2025-06-01 05:05:34] [INFO ] Timeout of Implicit test with SMT after 156 seconds.
[2025-06-01 05:05:34] [INFO ] Implicit Places using invariants and state equation in 160221 ms returned []
Implicit Place search using SMT with State Equation took 281796 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:05:35] [INFO ] Redundant transitions in 439 ms returned []
Running 4593 sub problems to find dead transitions.
// Phase 1: matrix 4594 rows 4797 cols
[2025-06-01 05:05:35] [INFO ] Invariants computation overflowed in 66 ms
[2025-06-01 05:05:35] [INFO ] State equation strengthened by 798 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 4796/9391 variables, and 0 constraints, problems are : Problem set: 0 solved, 4593 unsolved in 30062 ms.
Refiners :[State Equation: 0/4797 constraints, ReadFeed: 0/798 constraints, PredecessorRefiner: 4593/3495 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4593 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 4796/9391 variables, and 0 constraints, problems are : Problem set: 0 solved, 4593 unsolved in 30059 ms.
Refiners :[State Equation: 0/4797 constraints, ReadFeed: 0/798 constraints, PredecessorRefiner: 1098/3495 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65649ms problems are : Problem set: 0 solved, 4593 unsolved
Search for dead transitions found 0 dead transitions in 65701ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349386 ms. Remains : 4797/4797 places, 4594/4594 transitions.
RANDOM walk for 40000 steps (5058 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3325 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 81543 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 81543 steps, saw 40784 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 4596 rows 4799 cols
[2025-06-01 05:06:46] [INFO ] Invariants computation overflowed in 87 ms
[2025-06-01 05:06:46] [INFO ] State equation strengthened by 798 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) 1351/1355 variables, 178/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6612/9395 variables, and 2638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2020 ms.
Refiners :[State Equation: 2638/4799 constraints, ReadFeed: 0/798 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) 1351/1355 variables, 178/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1355 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6612/9395 variables, and 2639 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2083 ms.
Refiners :[State Equation: 2638/4799 constraints, ReadFeed: 0/798 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4237ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30002 ms.
Support contains 1 out of 4799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 4799 transition count 4595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4798 transition count 4595
Applied a total of 2 rules in 1526 ms. Remains 4798 /4799 variables (removed 1) and now considering 4595/4596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1527 ms. Remains : 4798/4799 places, 4595/4596 transitions.
RANDOM walk for 40000 steps (5081 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3399 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 82982 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 82982 steps, saw 41501 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 4595 rows 4798 cols
[2025-06-01 05:07:25] [INFO ] Invariants computation overflowed in 80 ms
[2025-06-01 05:07:25] [INFO ] State equation strengthened by 798 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) 1351/1355 variables, 178/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5255/6610 variables, 2458/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6610 variables, 401/3038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6610 variables, 0/3038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9393/9393 variables, and 5199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45065 ms.
Refiners :[State Equation: 4798/4798 constraints, ReadFeed: 401/798 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 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) 1351/1355 variables, 178/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1355 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5255/6610 variables, 2458/2638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6610 variables, 401/3039 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 05:08:14] [INFO ] Deduced a trap along path composed of 2 places in 154 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:15] [INFO ] Deduced a trap along path composed of 2 places in 158 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:15] [INFO ] Deduced a trap along path composed of 2 places in 138 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:16] [INFO ] Deduced a trap along path composed of 2 places in 144 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:16] [INFO ] Deduced a trap along path composed of 2 places in 227 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:16] [INFO ] Deduced a trap along path composed of 2 places in 162 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:17] [INFO ] Deduced a trap along path composed of 2 places in 156 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:17] [INFO ] Deduced a trap along path composed of 2 places in 110 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:17] [INFO ] Deduced a trap along path composed of 3 places in 106 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:17] [INFO ] Deduced a trap along path composed of 2 places in 105 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:18] [INFO ] Deduced a trap along path composed of 2 places in 110 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:18] [INFO ] Deduced a trap along path composed of 3 places in 110 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:18] [INFO ] Deduced a trap along path composed of 3 places in 109 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:18] [INFO ] Deduced a trap along path composed of 3 places in 102 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:19] [INFO ] Deduced a trap along path composed of 2 places in 102 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:19] [INFO ] Deduced a trap along path composed of 2 places in 103 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:19] [INFO ] Deduced a trap along path composed of 8 places in 97 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:19] [INFO ] Deduced a trap along path composed of 5 places in 102 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:20] [INFO ] Deduced a trap along path composed of 3 places in 99 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:20] [INFO ] Deduced a trap along path composed of 3 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/6610 variables, 20/3059 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 05:08:20] [INFO ] Deduced a trap along path composed of 2 places in 101 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:21] [INFO ] Deduced a trap along path composed of 3 places in 94 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:21] [INFO ] Deduced a trap along path composed of 2 places in 94 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:21] [INFO ] Deduced a trap along path composed of 2 places in 93 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:21] [INFO ] Deduced a trap along path composed of 2 places in 91 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:22] [INFO ] Deduced a trap along path composed of 2 places in 101 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:22] [INFO ] Deduced a trap along path composed of 2 places in 95 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:22] [INFO ] Deduced a trap along path composed of 2 places in 94 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:22] [INFO ] Deduced a trap along path composed of 3 places in 93 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:23] [INFO ] Deduced a trap along path composed of 2 places in 91 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:23] [INFO ] Deduced a trap along path composed of 2 places in 93 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:23] [INFO ] Deduced a trap along path composed of 3 places in 85 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:23] [INFO ] Deduced a trap along path composed of 2 places in 84 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:24] [INFO ] Deduced a trap along path composed of 2 places in 84 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:24] [INFO ] Deduced a trap along path composed of 3 places in 81 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:24] [INFO ] Deduced a trap along path composed of 2 places in 79 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:24] [INFO ] Deduced a trap along path composed of 2 places in 81 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:25] [INFO ] Deduced a trap along path composed of 2 places in 81 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:25] [INFO ] Deduced a trap along path composed of 2 places in 73 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:25] [INFO ] Deduced a trap along path composed of 2 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/6610 variables, 20/3079 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 05:08:25] [INFO ] Deduced a trap along path composed of 2 places in 78 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:26] [INFO ] Deduced a trap along path composed of 2 places in 78 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:26] [INFO ] Deduced a trap along path composed of 2 places in 74 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:26] [INFO ] Deduced a trap along path composed of 2 places in 74 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:26] [INFO ] Deduced a trap along path composed of 2 places in 71 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:27] [INFO ] Deduced a trap along path composed of 2 places in 73 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:27] [INFO ] Deduced a trap along path composed of 2 places in 79 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:27] [INFO ] Deduced a trap along path composed of 2 places in 69 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:27] [INFO ] Deduced a trap along path composed of 2 places in 63 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:27] [INFO ] Deduced a trap along path composed of 2 places in 65 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:28] [INFO ] Deduced a trap along path composed of 2 places in 67 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:28] [INFO ] Deduced a trap along path composed of 2 places in 66 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:28] [INFO ] Deduced a trap along path composed of 2 places in 69 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:28] [INFO ] Deduced a trap along path composed of 2 places in 66 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:28] [INFO ] Deduced a trap along path composed of 2 places in 67 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:29] [INFO ] Deduced a trap along path composed of 2 places in 68 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:29] [INFO ] Deduced a trap along path composed of 2 places in 61 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:29] [INFO ] Deduced a trap along path composed of 2 places in 63 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:29] [INFO ] Deduced a trap along path composed of 2 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:29] [INFO ] Deduced a trap along path composed of 2 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/6610 variables, 20/3099 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 05:08:30] [INFO ] Deduced a trap along path composed of 2 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:30] [INFO ] Deduced a trap along path composed of 2 places in 58 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:30] [INFO ] Deduced a trap along path composed of 2 places in 57 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:31] [INFO ] Deduced a trap along path composed of 2 places in 56 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:31] [INFO ] Deduced a trap along path composed of 2 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:31] [INFO ] Deduced a trap along path composed of 2 places in 57 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:31] [INFO ] Deduced a trap along path composed of 3 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 05:08:31] [INFO ] Deduced a trap along path composed of 3 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 05:08:32] [INFO ] Deduced a trap along path composed of 2 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:32] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:32] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:32] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:32] [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 05:08:33] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:33] [INFO ] Deduced a trap along path composed of 3 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 05:08:33] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:33] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 05:08:34] [INFO ] Deduced a trap along path composed of 3 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 05:08:34] [INFO ] Deduced a trap along path composed of 3 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 05:08:34] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/6610 variables, 20/3119 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 05:08:34] [INFO ] Deduced a trap along path composed of 3 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 05:08:35] [INFO ] Deduced a trap along path composed of 3 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 05:08:35] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/6610 variables, 3/3122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/6610 variables, 0/3122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9393/9393 variables, and 5283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45087 ms.
Refiners :[State Equation: 4798/4798 constraints, ReadFeed: 401/798 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 83/83 constraints]
After SMT, in 90279ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 4798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4798/4798 places, 4595/4595 transitions.
Applied a total of 0 rules in 764 ms. Remains 4798 /4798 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 764 ms. Remains : 4798/4798 places, 4595/4595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4798/4798 places, 4595/4595 transitions.
Applied a total of 0 rules in 753 ms. Remains 4798 /4798 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
// Phase 1: matrix 4595 rows 4798 cols
[2025-06-01 05:08:57] [INFO ] Invariants computation overflowed in 83 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:09:27] [INFO ] Performed 2914/4798 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 05:09:49] [INFO ] Implicit Places using invariants in 52453 ms returned []
// Phase 1: matrix 4595 rows 4798 cols
[2025-06-01 05:09:49] [INFO ] Invariants computation overflowed in 77 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:09:53] [INFO ] State equation strengthened by 798 read => feed constraints.
[2025-06-01 05:12:29] [INFO ] Performed 2/4798 implicitness test of which 0 returned IMPLICIT in 156 seconds.
[2025-06-01 05:12:29] [INFO ] Timeout of Implicit test with SMT after 156 seconds.
[2025-06-01 05:12:29] [INFO ] Implicit Places using invariants and state equation in 160212 ms returned []
Implicit Place search using SMT with State Equation took 212670 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:12:30] [INFO ] Redundant transitions in 240 ms returned []
Running 4594 sub problems to find dead transitions.
// Phase 1: matrix 4595 rows 4798 cols
[2025-06-01 05:12:30] [INFO ] Invariants computation overflowed in 81 ms
[2025-06-01 05:12:30] [INFO ] State equation strengthened by 798 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 Real declared 4797/9393 variables, and 0 constraints, problems are : Problem set: 0 solved, 4594 unsolved in 30068 ms.
Refiners :[State Equation: 0/4798 constraints, ReadFeed: 0/798 constraints, PredecessorRefiner: 4594/3587 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4594 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 4797/9393 variables, and 0 constraints, problems are : Problem set: 0 solved, 4594 unsolved in 30065 ms.
Refiners :[State Equation: 0/4798 constraints, ReadFeed: 0/798 constraints, PredecessorRefiner: 1007/3587 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65073ms problems are : Problem set: 0 solved, 4594 unsolved
Search for dead transitions found 0 dead transitions in 65104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278801 ms. Remains : 4798/4798 places, 4595/4595 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 399 Pre rules applied. Total rules applied 0 place count 4799 transition count 4197
Deduced a syphon composed of 399 places in 452 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 0 with 798 rules applied. Total rules applied 798 place count 4400 transition count 4197
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 799 place count 4400 transition count 4196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 800 place count 4399 transition count 4196
Applied a total of 800 rules in 2104 ms. Remains 4399 /4799 variables (removed 400) and now considering 4196/4596 (removed 400) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4196 rows 4399 cols
[2025-06-01 05:13:37] [INFO ] Invariants computation overflowed in 92 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 05:14:26] [INFO ] After 48612ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Over-approximation ignoring read arcs solved 0 properties in 51803 ms.
[2025-06-01 05:14:29] [INFO ] Flatten gal took : 1945 ms
[2025-06-01 05:14:31] [INFO ] Flatten gal took : 1899 ms
[2025-06-01 05:14:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17337087612814020278.gal : 153 ms
[2025-06-01 05:14:31] [INFO ] Time to serialize properties into /tmp/CTLFireability17559635356919328409.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17337087612814020278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17559635356919328409.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 05:15:03] [INFO ] Flatten gal took : 1879 ms
[2025-06-01 05:15:03] [INFO ] Applying decomposition
[2025-06-01 05:15:05] [INFO ] Flatten gal took : 1898 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/graph11473956057476545803.txt' '-o' '/tmp/graph11473956057476545803.bin' '-w' '/tmp/graph11473956057476545803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11473956057476545803.bin' '-l' '-1' '-v' '-w' '/tmp/graph11473956057476545803.weights' '-q' '0' '-e' '0.001'
[2025-06-01 05:15:07] [INFO ] Decomposing Gal with order
[2025-06-01 05:15:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 05:15:09] [INFO ] Removed a total of 6255 redundant transitions.
[2025-06-01 05:15:10] [INFO ] Flatten gal took : 2562 ms
[2025-06-01 05:15:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 3464 labels/synchronizations in 293 ms.
[2025-06-01 05:15:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4183482213154853518.gal : 155 ms
[2025-06-01 05:15:11] [INFO ] Time to serialize properties into /tmp/CTLFireability10049563339414464171.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4183482213154853518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10049563339414464171.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4400 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 05:15:46] [INFO ] Invariants computation overflowed in 268 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:15:50] [INFO ] Implicit Places using invariants in 5070 ms returned []
Implicit Place search using SMT only with invariants took 5075 ms to find 0 implicit places.
Running 9997 sub problems to find dead transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 05:15:51] [INFO ] Invariants computation overflowed in 263 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 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30128 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 9997/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9997 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 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30133 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 0/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69153ms problems are : Problem set: 0 solved, 9997 unsolved
Search for dead transitions found 0 dead transitions in 69176ms
Finished structural reductions in LTL mode , in 1 iterations and 78675 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2025-06-01 05:17:00] [INFO ] Flatten gal took : 203 ms
[2025-06-01 05:17:00] [INFO ] Flatten gal took : 231 ms
[2025-06-01 05:17:01] [INFO ] Input system was already deterministic with 9998 transitions.
[2025-06-01 05:17:01] [INFO ] Flatten gal took : 239 ms
[2025-06-01 05:17:01] [INFO ] Flatten gal took : 247 ms
[2025-06-01 05:17:01] [INFO ] Time to serialize gal into /tmp/CTLFireability5355418843990564656.gal : 39 ms
[2025-06-01 05:17:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13224625729109806310.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5355418843990564656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13224625729109806310.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 05:17:31] [INFO ] Flatten gal took : 223 ms
[2025-06-01 05:17:31] [INFO ] Applying decomposition
[2025-06-01 05:17:32] [INFO ] Flatten gal took : 229 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/graph10945814748897052662.txt' '-o' '/tmp/graph10945814748897052662.bin' '-w' '/tmp/graph10945814748897052662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10945814748897052662.bin' '-l' '-1' '-v' '-w' '/tmp/graph10945814748897052662.weights' '-q' '0' '-e' '0.001'
[2025-06-01 05:17:32] [INFO ] Decomposing Gal with order
[2025-06-01 05:17:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 05:17:41] [INFO ] Removed a total of 2833 redundant transitions.
[2025-06-01 05:17:41] [INFO ] Flatten gal took : 413 ms
[2025-06-01 05:17:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 95 ms.
[2025-06-01 05:17:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6459272862131181531.gal : 80 ms
[2025-06-01 05:17:42] [INFO ] Time to serialize properties into /tmp/CTLFireability11966619219300057589.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6459272862131181531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11966619219300057589.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2397 transitions
Trivial Post-agglo rules discarded 2397 transitions
Performed 2397 trivial Post agglomeration. Transition count delta: 2397
Iterating post reduction 0 with 2397 rules applied. Total rules applied 2397 place count 10599 transition count 7600
Reduce places removed 2397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2398 rules applied. Total rules applied 4795 place count 8202 transition count 7599
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4796 place count 8201 transition count 7599
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4796 place count 8201 transition count 7199
Deduced a syphon composed of 400 places in 1262 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5596 place count 7801 transition count 7199
Performed 1401 Post agglomeration using F-continuation condition.Transition count delta: 1401
Deduced a syphon composed of 1401 places in 580 ms
Reduce places removed 1401 places and 0 transitions.
Iterating global reduction 3 with 2802 rules applied. Total rules applied 8398 place count 6400 transition count 5798
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 8399 place count 6400 transition count 5798
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8400 place count 6399 transition count 5797
Applied a total of 8400 rules in 6447 ms. Remains 6399 /10600 variables (removed 4201) and now considering 5797/9998 (removed 4201) transitions.
// Phase 1: matrix 5797 rows 6399 cols
[2025-06-01 05:18:18] [INFO ] Invariants computation overflowed in 184 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:18:22] [INFO ] Implicit Places using invariants in 4030 ms returned []
// Phase 1: matrix 5797 rows 6399 cols
[2025-06-01 05:18:22] [INFO ] Invariants computation overflowed in 177 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:18:26] [INFO ] State equation strengthened by 398 read => feed constraints.
[2025-06-01 05:19:10] [INFO ] Performed 2/6399 implicitness test of which 0 returned IMPLICIT in 44 seconds.
[2025-06-01 05:21:02] [INFO ] Implicit Places using invariants and state equation in 160358 ms returned []
Implicit Place search using SMT with State Equation took 164395 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 05:21:03] [INFO ] Redundant transitions in 244 ms returned []
Running 5796 sub problems to find dead transitions.
// Phase 1: matrix 5797 rows 6399 cols
[2025-06-01 05:21:03] [INFO ] Invariants computation overflowed in 175 ms
[2025-06-01 05:21:03] [INFO ] State equation strengthened by 398 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 6398/12196 variables, and 0 constraints, problems are : Problem set: 0 solved, 5796 unsolved in 30078 ms.
Refiners :[State Equation: 0/6399 constraints, ReadFeed: 0/398 constraints, PredecessorRefiner: 5796/5796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5796 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 6398/12196 variables, and 0 constraints, problems are : Problem set: 0 solved, 5796 unsolved in 30092 ms.
Refiners :[State Equation: 0/6399 constraints, ReadFeed: 0/398 constraints, PredecessorRefiner: 0/5796 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63200ms problems are : Problem set: 0 solved, 5796 unsolved
Search for dead transitions found 0 dead transitions in 63210ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6399/10600 places, 5797/9998 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 234315 ms. Remains : 6399/10600 places, 5797/9998 transitions.
[2025-06-01 05:22:06] [INFO ] Flatten gal took : 143 ms
[2025-06-01 05:22:06] [INFO ] Flatten gal took : 162 ms
[2025-06-01 05:22:07] [INFO ] Input system was already deterministic with 5797 transitions.
[2025-06-01 05:22:07] [INFO ] Flatten gal took : 151 ms
[2025-06-01 05:22:07] [INFO ] Flatten gal took : 156 ms
[2025-06-01 05:22:07] [INFO ] Time to serialize gal into /tmp/CTLFireability15250761981833234790.gal : 26 ms
[2025-06-01 05:22:07] [INFO ] Time to serialize properties into /tmp/CTLFireability13677492836526275416.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15250761981833234790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13677492836526275416.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 05:22:37] [INFO ] Flatten gal took : 134 ms
[2025-06-01 05:22:37] [INFO ] Applying decomposition
[2025-06-01 05:22:37] [INFO ] Flatten gal took : 135 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/graph11555592352766451645.txt' '-o' '/tmp/graph11555592352766451645.bin' '-w' '/tmp/graph11555592352766451645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11555592352766451645.bin' '-l' '-1' '-v' '-w' '/tmp/graph11555592352766451645.weights' '-q' '0' '-e' '0.001'
[2025-06-01 05:22:38] [INFO ] Decomposing Gal with order
[2025-06-01 05:22:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 05:22:39] [INFO ] Removed a total of 1278 redundant transitions.
[2025-06-01 05:22:40] [INFO ] Flatten gal took : 269 ms
[2025-06-01 05:22:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 31 ms.
[2025-06-01 05:22:40] [INFO ] Time to serialize gal into /tmp/CTLFireability694486393243749733.gal : 60 ms
[2025-06-01 05:22:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9700381743811442153.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability694486393243749733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9700381743811442153.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4459 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 05:23:15] [INFO ] Invariants computation overflowed in 275 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:23:20] [INFO ] Implicit Places using invariants in 5494 ms returned []
Implicit Place search using SMT only with invariants took 5495 ms to find 0 implicit places.
Running 9997 sub problems to find dead transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 05:23:20] [INFO ] Invariants computation overflowed in 248 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 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30119 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 9997/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9997 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 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30106 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 0/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69208ms problems are : Problem set: 0 solved, 9997 unsolved
Search for dead transitions found 0 dead transitions in 69223ms
Finished structural reductions in LTL mode , in 1 iterations and 79193 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2025-06-01 05:24:29] [INFO ] Flatten gal took : 184 ms
[2025-06-01 05:24:29] [INFO ] Flatten gal took : 195 ms
[2025-06-01 05:24:30] [INFO ] Input system was already deterministic with 9998 transitions.
[2025-06-01 05:24:30] [INFO ] Flatten gal took : 195 ms
[2025-06-01 05:24:30] [INFO ] Flatten gal took : 198 ms
[2025-06-01 05:24:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7009827316621140476.gal : 32 ms
[2025-06-01 05:24:30] [INFO ] Time to serialize properties into /tmp/CTLFireability5899701370594621080.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7009827316621140476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5899701370594621080.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 05:25:00] [INFO ] Flatten gal took : 230 ms
[2025-06-01 05:25:00] [INFO ] Applying decomposition
[2025-06-01 05:25:01] [INFO ] Flatten gal took : 240 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/graph4062526516867177376.txt' '-o' '/tmp/graph4062526516867177376.bin' '-w' '/tmp/graph4062526516867177376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4062526516867177376.bin' '-l' '-1' '-v' '-w' '/tmp/graph4062526516867177376.weights' '-q' '0' '-e' '0.001'
[2025-06-01 05:25:01] [INFO ] Decomposing Gal with order
[2025-06-01 05:25:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 05:25:10] [INFO ] Removed a total of 2874 redundant transitions.
[2025-06-01 05:25:10] [INFO ] Flatten gal took : 384 ms
[2025-06-01 05:25:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 141 ms.
[2025-06-01 05:25:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10522020115383388402.gal : 105 ms
[2025-06-01 05:25:11] [INFO ] Time to serialize properties into /tmp/CTLFireability6902365309223662649.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10522020115383388402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6902365309223662649.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4357 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 05:25:45] [INFO ] Invariants computation overflowed in 271 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:25:50] [INFO ] Implicit Places using invariants in 5170 ms returned []
Implicit Place search using SMT only with invariants took 5173 ms to find 0 implicit places.
Running 9997 sub problems to find dead transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 05:25:51] [INFO ] Invariants computation overflowed in 249 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 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30138 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 9997/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9997 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 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30152 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 0/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68027ms problems are : Problem set: 0 solved, 9997 unsolved
Search for dead transitions found 0 dead transitions in 68041ms
Finished structural reductions in LTL mode , in 1 iterations and 77583 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2025-06-01 05:26:59] [INFO ] Flatten gal took : 214 ms
[2025-06-01 05:26:59] [INFO ] Flatten gal took : 229 ms
[2025-06-01 05:26:59] [INFO ] Input system was already deterministic with 9998 transitions.
[2025-06-01 05:27:00] [INFO ] Flatten gal took : 217 ms
[2025-06-01 05:27:00] [INFO ] Flatten gal took : 220 ms
[2025-06-01 05:27:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8062005384957419713.gal : 34 ms
[2025-06-01 05:27:00] [INFO ] Time to serialize properties into /tmp/CTLFireability16072027257796538989.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8062005384957419713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16072027257796538989.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 05:27:30] [INFO ] Flatten gal took : 210 ms
[2025-06-01 05:27:30] [INFO ] Applying decomposition
[2025-06-01 05:27:30] [INFO ] Flatten gal took : 220 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/graph9580482341954609053.txt' '-o' '/tmp/graph9580482341954609053.bin' '-w' '/tmp/graph9580482341954609053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9580482341954609053.bin' '-l' '-1' '-v' '-w' '/tmp/graph9580482341954609053.weights' '-q' '0' '-e' '0.001'
[2025-06-01 05:27:31] [INFO ] Decomposing Gal with order
[2025-06-01 05:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 05:27:40] [INFO ] Removed a total of 2827 redundant transitions.
[2025-06-01 05:27:40] [INFO ] Flatten gal took : 449 ms
[2025-06-01 05:27:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 210 ms.
[2025-06-01 05:27:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4811045739516681458.gal : 126 ms
[2025-06-01 05:27:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10654880504390715896.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4811045739516681458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10654880504390715896.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4354 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 05:28:15] [INFO ] Invariants computation overflowed in 274 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:28:20] [INFO ] Implicit Places using invariants in 5422 ms returned []
Implicit Place search using SMT only with invariants took 5426 ms to find 0 implicit places.
Running 9997 sub problems to find dead transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 05:28:20] [INFO ] Invariants computation overflowed in 273 ms
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 Real declared 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30135 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 9997/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9997 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 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30111 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 0/9997 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68082ms problems are : Problem set: 0 solved, 9997 unsolved
Search for dead transitions found 0 dead transitions in 68097ms
Finished structural reductions in LTL mode , in 1 iterations and 77894 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2025-06-01 05:29:28] [INFO ] Flatten gal took : 199 ms
[2025-06-01 05:29:29] [INFO ] Flatten gal took : 220 ms
[2025-06-01 05:29:29] [INFO ] Input system was already deterministic with 9998 transitions.
[2025-06-01 05:29:29] [INFO ] Flatten gal took : 218 ms
[2025-06-01 05:29:30] [INFO ] Flatten gal took : 233 ms
[2025-06-01 05:29:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1260403804246836319.gal : 37 ms
[2025-06-01 05:29:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17175551701020297797.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1260403804246836319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17175551701020297797.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 05:30:00] [INFO ] Flatten gal took : 218 ms
[2025-06-01 05:30:00] [INFO ] Applying decomposition
[2025-06-01 05:30:00] [INFO ] Flatten gal took : 233 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/graph10850138124534393789.txt' '-o' '/tmp/graph10850138124534393789.bin' '-w' '/tmp/graph10850138124534393789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10850138124534393789.bin' '-l' '-1' '-v' '-w' '/tmp/graph10850138124534393789.weights' '-q' '0' '-e' '0.001'
[2025-06-01 05:30:01] [INFO ] Decomposing Gal with order
[2025-06-01 05:30:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 05:30:09] [INFO ] Removed a total of 2836 redundant transitions.
[2025-06-01 05:30:10] [INFO ] Flatten gal took : 434 ms
[2025-06-01 05:30:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 165 ms.
[2025-06-01 05:30:10] [INFO ] Time to serialize gal into /tmp/CTLFireability8321758628007306742.gal : 119 ms
[2025-06-01 05:30:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4751504916519726723.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8321758628007306742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4751504916519726723.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4497 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 05:30:45] [INFO ] Invariants computation overflowed in 258 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 05:30:50] [INFO ] Implicit Places using invariants in 5325 ms returned []
Implicit Place search using SMT only with invariants took 5328 ms to find 0 implicit places.
Running 9997 sub problems to find dead transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2025-06-01 05:30:50] [INFO ] Invariants computation overflowed in 277 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms

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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-200"
export BK_EXAMINATION="CTLFireability"
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-200, examination is CTLFireability"
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-174860067600514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-200.tgz
mv DoubleExponent-PT-200 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;