Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r012-smll-171620123800063.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ASLink-PT-06b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620123800063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 921K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716249300944

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 23:55:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-20 23:55:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:55:04] [INFO ] Load time of PNML (sax parser for PT used): 672 ms
[2024-05-20 23:55:04] [INFO ] Transformed 2826 places.
[2024-05-20 23:55:04] [INFO ] Transformed 3513 transitions.
[2024-05-20 23:55:04] [INFO ] Found NUPN structural information;
[2024-05-20 23:55:04] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 1158 ms.
Structural test allowed to assert that 346 places are NOT stable. Took 46 ms.
RANDOM walk for 40000 steps (64 resets) in 7481 ms. (5 steps per ms) remains 877/2480 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 23 ms. (5 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 17 ms. (6 steps per ms) remains 877/877 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 21 ms. (5 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 17 ms. (6 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 20 ms. (5 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 877/877 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 877/877 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 877/877 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 877/877 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 877/877 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 877/877 properties
// Phase 1: matrix 3513 rows 2826 cols
[2024-05-20 23:55:08] [INFO ] Computed 277 invariants in 254 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/877 variables, 877/877 constraints. Problems are: Problem set: 0 solved, 877 unsolved
SMT process timed out in 6386ms, After SMT, problems are : Problem set: 0 solved, 877 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 877 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 480 transitions
Trivial Post-agglo rules discarded 480 transitions
Performed 480 trivial Post agglomeration. Transition count delta: 480
Iterating post reduction 0 with 480 rules applied. Total rules applied 480 place count 2826 transition count 3033
Reduce places removed 480 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 504 rules applied. Total rules applied 984 place count 2346 transition count 3009
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 989 place count 2341 transition count 3009
Performed 432 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 432 Pre rules applied. Total rules applied 989 place count 2341 transition count 2577
Deduced a syphon composed of 432 places in 12 ms
Ensure Unique test removed 36 places
Reduce places removed 468 places and 0 transitions.
Iterating global reduction 3 with 900 rules applied. Total rules applied 1889 place count 1873 transition count 2577
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 3 with 23 rules applied. Total rules applied 1912 place count 1868 transition count 2559
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1930 place count 1850 transition count 2559
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 1930 place count 1850 transition count 2540
Deduced a syphon composed of 19 places in 39 ms
Ensure Unique test removed 19 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 57 rules applied. Total rules applied 1987 place count 1812 transition count 2540
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 1987 place count 1812 transition count 2521
Deduced a syphon composed of 19 places in 39 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 2025 place count 1793 transition count 2521
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 2076 place count 1742 transition count 2470
Iterating global reduction 5 with 51 rules applied. Total rules applied 2127 place count 1742 transition count 2470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2128 place count 1742 transition count 2469
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 2128 place count 1742 transition count 2460
Deduced a syphon composed of 9 places in 12 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 2147 place count 1732 transition count 2460
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2147 place count 1732 transition count 2459
Deduced a syphon composed of 1 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 2150 place count 1730 transition count 2459
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2152 place count 1728 transition count 2444
Iterating global reduction 6 with 2 rules applied. Total rules applied 2154 place count 1728 transition count 2444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2154 place count 1728 transition count 2443
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2156 place count 1727 transition count 2443
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2157 place count 1726 transition count 2435
Iterating global reduction 6 with 1 rules applied. Total rules applied 2158 place count 1726 transition count 2435
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2159 place count 1725 transition count 2427
Iterating global reduction 6 with 1 rules applied. Total rules applied 2160 place count 1725 transition count 2427
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2161 place count 1724 transition count 2419
Iterating global reduction 6 with 1 rules applied. Total rules applied 2162 place count 1724 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2163 place count 1723 transition count 2411
Iterating global reduction 6 with 1 rules applied. Total rules applied 2164 place count 1723 transition count 2411
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2165 place count 1722 transition count 2403
Iterating global reduction 6 with 1 rules applied. Total rules applied 2166 place count 1722 transition count 2403
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2167 place count 1721 transition count 2395
Iterating global reduction 6 with 1 rules applied. Total rules applied 2168 place count 1721 transition count 2395
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2169 place count 1720 transition count 2387
Iterating global reduction 6 with 1 rules applied. Total rules applied 2170 place count 1720 transition count 2387
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2171 place count 1719 transition count 2379
Iterating global reduction 6 with 1 rules applied. Total rules applied 2172 place count 1719 transition count 2379
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2173 place count 1718 transition count 2371
Iterating global reduction 6 with 1 rules applied. Total rules applied 2174 place count 1718 transition count 2371
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2175 place count 1717 transition count 2363
Iterating global reduction 6 with 1 rules applied. Total rules applied 2176 place count 1717 transition count 2363
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2177 place count 1716 transition count 2355
Iterating global reduction 6 with 1 rules applied. Total rules applied 2178 place count 1716 transition count 2355
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2179 place count 1715 transition count 2347
Iterating global reduction 6 with 1 rules applied. Total rules applied 2180 place count 1715 transition count 2347
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2181 place count 1714 transition count 2339
Iterating global reduction 6 with 1 rules applied. Total rules applied 2182 place count 1714 transition count 2339
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2183 place count 1713 transition count 2331
Iterating global reduction 6 with 1 rules applied. Total rules applied 2184 place count 1713 transition count 2331
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2185 place count 1712 transition count 2323
Iterating global reduction 6 with 1 rules applied. Total rules applied 2186 place count 1712 transition count 2323
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2187 place count 1711 transition count 2315
Iterating global reduction 6 with 1 rules applied. Total rules applied 2188 place count 1711 transition count 2315
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 6 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 6 with 290 rules applied. Total rules applied 2478 place count 1566 transition count 2170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2480 place count 1565 transition count 2179
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 2488 place count 1565 transition count 2171
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2496 place count 1557 transition count 2171
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2500 place count 1557 transition count 2167
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2504 place count 1553 transition count 2167
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2507 place count 1553 transition count 2167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2508 place count 1552 transition count 2166
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 2511 place count 1550 transition count 2165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2512 place count 1549 transition count 2165
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 2512 place count 1549 transition count 2162
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2518 place count 1546 transition count 2162
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 2519 place count 1545 transition count 2162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2523 place count 1543 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2524 place count 1542 transition count 2159
Iterating global reduction 11 with 1 rules applied. Total rules applied 2525 place count 1542 transition count 2159
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2526 place count 1542 transition count 2158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2527 place count 1541 transition count 2158
Applied a total of 2527 rules in 2851 ms. Remains 1541 /2826 variables (removed 1285) and now considering 2158/3513 (removed 1355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2872 ms. Remains : 1541/2826 places, 2158/3513 transitions.
RANDOM walk for 1915311 steps (20314 resets) in 120004 ms. (15 steps per ms) remains 722/877 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 722/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 722/722 properties
// Phase 1: matrix 2158 rows 1541 cols
[2024-05-20 23:55:47] [INFO ] Computed 212 invariants in 101 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/722 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 722/3699 variables, and 22 constraints, problems are : Problem set: 0 solved, 722 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, Generalized P Invariants (flows): 22/143 constraints, State Equation: 0/1541 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/722 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/722 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 82/804 variables, 45/67 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/804 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-05-20 23:56:58] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/804 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (OVERLAPS) 2/806 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/3699 variables, and 75 constraints, problems are : Problem set: 0 solved, 722 unsolved in 45026 ms.
Refiners :[Positive P Invariants (semi-flows): 47/69 constraints, Generalized P Invariants (flows): 27/143 constraints, State Equation: 0/1541 constraints, PredecessorRefiner: 0/722 constraints, Known Traps: 1/1 constraints]
After SMT, in 90796ms problems are : Problem set: 0 solved, 722 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 722 out of 1541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1541/1541 places, 2158/2158 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1541 transition count 2128
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1511 transition count 2128
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 60 place count 1511 transition count 2090
Deduced a syphon composed of 38 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 77 rules applied. Total rules applied 137 place count 1472 transition count 2090
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 1472 transition count 2089
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 1471 transition count 2089
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 6 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 171 place count 1455 transition count 2073
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 172 place count 1454 transition count 2067
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 1454 transition count 2067
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 176 place count 1454 transition count 2064
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 12 rules applied. Total rules applied 188 place count 1448 transition count 2058
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 192 place count 1444 transition count 2058
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 192 place count 1444 transition count 2057
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 194 place count 1443 transition count 2057
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 195 place count 1442 transition count 2057
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 197 place count 1441 transition count 2056
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 198 place count 1440 transition count 2055
Iterating global reduction 7 with 1 rules applied. Total rules applied 199 place count 1440 transition count 2055
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 200 place count 1440 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 201 place count 1439 transition count 2054
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 202 place count 1439 transition count 2054
Applied a total of 202 rules in 328 ms. Remains 1439 /1541 variables (removed 102) and now considering 2054/2158 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 1439/1541 places, 2054/2158 transitions.
RANDOM walk for 2057460 steps (22292 resets) in 120004 ms. (17 steps per ms) remains 688/722 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 688/688 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 688/688 properties
Probabilistic random walk after 1000000 steps, saw 266330 distinct states, run finished after 39099 ms. (steps per millisecond=25 ) properties seen :33
// Phase 1: matrix 2054 rows 1439 cols
[2024-05-20 23:58:28] [INFO ] Computed 206 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 2 (OVERLAPS) 35/690 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/690 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/690 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (OVERLAPS) 1/691 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 78.0))
(s1 (/ 1.0 6.0))
(s2 (/ 1.0 78.0))
(s3 (/ 1.0 78.0))
(s4 (/ 1.0 78.0))
(s5 (/ 1.0 78.0))
(s6 (/ 1.0 78.0))
(s7 (/ 1.0 78.0))
(s8 (/ 1.0 78.0))
(s9 (/ 1.0 78.0))
(s10 (/ 1.0 78.0))
(s11 (/ 1.0 78.0))
(s12 (/ 1.0 78.0))
(s13 (/ 1.0 78.0))
(s14 (/ 1.0 78.0))
(s15 (/ 1.0 78.0))
(s16 (/ 1.0 78.0))
(s17 (/ 1.0 78.0))
(s18 (/ 1.0 78.0))
(s19 (/ 1.0 78.0))
(s20 (/ 1.0 78.0))
(s21 (/ 1.0 78.0))
(s22 (/ 1.0 78.0))
(s23 (/ 1.0 78.0))
(s24 (/ 1.0 78.0))
(s25 (/ 1.0 78.0))
(s26 (/ 1.0 78.0))
(s27 (/ 1.0 78.0))
(s28 (/ 1.0 78.0))
(s29 (/ 1.0 78.0))
(s30 (/ 1.0 78.0))
(s31 (/ 1.0 78.0))
(s32 (/ 1.0 78.0))
(s33 (/ 1.0 78.0))
(s34 (/ 1.0 78.0))
(s36 (/ 1.0 78.0))
(s37 (/ 1.0 26.0))
(s38 (/ 1.0 78.0))
(s39 (/ 1.0 78.0))
(s40 (/ 1.0 13.0))
(s41 (/ 1.0 78.0))
(s42 (/ 5.0 6.0))
(s44 (/ 1.0 78.0))
(s45 (/ 1.0 78.0))
(s46 (/ 1.0 78.0))
(s47 (/ 1.0 78.0))
(s48 (/ 1.0 78.0))
(s49 (/ 1.0 78.0))
(s50 (/ 1.0 78.0))
(s51 (/ 1.0 78.0))
(s52 (/ 1.0 78.0))
(s53 (/ 1.0 78.0))
(s54 (/ 1.0 78.0))
(s55 (/ 1.0 78.0))
(s56 (/ 1.0 78.0))
(s57 (/ 1.0 78.0))
(s58 (/ 1.0 78.0))
(s59 (/ 1.0 78.0))
(s60 (/ 1.0 78.0))
(s61 (/ 1.0 78.0))
(s62 (/ 1.0 78.0))
(s63 (/ 1.0 78.0))
(s64 (/ 1.0 78.0))
(s65 (/ 1.0 78.0))
(s66 (/ 1.0 78.0))
(s67 (/ 1.0 78.0))
(s68 (/ 1.0 78.0))
(s69 (/ 1.0 78.0))
(s70 (/ 1.0 78.0))
(s71 (/ 1.0 78.0))
(s72 (/ 1.0 78.0))
(s73 (/ 1.0 78.0))
(s74 (/ 1.0 78.0))
(s75 (/ 1.0 78.0))
(s76 (/ 1.0 78.0))
(s77 (/ 1.0 78.0))
(s78 (/ 1.0 78.0))
(s79 (/ 1.0 78.0))
(s80 (/ 1.0 78.0))
(s81 (/ 1.0 78.0))
(s82 (/ 1.0 78.0))
(s83 (/ 1.0 78.0))
(s84 (/ 1.0 78.0))
(s85 (/ 1.0 78.0))
(s86 (/ 1.0 78.0))
(s87 (/ 1.0 78.0))
(s88 (/ 1.0 78.0))
(s89 (/ 1.0 78.0))
(s90 (/ 1.0 78.0))
(s91 (/ 1.0 78.0))
(s92 (/ 1.0 78.0))
(s93 (/ 1.0 78.0))
(s94 (/ 1.0 78.0))
(s95 (/ 1.0 78.0))
(s96 (/ 1.0 78.0))
(s97 (/ 1.0 78.0))
(s98 (/ 1.0 78.0))
(s99 (/ 1.0 78.0))
(s100 (/ 1.0 78.0))
(s101 (/ 1.0 78.0))
(s102 (/ 1.0 78.0))
(s103 (/ 1.0 78.0))
(s104 (/ 1.0 78.0))
(s105 (/ 1.0 78.0))
(s106 (/ 1.0 78.0))
(s126 (/ 43.0 78.0))
(s127 (/ 1.0 78.0))
(s128 (/ 1.0 78.0))
(s129 (/ 1.0 78.0))
(s130 (/ 1.0 78.0))
(s131 (/ 1.0 78.0))
(s132 (/ 1.0 78.0))
(s133 (/ 1.0 78.0))
(s134 (/ 1.0 78.0))
(s135 (/ 1.0 78.0))
(s136 (/ 1.0 78.0))
(s137 (/ 1.0 78.0))
(s138 (/ 1.0 78.0))
(s139 (/ 1.0 78.0))
(s140 (/ 1.0 78.0))
(s141 (/ 1.0 78.0))
(s142 (/ 1.0 78.0))
(s143 (/ 1.0 78.0))
(s144 (/ 1.0 78.0))
(s145 (/ 1.0 78.0))
(s146 (/ 1.0 78.0))
(s147 (/ 1.0 78.0))
(s148 (/ 1.0 78.0))
(s149 (/ 3.0 26.0))
(s150 (/ 1.0 78.0))
(s151 (/ 1.0 78.0))
(s152 (/ 1.0 78.0))
(s153 (/ 1.0 78.0))
(s154 (/ 1.0 78.0))
(s155 (/ 1.0 78.0))
(s156 (/ 1.0 78.0))
(s157 (/ 1.0 78.0))
(s158 (/ 1.0 78.0))
(s159 (/ 1.0 78.0))
(s160 (/ 1.0 78.0))
(s161 (/ 1.0 78.0))
(s162 (/ 1.0 78.0))
(s163 (/ 38.0 39.0))
(s164 (/ 1.0 78.0))
(s165 (/ 1.0 78.0))
(s166 (/ 1.0 78.0))
(s167 (/ 1.0 78.0))
(s168 (/ 1.0 78.0))
(s169 (/ 1.0 78.0))
(s170 (/ 1.0 78.0))
(s171 (/ 1.0 78.0))
(s172 (/ 1.0 78.0))
(s173 (/ 1.0 78.0))
(s174 (/ 1.0 78.0))
(s175 (/ 1.0 78.0))
(s176 (/ 1.0 78.0))
(s177 (/ 1.0 78.0))
(s178 (/ 1.0 78.0))
(s184 (/ 1.0 78.0))
(s185 (/ 1.0 78.0))
(s186 (/ 1.0 78.0))
(s187 (/ 1.0 78.0))
(s188 (/ 1.0 78.0))
(s189 (/ 1.0 78.0))
(s190 (/ 1.0 78.0))
(s191 (/ 1.0 78.0))
(s192 (/ 1.0 78.0))
(s193 (/ 1.0 78.0))
(s194 (/ 1.0 78.0))
(s195 (/ 1.0 78.0))
(s196 (/ 1.0 78.0))
(s197 (/ 1.0 78.0))
(s198 (/ 1.0 78.0))
(s199 (/ 1.0 78.0))
(s200 (/ 1.0 78.0))
(s201 (/ 1.0 78.0))
(s202 (/ 1.0 78.0))
(s203 (/ 1.0 78.0))
(s204 (/ 1.0 78.0))
(s205 (/ 1.0 78.0))
(s206 (/ 1.0 78.0))
(s207 (/ 34.0 39.0))
(s208 (/ 1.0 78.0))
(s209 (/ 1.0 78.0))
(s210 (/ 1.0 78.0))
(s211 (/ 1.0 78.0))
(s212 (/ 34.0 39.0))
(s213 (/ 1.0 78.0))
(s214 (/ 1.0 78.0))
(s215 (/ 1.0 78.0))
(s216 (/ 23.0 26.0))
(s217 (/ 1.0 78.0))
(s218 (/ 1.0 78.0))
(s232 0.0)
(s245 0.0)
(s253 0.0)
(s257 (/ 1.0 78.0))
(s258 (/ 1.0 78.0))
(s259 (/ 1.0 78.0))
(s260 (/ 1.0 78.0))
(s261 (/ 1.0 78.0))
(s262 (/ 1.0 78.0))
(s263 (/ 1.0 78.0))
(s264 (/ 1.0 78.0))
(s265 (/ 35.0 39.0))
(s266 (/ 1.0 78.0))
(s267 (/ 1.0 78.0))
(s268 (/ 1.0 78.0))
(s269 (/ 1.0 78.0))
(s270 (/ 31.0 78.0))
(s271 (/ 1.0 2.0))
(s273 (/ 1.0 78.0))
(s274 (/ 1.0 78.0))
(s275 (/ 1.0 78.0))
(s276 (/ 1.0 78.0))
(s277 (/ 1.0 78.0))
(s278 (/ 1.0 78.0))
(s279 (/ 1.0 78.0))
(s280 (/ 1.0 78.0))
(s281 (/ 1.0 78.0))
(s282 (/ 1.0 78.0))
(s283 (/ 1.0 78.0))
(s284 (/ 1.0 78.0))
(s286 (/ 1.0 78.0))
(s287 (/ 1.0 78.0))
(s288 (/ 1.0 78.0))
(s289 (/ 1.0 78.0))
(s290 (/ 1.0 78.0))
(s291 (/ 1.0 78.0))
(s298 (/ 1.0 78.0))
(s299 (/ 1.0 78.0))
(s300 (/ 38.0 39.0))
(s301 0.0)
(s302 (/ 1.0 78.0))
(s303 (/ 35.0 39.0))
(s304 (/ 1.0 78.0))
(s305 (/ 1.0 78.0))
(s306 (/ 1.0 78.0))
(s307 (/ 1.0 78.0))
(s308 (/ 1.0 78.0))
(s309 (/ 1.0 78.0))
(s310 (/ 1.0 78.0))
(s311 0.0)
(s312 (/ 1.0 78.0))
(s313 (/ 1.0 78.0))
(s314 (/ 1.0 78.0))
(s315 (/ 25.0 26.0))
(s316 0.0)
(s317 (/ 1.0 78.0))
(s318 (/ 1.0 78.0))
(s319 (/ 1.0 78.0))
(s320 (/ 1.0 78.0))
(s321 (/ 1.0 78.0))
(s322 (/ 1.0 78.0))
(s323 (/ 1.0 78.0))
(s324 (/ 1.0 78.0))
(s325 (/ 1.0 78.0))
(s326 (/ 1.0 78.0))
(s327 (/ 1.0 78.0))
(s328 (/ 1.0 78.0))
(s329 (/ 1.0 78.0))
(s330 (/ 1.0 78.0))
(s331 (/ 1.0 78.0))
(s332 (/ 1.0 78.0))
(s333 (/ 1.0 78.0))
(s334 (/ 1.0 78.0))
(s335 (/ 1.0 78.0))
(s336 (/ 1.0 78.0))
(s337 (/ 1.0 78.0))
(s338 (/ 1.0 78.0))
(s339 (/ 1.0 78.0))
(s340 (/ 1.0 78.0))
(s341 (/ 1.0 78.0))
(s342 (/ 1.0 78.0))
(s343 (/ 1.0 78.0))
(s344 (/ 1.0 78.0))
(s345 (/ 1.0 78.0))
(s346 (/ 1.0 78.0))
(s347 (/ 1.0 78.0))
(s348 (/ 1.0 78.0))
(s349 (/ 1.0 78.0))
(s350 (/ 1.0 78.0))
(s351 (/ 1.0 78.0))
(s352 (/ 1.0 78.0))
(s353 (/ 1.0 78.0))
(s354 (/ 1.0 78.0))
(s374 (/ 43.0 78.0))
(s375 (/ 1.0 78.0))
(s376 (/ 1.0 78.0))
(s377 (/ 1.0 78.0))
(s378 (/ 1.0 78.0))
(s379 (/ 1.0 78.0))
(s380 (/ 1.0 78.0))
(s381 (/ 1.0 78.0))
(s382 (/ 1.0 78.0))
(s383 (/ 1.0 78.0))
(s384 (/ 3.0 26.0))
(s385 (/ 1.0 78.0))
(s386 (/ 1.0 78.0))
(s387 (/ 1.0 78.0))
(s388 (/ 1.0 78.0))
(s389 (/ 1.0 78.0))
(s390 (/ 1.0 78.0))
(s391 (/ 1.0 78.0))
(s392 (/ 1.0 78.0))
(s393 (/ 1.0 78.0))
(s394 (/ 1.0 78.0))
(s395 (/ 1.0 78.0))
(s396 (/ 1.0 78.0))
(s397 (/ 1.0 78.0))
(s398 (/ 1.0 78.0))
(s399 (/ 1.0 78.0))
(s400 (/ 1.0 78.0))
(s401 (/ 1.0 78.0))
(s402 (/ 1.0 78.0))
(s403 (/ 1.0 78.0))
(s404 (/ 1.0 78.0))
(s405 (/ 1.0 78.0))
(s406 (/ 1.0 78.0))
(s407 (/ 1.0 78.0))
(s408 (/ 1.0 78.0))
(s409 (/ 1.0 78.0))
(s410 (/ 1.0 78.0))
(s411 (/ 38.0 39.0))
(s412 (/ 1.0 78.0))
(s413 (/ 1.0 78.0))
(s414 (/ 1.0 78.0))
(s415 (/ 1.0 78.0))
(s416 (/ 1.0 78.0))
(s417 (/ 1.0 78.0))
(s418 (/ 1.0 78.0))
(s419 (/ 1.0 78.0))
(s420 (/ 1.0 78.0))
(s421 (/ 1.0 78.0))
(s422 (/ 1.0 78.0))
(s423 (/ 1.0 78.0))
(s424 (/ 1.0 78.0))
(s425 (/ 1.0 78.0))
(s426 (/ 1.0 78.0))
(s432 (/ 1.0 78.0))
(s433 (/ 1.0 78.0))
(s434 (/ 1.0 78.0))
(s435 (/ 1.0 78.0))
(s436 (/ 1.0 78.0))
(s437 (/ 1.0 78.0))
(s438 (/ 1.0 78.0))
(s439 (/ 1.0 78.0))
(s440 (/ 1.0 78.0))
(s441 (/ 1.0 78.0))
(s442 (/ 1.0 78.0))
(s443 (/ 1.0 78.0))
(s444 (/ 1.0 78.0))
(s445 (/ 1.0 78.0))
(s446 (/ 1.0 78.0))
(s447 (/ 1.0 78.0))
(s448 (/ 1.0 78.0))
(s449 (/ 1.0 78.0))
(s450 (/ 1.0 78.0))
(s451 (/ 1.0 78.0))
(s452 (/ 1.0 78.0))
(s453 (/ 1.0 78.0))
(s454 (/ 1.0 78.0))
(s455 (/ 1.0 78.0))
(s456 (/ 1.0 78.0))
(s457 (/ 1.0 78.0))
(s458 (/ 34.0 39.0))
(s459 (/ 1.0 78.0))
(s460 (/ 1.0 78.0))
(s461 (/ 1.0 78.0))
(s462 (/ 34.0 39.0))
(s463 (/ 1.0 78.0))
(s464 (/ 1.0 78.0))
(s465 (/ 23.0 26.0))
(s466 (/ 1.0 78.0))
(s469 (/ 1.0 78.0))
(s470 (/ 1.0 78.0))
(s471 (/ 1.0 78.0))
(s483 0.0)
(s493 0.0)
(s501 0.0)
(s505 (/ 1.0 78.0))
(s506 (/ 1.0 78.0))
(s507 (/ 1.0 78.0))
(s508 (/ 1.0 78.0))
(s509 (/ 1.0 78.0))
(s510 (/ 1.0 78.0))
(s511 (/ 1.0 78.0))
(s512 (/ 1.0 78.0))
(s513 (/ 73.0 78.0))
(s514 (/ 1.0 78.0))
(s515 (/ 1.0 78.0))
(s516 (/ 7.0 13.0))
(s517 (/ 1.0 78.0))
(s518 (/ 31.0 78.0))
(s519 (/ 1.0 78.0))
(s533 (/ 1.0 78.0))
(s534 (/ 1.0 78.0))
(s535 (/ 38.0 39.0))
(s536 0.0)
(s537 (/ 1.0 78.0))
(s538 (/ 1.0 78.0))
(s539 (/ 73.0 78.0))
(s540 (/ 1.0 78.0))
(s541 (/ 1.0 78.0))
(s542 (/ 1.0 78.0))
(s543 0.0)
(s544 (/ 1.0 78.0))
(s545 (/ 1.0 78.0))
(s546 (/ 1.0 78.0))
(s547 (/ 25.0 26.0))
(s548 0.0)
(s549 (/ 1.0 78.0))
(s550 (/ 1.0 78.0))
(s551 (/ 1.0 78.0))
(s552 (/ 1.0 78.0))
(s553 (/ 1.0 78.0))
(s554 (/ 1.0 78.0))
(s555 (/ 1.0 78.0))
(s556 (/ 1.0 78.0))
(s557 (/ 1.0 78.0))
(s558 (/ 1.0 78.0))
(s559 (/ 1.0 78.0))
(s560 (/ 1.0 78.0))
(s561 (/ 1.0 78.0))
(s562 (/ 1.0 78.0))
(s563 (/ 1.0 78.0))
(s564 (/ 1.0 78.0))
(s565 (/ 1.0 78.0))
(s566 (/ 1.0 78.0))
(s567 (/ 1.0 78.0))
(s568 (/ 1.0 78.0))
(s569 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 691/3493 variables, and 60 constraints, problems are : Problem set: 0 solved, 655 unsolved in 75035 ms.
Refiners :[Positive P Invariants (semi-flows): 37/67 constraints, Generalized P Invariants (flows): 23/139 constraints, State Equation: 0/1439 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 655 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 2 (OVERLAPS) 35/690 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/690 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/690 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (OVERLAPS) 1/691 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 7 (OVERLAPS) 231/922 variables, 42/102 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-05-21 00:00:35] [INFO ] Deduced a trap composed of 63 places in 578 ms of which 13 ms to minimize.
[2024-05-21 00:00:36] [INFO ] Deduced a trap composed of 50 places in 696 ms of which 10 ms to minimize.
[2024-05-21 00:00:36] [INFO ] Deduced a trap composed of 13 places in 355 ms of which 5 ms to minimize.
[2024-05-21 00:00:36] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 4 ms to minimize.
[2024-05-21 00:00:37] [INFO ] Deduced a trap composed of 48 places in 339 ms of which 5 ms to minimize.
[2024-05-21 00:00:39] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 3 ms to minimize.
[2024-05-21 00:00:41] [INFO ] Deduced a trap composed of 74 places in 330 ms of which 5 ms to minimize.
[2024-05-21 00:00:41] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 4 ms to minimize.
[2024-05-21 00:00:42] [INFO ] Deduced a trap composed of 42 places in 638 ms of which 7 ms to minimize.
[2024-05-21 00:00:45] [INFO ] Deduced a trap composed of 84 places in 323 ms of which 5 ms to minimize.
[2024-05-21 00:00:45] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 4 ms to minimize.
[2024-05-21 00:00:51] [INFO ] Deduced a trap composed of 34 places in 335 ms of which 5 ms to minimize.
[2024-05-21 00:00:52] [INFO ] Deduced a trap composed of 69 places in 528 ms of which 6 ms to minimize.
[2024-05-21 00:00:54] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 3 ms to minimize.
[2024-05-21 00:00:56] [INFO ] Deduced a trap composed of 100 places in 326 ms of which 5 ms to minimize.
[2024-05-21 00:00:56] [INFO ] Deduced a trap composed of 71 places in 300 ms of which 4 ms to minimize.
[2024-05-21 00:00:57] [INFO ] Deduced a trap composed of 75 places in 163 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s110 0)
(s112 0)
(s114 0)
(s116 0)
(s118 0)
(s120 0)
(s122 0)
(s124 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s293 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s374 1)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 1)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 1)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s521 0)
(s522 0)
(s530 0)
(s531 0)
(s532 0)
(s533 1)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 1)
(s541 0)
(s542 0)
(s543 0)
(s544 1)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 1)
(s606 1)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 1)
(s735 0)
(s736 1)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s762 0)
(s763 0)
(s764 0)
(s765 1)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 1)
(s773 0)
(s774 0)
(s775 0)
(s776 1)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 1)
(s782 1)
(s783 0)
(s784 0)
(s785 0)
(s787 0)
(s789 0)
(s791 0)
(s793 0)
(s795 0)
(s797 0)
(s799 0)
(s801 0)
(s820 1)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 1)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s975 0)
(s976 0)
(s977 0)
(s978 1)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 1)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 1)
(s1031 0)
(s1033 0)
(s1035 0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 922/3493 variables, and 119 constraints, problems are : Problem set: 0 solved, 655 unsolved in 75033 ms.
Refiners :[Positive P Invariants (semi-flows): 37/67 constraints, Generalized P Invariants (flows): 65/139 constraints, State Equation: 0/1439 constraints, PredecessorRefiner: 0/655 constraints, Known Traps: 17/17 constraints]
After SMT, in 150419ms problems are : Problem set: 0 solved, 655 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 655 out of 1439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1439/1439 places, 2054/2054 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1439 transition count 2032
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 1417 transition count 2032
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 1417 transition count 2017
Deduced a syphon composed of 15 places in 9 ms
Ensure Unique test removed 3 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 77 place count 1399 transition count 2017
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 1399 transition count 2015
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 1397 transition count 2015
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 81 place count 1397 transition count 2014
Deduced a syphon composed of 1 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 84 place count 1395 transition count 2014
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 84 place count 1395 transition count 2013
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 1394 transition count 2013
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 95 place count 1389 transition count 2009
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 95 place count 1389 transition count 2007
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 99 place count 1387 transition count 2007
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 1386 transition count 2007
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 104 place count 1384 transition count 2005
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 1383 transition count 2004
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 1383 transition count 2004
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 1382 transition count 2003
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 1382 transition count 2003
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 1382 transition count 2002
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 1382 transition count 2001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 111 place count 1381 transition count 2001
Applied a total of 111 rules in 456 ms. Remains 1381 /1439 variables (removed 58) and now considering 2001/2054 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 1381/1439 places, 2001/2054 transitions.
RANDOM walk for 2264046 steps (24871 resets) in 120004 ms. (18 steps per ms) remains 649/655 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (9 resets) in 41 ms. (95 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 649/649 properties
Probabilistic random walk after 1000001 steps, saw 293998 distinct states, run finished after 47283 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 2001 rows 1381 cols
[2024-05-21 00:02:17] [INFO ] Computed 200 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/649 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/649 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (OVERLAPS) 32/681 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/681 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 5 (OVERLAPS) 1/682 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/682 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 7 (OVERLAPS) 200/882 variables, 39/99 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 882/3382 variables, and 99 constraints, problems are : Problem set: 0 solved, 649 unsolved in 90019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/63 constraints, Generalized P Invariants (flows): 62/137 constraints, State Equation: 0/1381 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 649 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/649 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/649 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (OVERLAPS) 32/681 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/681 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 5 (OVERLAPS) 1/682 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/682 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 7 (OVERLAPS) 200/882 variables, 39/99 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-05-21 00:04:32] [INFO ] Deduced a trap composed of 35 places in 617 ms of which 10 ms to minimize.
[2024-05-21 00:04:33] [INFO ] Deduced a trap composed of 68 places in 291 ms of which 4 ms to minimize.
[2024-05-21 00:04:33] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 3 ms to minimize.
[2024-05-21 00:04:33] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 4 ms to minimize.
[2024-05-21 00:04:34] [INFO ] Deduced a trap composed of 77 places in 339 ms of which 5 ms to minimize.
[2024-05-21 00:04:34] [INFO ] Deduced a trap composed of 56 places in 337 ms of which 5 ms to minimize.
[2024-05-21 00:04:36] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-05-21 00:04:36] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 5 ms to minimize.
[2024-05-21 00:04:36] [INFO ] Deduced a trap composed of 79 places in 262 ms of which 4 ms to minimize.
[2024-05-21 00:04:37] [INFO ] Deduced a trap composed of 98 places in 262 ms of which 4 ms to minimize.
[2024-05-21 00:04:38] [INFO ] Deduced a trap composed of 66 places in 344 ms of which 5 ms to minimize.
[2024-05-21 00:04:39] [INFO ] Deduced a trap composed of 45 places in 582 ms of which 7 ms to minimize.
[2024-05-21 00:04:40] [INFO ] Deduced a trap composed of 66 places in 486 ms of which 7 ms to minimize.
[2024-05-21 00:04:43] [INFO ] Deduced a trap composed of 24 places in 372 ms of which 5 ms to minimize.
[2024-05-21 00:04:44] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 4 ms to minimize.
[2024-05-21 00:04:44] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 7 ms to minimize.
[2024-05-21 00:04:49] [INFO ] Deduced a trap composed of 85 places in 312 ms of which 5 ms to minimize.
[2024-05-21 00:04:50] [INFO ] Deduced a trap composed of 45 places in 427 ms of which 6 ms to minimize.
[2024-05-21 00:04:54] [INFO ] Deduced a trap composed of 49 places in 538 ms of which 8 ms to minimize.
[2024-05-21 00:04:56] [INFO ] Deduced a trap composed of 32 places in 518 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/882 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-05-21 00:05:13] [INFO ] Deduced a trap composed of 95 places in 570 ms of which 7 ms to minimize.
[2024-05-21 00:05:15] [INFO ] Deduced a trap composed of 53 places in 748 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 882/3382 variables, and 121 constraints, problems are : Problem set: 0 solved, 649 unsolved in 90024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/63 constraints, Generalized P Invariants (flows): 62/137 constraints, State Equation: 0/1381 constraints, PredecessorRefiner: 0/649 constraints, Known Traps: 22/22 constraints]
After SMT, in 180341ms problems are : Problem set: 0 solved, 649 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 649 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 2001/2001 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1381 transition count 1997
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1377 transition count 1997
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 1375 transition count 1995
Applied a total of 12 rules in 97 ms. Remains 1375 /1381 variables (removed 6) and now considering 1995/2001 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 1375/1381 places, 1995/2001 transitions.
RANDOM walk for 2325932 steps (25898 resets) in 120004 ms. (19 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 649/649 properties
Probabilistic random walk after 1000001 steps, saw 293997 distinct states, run finished after 47381 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 1995 rows 1375 cols
[2024-05-21 00:06:35] [INFO ] Computed 200 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/649 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/649 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (OVERLAPS) 32/681 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/681 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 5 (OVERLAPS) 1/682 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/682 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 7 (OVERLAPS) 197/879 variables, 39/99 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 879/3370 variables, and 99 constraints, problems are : Problem set: 0 solved, 649 unsolved in 105022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/63 constraints, Generalized P Invariants (flows): 62/137 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 649 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/649 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/649 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (OVERLAPS) 32/681 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/681 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 5 (OVERLAPS) 1/682 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/682 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 7 (OVERLAPS) 197/879 variables, 39/99 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-05-21 00:09:00] [INFO ] Deduced a trap composed of 59 places in 270 ms of which 4 ms to minimize.
[2024-05-21 00:09:00] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 3 ms to minimize.
[2024-05-21 00:09:00] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 3 ms to minimize.
[2024-05-21 00:09:02] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
[2024-05-21 00:09:02] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-21 00:09:04] [INFO ] Deduced a trap composed of 47 places in 322 ms of which 4 ms to minimize.
[2024-05-21 00:09:05] [INFO ] Deduced a trap composed of 48 places in 527 ms of which 7 ms to minimize.
[2024-05-21 00:09:06] [INFO ] Deduced a trap composed of 67 places in 553 ms of which 8 ms to minimize.
[2024-05-21 00:09:10] [INFO ] Deduced a trap composed of 23 places in 381 ms of which 5 ms to minimize.
[2024-05-21 00:09:10] [INFO ] Deduced a trap composed of 83 places in 226 ms of which 3 ms to minimize.
[2024-05-21 00:09:10] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 5 ms to minimize.
[2024-05-21 00:09:10] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 3 ms to minimize.
[2024-05-21 00:09:12] [INFO ] Deduced a trap composed of 87 places in 230 ms of which 3 ms to minimize.
[2024-05-21 00:09:15] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 3 ms to minimize.
[2024-05-21 00:09:17] [INFO ] Deduced a trap composed of 53 places in 580 ms of which 9 ms to minimize.
[2024-05-21 00:09:17] [INFO ] Deduced a trap composed of 45 places in 475 ms of which 6 ms to minimize.
[2024-05-21 00:09:20] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2024-05-21 00:09:20] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-05-21 00:09:24] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 4 ms to minimize.
[2024-05-21 00:09:24] [INFO ] Deduced a trap composed of 68 places in 351 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/879 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 649 unsolved
[2024-05-21 00:09:27] [INFO ] Deduced a trap composed of 90 places in 176 ms of which 3 ms to minimize.
[2024-05-21 00:09:28] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 3 ms to minimize.
[2024-05-21 00:09:35] [INFO ] Deduced a trap composed of 36 places in 453 ms of which 6 ms to minimize.
[2024-05-21 00:09:38] [INFO ] Deduced a trap composed of 120 places in 371 ms of which 5 ms to minimize.
[2024-05-21 00:09:41] [INFO ] Deduced a trap composed of 97 places in 367 ms of which 5 ms to minimize.
[2024-05-21 00:09:44] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-05-21 00:09:48] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 4 ms to minimize.
[2024-05-21 00:09:49] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-05-21 00:09:52] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/879 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 879/3370 variables, and 128 constraints, problems are : Problem set: 0 solved, 649 unsolved in 105034 ms.
Refiners :[Positive P Invariants (semi-flows): 37/63 constraints, Generalized P Invariants (flows): 62/137 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 0/649 constraints, Known Traps: 29/29 constraints]
After SMT, in 210287ms problems are : Problem set: 0 solved, 649 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 649 out of 1375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1375/1375 places, 1995/1995 transitions.
Applied a total of 0 rules in 31 ms. Remains 1375 /1375 variables (removed 0) and now considering 1995/1995 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1375/1375 places, 1995/1995 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1375/1375 places, 1995/1995 transitions.
Applied a total of 0 rules in 31 ms. Remains 1375 /1375 variables (removed 0) and now considering 1995/1995 (removed 0) transitions.
[2024-05-21 00:10:05] [INFO ] Invariant cache hit.
[2024-05-21 00:10:07] [INFO ] Implicit Places using invariants in 1308 ms returned [108, 312, 353, 517, 544, 585, 746, 773, 796, 951, 975, 976, 977, 995, 1013, 1033, 1082, 1083, 1094, 1095, 1097, 1114, 1132, 1201, 1205, 1206, 1209, 1220, 1221, 1222, 1240, 1242, 1246, 1264, 1265, 1266, 1267, 1279, 1285, 1291, 1297, 1303, 1309, 1315, 1321, 1327, 1333, 1339]
[2024-05-21 00:10:07] [INFO ] Actually due to overlaps returned [1240, 1222, 108, 353, 585, 796, 995, 1114, 1246, 977, 1097, 976, 1095, 1220, 1264, 312, 544, 773, 975, 1094, 1221, 1242, 1265, 517, 746, 951, 1082, 1083, 1205, 1206, 1132, 1266, 1309, 1327, 1339, 1013, 1033, 1209, 1267, 1279, 1285, 1291, 1297, 1303, 1315, 1321, 1333]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 1329 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1328/1375 places, 1995/1995 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 1327 transition count 1910
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 1242 transition count 1909
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 172 place count 1242 transition count 1891
Deduced a syphon composed of 18 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 209 place count 1223 transition count 1891
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 221 place count 1219 transition count 1883
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 229 place count 1211 transition count 1883
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 244 place count 1196 transition count 1868
Iterating global reduction 4 with 15 rules applied. Total rules applied 259 place count 1196 transition count 1868
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 262 place count 1196 transition count 1865
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 262 place count 1196 transition count 1864
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 264 place count 1195 transition count 1864
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 267 place count 1192 transition count 1858
Iterating global reduction 5 with 3 rules applied. Total rules applied 270 place count 1192 transition count 1858
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 271 place count 1191 transition count 1857
Iterating global reduction 5 with 1 rules applied. Total rules applied 272 place count 1191 transition count 1857
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 273 place count 1190 transition count 1855
Iterating global reduction 5 with 1 rules applied. Total rules applied 274 place count 1190 transition count 1855
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 7 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 358 place count 1148 transition count 1813
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 359 place count 1148 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 360 place count 1147 transition count 1811
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 1147 transition count 1811
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 362 place count 1147 transition count 1810
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 366 place count 1145 transition count 1811
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 379 place count 1145 transition count 1798
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 393 place count 1131 transition count 1798
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 410 place count 1131 transition count 1798
Applied a total of 410 rules in 399 ms. Remains 1131 /1328 variables (removed 197) and now considering 1798/1995 (removed 197) transitions.
// Phase 1: matrix 1798 rows 1131 cols
[2024-05-21 00:10:07] [INFO ] Computed 146 invariants in 29 ms
[2024-05-21 00:10:08] [INFO ] Implicit Places using invariants in 1289 ms returned [236, 278, 279, 468, 496, 497, 680, 708, 709, 860, 866, 869, 871, 892, 893, 970, 976, 979, 981, 986, 987, 1039, 1056, 1062, 1065, 1067]
[2024-05-21 00:10:08] [INFO ] Actually due to overlaps returned [278, 496, 708, 892, 986, 279, 497, 709, 893, 987, 860, 866, 871, 970, 976, 981, 1056, 1062, 1067, 236, 468, 680, 1039]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 1292 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1108/1375 places, 1798/1995 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1096 transition count 1786
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1096 transition count 1786
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 1093 transition count 1783
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 1093 transition count 1783
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 1089 transition count 1779
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 47 place count 1089 transition count 1770
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 1080 transition count 1770
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1080 transition count 1769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 1079 transition count 1769
Applied a total of 58 rules in 152 ms. Remains 1079 /1108 variables (removed 29) and now considering 1769/1798 (removed 29) transitions.
// Phase 1: matrix 1769 rows 1079 cols
[2024-05-21 00:10:09] [INFO ] Computed 123 invariants in 20 ms
[2024-05-21 00:10:09] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-05-21 00:10:09] [INFO ] Invariant cache hit.
[2024-05-21 00:10:12] [INFO ] Implicit Places using invariants and state equation in 2735 ms returned []
Implicit Place search using SMT with State Equation took 3551 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1079/1375 places, 1769/1995 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6758 ms. Remains : 1079/1375 places, 1769/1995 transitions.
RANDOM walk for 2383866 steps (36610 resets) in 120004 ms. (19 steps per ms) remains 646/649 properties
BEST_FIRST walk for 4004 steps (11 resets) in 37 ms. (105 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 39 ms. (100 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 58 ms. (67 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (10 resets) in 50 ms. (78 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (10 resets) in 49 ms. (80 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 44 ms. (88 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 54 ms. (72 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 57 ms. (69 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 55 ms. (71 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (11 resets) in 65 ms. (60 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (9 resets) in 62 ms. (63 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 50 ms. (78 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (9 resets) in 39 ms. (100 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (9 resets) in 37 ms. (105 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 63 ms. (62 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (9 resets) in 75 ms. (52 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 43 ms. (91 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (9 resets) in 59 ms. (66 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4001 steps (10 resets) in 66 ms. (59 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (9 resets) in 46 ms. (85 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 73 ms. (54 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 39 ms. (100 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 61 ms. (64 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 37 ms. (105 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 63 ms. (62 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 68 ms. (58 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (10 resets) in 43 ms. (90 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 53 ms. (74 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 37 ms. (105 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (9 resets) in 70 ms. (56 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 101 ms. (39 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 72 ms. (54 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (11 resets) in 82 ms. (48 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (10 resets) in 72 ms. (54 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 75 ms. (52 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (8 resets) in 84 ms. (47 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 53 ms. (74 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 77 ms. (51 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (9 resets) in 122 ms. (32 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (10 resets) in 74 ms. (53 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 72 ms. (54 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (9 resets) in 66 ms. (59 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 61 ms. (64 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 63 ms. (62 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 88 ms. (44 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 108 ms. (36 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 56 ms. (70 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 82 ms. (48 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 88 ms. (44 steps per ms) remains 646/646 properties
Probabilistic random walk after 1000001 steps, saw 186927 distinct states, run finished after 27870 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-21 00:11:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/646 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/646 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 2 (OVERLAPS) 22/668 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/668 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 5 (OVERLAPS) 221/889 variables, 31/92 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 7 (OVERLAPS) 9/898 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 646 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 216.0))
(s1 (/ 13.0 216.0))
(s2 (/ 1.0 216.0))
(s3 (/ 1.0 216.0))
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 (/ 1.0 216.0))
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 (/ 1.0 216.0))
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 (/ 193.0 216.0))
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 (/ 1.0 216.0))
(s20 0.0)
(s21 0.0)
(s22 (/ 1.0 216.0))
(s23 (/ 1.0 216.0))
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 (/ 1.0 216.0))
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 (/ 1.0 216.0))
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 (/ 1.0 216.0))
(s37 (/ 1.0 72.0))
(s38 (/ 1.0 216.0))
(s39 (/ 17.0 18.0))
(s40 (/ 1.0 36.0))
(s41 (/ 1.0 216.0))
(s42 0.0)
(s43 0.0)
(s44 (/ 1.0 216.0))
(s45 (/ 1.0 216.0))
(s46 (/ 1.0 216.0))
(s47 (/ 1.0 216.0))
(s48 (/ 1.0 216.0))
(s49 (/ 1.0 216.0))
(s50 (/ 1.0 216.0))
(s51 (/ 1.0 24.0))
(s52 (/ 1.0 216.0))
(s53 (/ 1.0 216.0))
(s54 (/ 1.0 216.0))
(s55 (/ 1.0 216.0))
(s56 (/ 1.0 216.0))
(s57 (/ 1.0 216.0))
(s58 (/ 1.0 216.0))
(s59 (/ 23.0 27.0))
(s60 (/ 1.0 216.0))
(s61 (/ 1.0 216.0))
(s62 (/ 1.0 216.0))
(s63 (/ 1.0 216.0))
(s64 (/ 1.0 216.0))
(s65 (/ 1.0 216.0))
(s66 (/ 1.0 216.0))
(s67 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2848 variables, and 97 constraints, problems are : Problem set: 0 solved, 646 unsolved in 120031 ms.
Refiners :[Positive P Invariants (semi-flows): 38/44 constraints, Generalized P Invariants (flows): 59/79 constraints, State Equation: 0/1079 constraints, PredecessorRefiner: 646/646 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/646 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/646 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 2 (OVERLAPS) 22/668 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/668 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 646 unsolved
[2024-05-21 00:13:27] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-05-21 00:13:28] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 00:13:32] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/668 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 6 (OVERLAPS) 221/889 variables, 31/95 constraints. Problems are: Problem set: 0 solved, 646 unsolved
[2024-05-21 00:14:03] [INFO ] Deduced a trap composed of 65 places in 540 ms of which 7 ms to minimize.
[2024-05-21 00:14:04] [INFO ] Deduced a trap composed of 51 places in 385 ms of which 6 ms to minimize.
[2024-05-21 00:14:08] [INFO ] Deduced a trap composed of 68 places in 386 ms of which 5 ms to minimize.
[2024-05-21 00:14:08] [INFO ] Deduced a trap composed of 105 places in 387 ms of which 5 ms to minimize.
[2024-05-21 00:14:11] [INFO ] Deduced a trap composed of 91 places in 400 ms of which 5 ms to minimize.
[2024-05-21 00:14:11] [INFO ] Deduced a trap composed of 48 places in 366 ms of which 5 ms to minimize.
[2024-05-21 00:14:12] [INFO ] Deduced a trap composed of 128 places in 367 ms of which 5 ms to minimize.
[2024-05-21 00:14:13] [INFO ] Deduced a trap composed of 67 places in 398 ms of which 6 ms to minimize.
[2024-05-21 00:14:14] [INFO ] Deduced a trap composed of 80 places in 187 ms of which 3 ms to minimize.
[2024-05-21 00:14:19] [INFO ] Deduced a trap composed of 88 places in 261 ms of which 5 ms to minimize.
[2024-05-21 00:14:20] [INFO ] Deduced a trap composed of 44 places in 385 ms of which 5 ms to minimize.
[2024-05-21 00:14:20] [INFO ] Deduced a trap composed of 97 places in 378 ms of which 5 ms to minimize.
[2024-05-21 00:14:22] [INFO ] Deduced a trap composed of 64 places in 557 ms of which 10 ms to minimize.
[2024-05-21 00:14:22] [INFO ] Deduced a trap composed of 53 places in 231 ms of which 3 ms to minimize.
[2024-05-21 00:14:22] [INFO ] Deduced a trap composed of 34 places in 458 ms of which 7 ms to minimize.
[2024-05-21 00:14:23] [INFO ] Deduced a trap composed of 40 places in 275 ms of which 4 ms to minimize.
[2024-05-21 00:14:23] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 3 ms to minimize.
[2024-05-21 00:14:24] [INFO ] Deduced a trap composed of 72 places in 669 ms of which 6 ms to minimize.
[2024-05-21 00:14:28] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 3 ms to minimize.
[2024-05-21 00:14:29] [INFO ] Deduced a trap composed of 64 places in 308 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 646 unsolved
[2024-05-21 00:14:32] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 3 ms to minimize.
[2024-05-21 00:14:32] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 3 ms to minimize.
[2024-05-21 00:14:42] [INFO ] Deduced a trap composed of 64 places in 305 ms of which 4 ms to minimize.
[2024-05-21 00:14:43] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 4 ms to minimize.
[2024-05-21 00:14:45] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2024-05-21 00:14:45] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-21 00:14:47] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/889 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 646 unsolved
[2024-05-21 00:14:56] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 3 ms to minimize.
[2024-05-21 00:14:57] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 889/2848 variables, and 124 constraints, problems are : Problem set: 0 solved, 646 unsolved in 120032 ms.
Refiners :[Positive P Invariants (semi-flows): 33/44 constraints, Generalized P Invariants (flows): 59/79 constraints, State Equation: 0/1079 constraints, PredecessorRefiner: 0/646 constraints, Known Traps: 32/32 constraints]
After SMT, in 240216ms problems are : Problem set: 0 solved, 646 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 646 out of 1079 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1079/1079 places, 1769/1769 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1079 transition count 1766
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1076 transition count 1766
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1076 transition count 1766
Applied a total of 7 rules in 67 ms. Remains 1076 /1079 variables (removed 3) and now considering 1766/1769 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1076/1079 places, 1766/1769 transitions.
RANDOM walk for 2313574 steps (35294 resets) in 120004 ms. (19 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (10 resets) in 52 ms. (75 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 55 ms. (71 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (9 resets) in 76 ms. (51 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 50 ms. (78 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (9 resets) in 37 ms. (105 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 51 ms. (76 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (10 resets) in 58 ms. (67 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 52 ms. (75 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 61 ms. (64 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 39 ms. (100 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (9 resets) in 45 ms. (87 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (10 resets) in 47 ms. (83 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 77 ms. (51 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 80 ms. (49 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (9 resets) in 82 ms. (48 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (10 resets) in 82 ms. (48 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 85 ms. (46 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 80 ms. (49 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 94 ms. (42 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 93 ms. (42 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 78 ms. (50 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (9 resets) in 87 ms. (45 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 108 ms. (36 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (10 resets) in 77 ms. (51 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (9 resets) in 88 ms. (44 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 56 ms. (70 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 102 ms. (38 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (10 resets) in 86 ms. (46 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 96 ms. (41 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 98 ms. (40 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 95 ms. (41 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (10 resets) in 86 ms. (46 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (11 resets) in 85 ms. (46 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (11 resets) in 62 ms. (63 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (9 resets) in 72 ms. (54 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (11 resets) in 47 ms. (83 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 81 ms. (48 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 82 ms. (48 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 84 ms. (47 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 88 ms. (44 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 61 ms. (64 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (9 resets) in 94 ms. (42 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (12 resets) in 87 ms. (45 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 97 ms. (40 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4004 steps (10 resets) in 69 ms. (57 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (9 resets) in 74 ms. (53 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (9 resets) in 75 ms. (52 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (11 resets) in 87 ms. (45 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4002 steps (9 resets) in 86 ms. (46 steps per ms) remains 646/646 properties
BEST_FIRST walk for 4003 steps (10 resets) in 78 ms. (50 steps per ms) remains 646/646 properties
Probabilistic random walk after 1000001 steps, saw 186929 distinct states, run finished after 28481 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 1766 rows 1076 cols
[2024-05-21 00:16:11] [INFO ] Computed 123 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/646 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/646 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 2 (OVERLAPS) 22/668 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/668 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 5 (OVERLAPS) 220/888 variables, 33/94 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 7 (OVERLAPS) 6/894 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/894 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 9 (OVERLAPS) 99/993 variables, 11/109 constraints. Problems are: Problem set: 0 solved, 646 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 993/2842 variables, and 109 constraints, problems are : Problem set: 0 solved, 646 unsolved in 135026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/42 constraints, Generalized P Invariants (flows): 72/81 constraints, State Equation: 0/1076 constraints, PredecessorRefiner: 646/646 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/646 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/646 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 2 (OVERLAPS) 22/668 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/668 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 646 unsolved
[2024-05-21 00:18:41] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-05-21 00:18:41] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 00:18:46] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/668 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 6 (OVERLAPS) 220/888 variables, 33/97 constraints. Problems are: Problem set: 0 solved, 646 unsolved
[2024-05-21 00:19:15] [INFO ] Deduced a trap composed of 41 places in 383 ms of which 8 ms to minimize.
[2024-05-21 00:19:16] [INFO ] Deduced a trap composed of 41 places in 280 ms of which 4 ms to minimize.
[2024-05-21 00:19:16] [INFO ] Deduced a trap composed of 42 places in 388 ms of which 5 ms to minimize.
[2024-05-21 00:19:17] [INFO ] Deduced a trap composed of 66 places in 380 ms of which 5 ms to minimize.
[2024-05-21 00:19:20] [INFO ] Deduced a trap composed of 72 places in 264 ms of which 4 ms to minimize.
[2024-05-21 00:19:20] [INFO ] Deduced a trap composed of 74 places in 230 ms of which 3 ms to minimize.
[2024-05-21 00:19:21] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 3 ms to minimize.
[2024-05-21 00:19:21] [INFO ] Deduced a trap composed of 36 places in 270 ms of which 4 ms to minimize.
[2024-05-21 00:19:21] [INFO ] Deduced a trap composed of 58 places in 256 ms of which 5 ms to minimize.
[2024-05-21 00:19:22] [INFO ] Deduced a trap composed of 53 places in 460 ms of which 7 ms to minimize.
[2024-05-21 00:19:25] [INFO ] Deduced a trap composed of 75 places in 263 ms of which 4 ms to minimize.
[2024-05-21 00:19:26] [INFO ] Deduced a trap composed of 68 places in 206 ms of which 3 ms to minimize.
[2024-05-21 00:19:26] [INFO ] Deduced a trap composed of 93 places in 373 ms of which 5 ms to minimize.
[2024-05-21 00:19:31] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 4 ms to minimize.
[2024-05-21 00:19:32] [INFO ] Deduced a trap composed of 63 places in 553 ms of which 7 ms to minimize.
[2024-05-21 00:19:32] [INFO ] Deduced a trap composed of 68 places in 548 ms of which 8 ms to minimize.
[2024-05-21 00:19:33] [INFO ] Deduced a trap composed of 86 places in 216 ms of which 3 ms to minimize.
[2024-05-21 00:19:33] [INFO ] Deduced a trap composed of 66 places in 428 ms of which 6 ms to minimize.
[2024-05-21 00:19:38] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 3 ms to minimize.
[2024-05-21 00:19:41] [INFO ] Deduced a trap composed of 31 places in 556 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 646 unsolved
[2024-05-21 00:19:59] [INFO ] Deduced a trap composed of 29 places in 421 ms of which 5 ms to minimize.
[2024-05-21 00:20:04] [INFO ] Deduced a trap composed of 54 places in 776 ms of which 10 ms to minimize.
[2024-05-21 00:20:07] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 3 ms to minimize.
[2024-05-21 00:20:08] [INFO ] Deduced a trap composed of 29 places in 334 ms of which 5 ms to minimize.
[2024-05-21 00:20:09] [INFO ] Deduced a trap composed of 111 places in 248 ms of which 3 ms to minimize.
[2024-05-21 00:20:10] [INFO ] Deduced a trap composed of 76 places in 223 ms of which 4 ms to minimize.
[2024-05-21 00:20:10] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 3 ms to minimize.
[2024-05-21 00:20:13] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 888/2842 variables, and 125 constraints, problems are : Problem set: 0 solved, 646 unsolved in 135020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/42 constraints, Generalized P Invariants (flows): 61/81 constraints, State Equation: 0/1076 constraints, PredecessorRefiner: 0/646 constraints, Known Traps: 31/31 constraints]
After SMT, in 270237ms problems are : Problem set: 0 solved, 646 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 646 out of 1076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1076/1076 places, 1766/1766 transitions.
Applied a total of 0 rules in 20 ms. Remains 1076 /1076 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1076/1076 places, 1766/1766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1076/1076 places, 1766/1766 transitions.
Applied a total of 0 rules in 18 ms. Remains 1076 /1076 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
[2024-05-21 00:20:41] [INFO ] Invariant cache hit.
[2024-05-21 00:20:42] [INFO ] Implicit Places using invariants in 837 ms returned []
[2024-05-21 00:20:42] [INFO ] Invariant cache hit.
[2024-05-21 00:20:45] [INFO ] Implicit Places using invariants and state equation in 2569 ms returned []
Implicit Place search using SMT with State Equation took 3410 ms to find 0 implicit places.
[2024-05-21 00:20:45] [INFO ] Redundant transitions in 202 ms returned []
Running 1729 sub problems to find dead transitions.
[2024-05-21 00:20:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1075 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1729 unsolved
SMT process timed out in 31496ms, After SMT, problems are : Problem set: 0 solved, 1729 unsolved
Search for dead transitions found 0 dead transitions in 31541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35208 ms. Remains : 1076/1076 places, 1766/1766 transitions.
RANDOM walk for 400000 steps (6055 resets) in 21595 ms. (18 steps per ms) remains 646/646 properties
Running SMT prover for 646 properties.
[2024-05-21 00:21:22] [INFO ] Invariant cache hit.
[2024-05-21 00:21:23] [INFO ] [Real]Absence check using 42 positive place invariants in 24 ms returned sat
[2024-05-21 00:21:23] [INFO ] [Real]Absence check using 42 positive and 81 generalized place invariants in 85 ms returned sat
[2024-05-21 00:21:28] [INFO ] After 4292ms SMT Verify possible using state equation in real domain returned unsat :0 sat :646
TRAPS : Iteration 0
[2024-05-21 00:23:22] [INFO ] After 117838ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:646
[2024-05-21 00:23:22] [INFO ] After 119329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:646
[2024-05-21 00:23:22] [INFO ] [Nat]Absence check using 42 positive place invariants in 15 ms returned sat
[2024-05-21 00:23:22] [INFO ] [Nat]Absence check using 42 positive and 81 generalized place invariants in 51 ms returned sat

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="ASLink-PT-06b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ASLink-PT-06b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r012-smll-171620123800063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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