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.r466-smll-171620124300043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-04b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124300043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 669K 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 1717184627921

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:43:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 19:43:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:43:50] [INFO ] Load time of PNML (sax parser for PT used): 465 ms
[2024-05-31 19:43:50] [INFO ] Transformed 2034 places.
[2024-05-31 19:43:50] [INFO ] Transformed 2567 transitions.
[2024-05-31 19:43:50] [INFO ] Found NUPN structural information;
[2024-05-31 19:43:50] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 757 ms.
Structural test allowed to assert that 246 places are NOT stable. Took 59 ms.
RANDOM walk for 40000 steps (90 resets) in 5822 ms. (6 steps per ms) remains 569/1788 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 569/569 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 33 ms. (3 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 21 ms. (5 steps per ms) remains 569/569 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 16 ms. (7 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 17 ms. (6 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 16 ms. (7 steps per ms) remains 569/569 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 569/569 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 569/569 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 569/569 properties
BEST_FIRST walk for 121 steps (8 resets) in 14 ms. (8 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 569/569 properties
BEST_FIRST walk for 121 steps (8 resets) in 7 ms. (15 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 569/569 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 569/569 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 569/569 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 569/569 properties
BEST_FIRST walk for 122 steps (8 resets) in 11 ms. (10 steps per ms) remains 569/569 properties
// Phase 1: matrix 2567 rows 2034 cols
[2024-05-31 19:43:53] [INFO ] Computed 199 invariants in 145 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 569/569 constraints. Problems are: Problem set: 0 solved, 569 unsolved
SMT process timed out in 5708ms, After SMT, problems are : Problem set: 0 solved, 569 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 569 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 2034 transition count 2207
Reduce places removed 360 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 382 rules applied. Total rules applied 742 place count 1674 transition count 2185
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 748 place count 1668 transition count 2185
Performed 324 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 324 Pre rules applied. Total rules applied 748 place count 1668 transition count 1861
Deduced a syphon composed of 324 places in 6 ms
Ensure Unique test removed 28 places
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 1424 place count 1316 transition count 1861
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 19 rules applied. Total rules applied 1443 place count 1313 transition count 1845
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1459 place count 1297 transition count 1845
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1459 place count 1297 transition count 1832
Deduced a syphon composed of 13 places in 16 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1498 place count 1271 transition count 1832
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1498 place count 1271 transition count 1819
Deduced a syphon composed of 13 places in 16 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1524 place count 1258 transition count 1819
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1561 place count 1221 transition count 1782
Iterating global reduction 5 with 37 rules applied. Total rules applied 1598 place count 1221 transition count 1782
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1599 place count 1221 transition count 1781
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 1599 place count 1221 transition count 1772
Deduced a syphon composed of 9 places in 14 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 1618 place count 1211 transition count 1772
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1618 place count 1211 transition count 1771
Deduced a syphon composed of 1 places in 14 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 1621 place count 1209 transition count 1771
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1623 place count 1207 transition count 1756
Iterating global reduction 6 with 2 rules applied. Total rules applied 1625 place count 1207 transition count 1756
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1625 place count 1207 transition count 1755
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 1627 place count 1206 transition count 1755
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1628 place count 1205 transition count 1747
Iterating global reduction 6 with 1 rules applied. Total rules applied 1629 place count 1205 transition count 1747
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1630 place count 1204 transition count 1739
Iterating global reduction 6 with 1 rules applied. Total rules applied 1631 place count 1204 transition count 1739
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1632 place count 1203 transition count 1731
Iterating global reduction 6 with 1 rules applied. Total rules applied 1633 place count 1203 transition count 1731
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1634 place count 1202 transition count 1723
Iterating global reduction 6 with 1 rules applied. Total rules applied 1635 place count 1202 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1636 place count 1201 transition count 1715
Iterating global reduction 6 with 1 rules applied. Total rules applied 1637 place count 1201 transition count 1715
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1638 place count 1200 transition count 1707
Iterating global reduction 6 with 1 rules applied. Total rules applied 1639 place count 1200 transition count 1707
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1640 place count 1199 transition count 1699
Iterating global reduction 6 with 1 rules applied. Total rules applied 1641 place count 1199 transition count 1699
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1642 place count 1198 transition count 1691
Iterating global reduction 6 with 1 rules applied. Total rules applied 1643 place count 1198 transition count 1691
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1644 place count 1197 transition count 1683
Iterating global reduction 6 with 1 rules applied. Total rules applied 1645 place count 1197 transition count 1683
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1646 place count 1196 transition count 1675
Iterating global reduction 6 with 1 rules applied. Total rules applied 1647 place count 1196 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1648 place count 1195 transition count 1667
Iterating global reduction 6 with 1 rules applied. Total rules applied 1649 place count 1195 transition count 1667
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1650 place count 1194 transition count 1659
Iterating global reduction 6 with 1 rules applied. Total rules applied 1651 place count 1194 transition count 1659
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1652 place count 1193 transition count 1651
Iterating global reduction 6 with 1 rules applied. Total rules applied 1653 place count 1193 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1654 place count 1192 transition count 1643
Iterating global reduction 6 with 1 rules applied. Total rules applied 1655 place count 1192 transition count 1643
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1656 place count 1191 transition count 1635
Iterating global reduction 6 with 1 rules applied. Total rules applied 1657 place count 1191 transition count 1635
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1658 place count 1190 transition count 1627
Iterating global reduction 6 with 1 rules applied. Total rules applied 1659 place count 1190 transition count 1627
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 6 with 200 rules applied. Total rules applied 1859 place count 1090 transition count 1527
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1861 place count 1089 transition count 1536
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 1866 place count 1089 transition count 1531
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1871 place count 1084 transition count 1531
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1873 place count 1084 transition count 1529
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1875 place count 1082 transition count 1529
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1876 place count 1081 transition count 1528
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 1879 place count 1079 transition count 1527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1880 place count 1078 transition count 1527
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 1880 place count 1078 transition count 1524
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1886 place count 1075 transition count 1524
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 1887 place count 1074 transition count 1524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1891 place count 1072 transition count 1522
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1892 place count 1071 transition count 1521
Iterating global reduction 11 with 1 rules applied. Total rules applied 1893 place count 1071 transition count 1521
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1894 place count 1071 transition count 1520
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1895 place count 1070 transition count 1520
Applied a total of 1895 rules in 1751 ms. Remains 1070 /2034 variables (removed 964) and now considering 1520/2567 (removed 1047) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1768 ms. Remains : 1070/2034 places, 1520/2567 transitions.
RANDOM walk for 1962022 steps (25099 resets) in 120004 ms. (16 steps per ms) remains 497/569 properties
BEST_FIRST walk for 40003 steps (118 resets) in 546 ms. (73 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (112 resets) in 549 ms. (72 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (116 resets) in 621 ms. (64 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40002 steps (112 resets) in 771 ms. (51 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40002 steps (113 resets) in 702 ms. (56 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40002 steps (109 resets) in 828 ms. (48 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (108 resets) in 571 ms. (69 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (115 resets) in 549 ms. (72 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40001 steps (103 resets) in 586 ms. (68 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (115 resets) in 541 ms. (73 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (109 resets) in 558 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (111 resets) in 585 ms. (68 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (110 resets) in 578 ms. (69 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (115 resets) in 538 ms. (74 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (114 resets) in 502 ms. (79 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (118 resets) in 526 ms. (75 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (113 resets) in 546 ms. (73 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40002 steps (108 resets) in 553 ms. (72 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (113 resets) in 547 ms. (72 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (111 resets) in 561 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (97 resets) in 592 ms. (67 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (112 resets) in 542 ms. (73 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40002 steps (115 resets) in 537 ms. (74 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (115 resets) in 538 ms. (74 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (109 resets) in 523 ms. (76 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (109 resets) in 543 ms. (73 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (114 resets) in 536 ms. (74 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (110 resets) in 560 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40002 steps (106 resets) in 560 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (113 resets) in 538 ms. (74 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (112 resets) in 528 ms. (75 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (115 resets) in 512 ms. (77 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (115 resets) in 527 ms. (75 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (119 resets) in 503 ms. (79 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (112 resets) in 532 ms. (75 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (113 resets) in 530 ms. (75 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (106 resets) in 555 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (110 resets) in 531 ms. (75 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (110 resets) in 536 ms. (74 steps per ms) remains 494/497 properties
BEST_FIRST walk for 40003 steps (110 resets) in 523 ms. (76 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (117 resets) in 500 ms. (79 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (110 resets) in 526 ms. (75 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (105 resets) in 554 ms. (72 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (117 resets) in 502 ms. (79 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (120 resets) in 526 ms. (75 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (109 resets) in 558 ms. (71 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40002 steps (108 resets) in 576 ms. (69 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (112 resets) in 543 ms. (73 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40002 steps (111 resets) in 552 ms. (72 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (116 resets) in 526 ms. (75 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (110 resets) in 534 ms. (74 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (109 resets) in 560 ms. (71 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (113 resets) in 509 ms. (78 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (108 resets) in 542 ms. (73 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (109 resets) in 549 ms. (72 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (106 resets) in 559 ms. (71 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (120 resets) in 530 ms. (75 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (117 resets) in 519 ms. (76 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40002 steps (114 resets) in 528 ms. (75 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (114 resets) in 536 ms. (74 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (107 resets) in 541 ms. (73 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (104 resets) in 584 ms. (68 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40002 steps (115 resets) in 547 ms. (72 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (114 resets) in 540 ms. (73 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40002 steps (110 resets) in 551 ms. (72 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (119 resets) in 544 ms. (73 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (105 resets) in 567 ms. (70 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (113 resets) in 543 ms. (73 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (109 resets) in 558 ms. (71 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40001 steps (107 resets) in 561 ms. (71 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (111 resets) in 554 ms. (72 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (106 resets) in 548 ms. (72 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (108 resets) in 563 ms. (70 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40000 steps (110 resets) in 558 ms. (71 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40002 steps (108 resets) in 580 ms. (68 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (108 resets) in 573 ms. (69 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (115 resets) in 533 ms. (74 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (111 resets) in 543 ms. (73 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (114 resets) in 527 ms. (75 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (102 resets) in 551 ms. (72 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (112 resets) in 534 ms. (74 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (116 resets) in 520 ms. (76 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (113 resets) in 505 ms. (79 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (113 resets) in 526 ms. (75 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40002 steps (112 resets) in 524 ms. (76 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (107 resets) in 554 ms. (72 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40004 steps (116 resets) in 514 ms. (77 steps per ms) remains 494/494 properties
BEST_FIRST walk for 40003 steps (109 resets) in 543 ms. (73 steps per ms) remains 494/494 properties
// Phase 1: matrix 1520 rows 1070 cols
[2024-05-31 19:44:43] [INFO ] Computed 150 invariants in 42 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 20/514 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (OVERLAPS) 165/679 variables, 32/74 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 7 (OVERLAPS) 29/708 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 708/2590 variables, and 80 constraints, problems are : Problem set: 0 solved, 494 unsolved in 45022 ms.
Refiners :[Positive P Invariants (semi-flows): 30/44 constraints, Generalized P Invariants (flows): 50/106 constraints, State Equation: 0/1070 constraints, PredecessorRefiner: 494/494 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 494 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 20/514 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (OVERLAPS) 165/679 variables, 32/74 constraints. Problems are: Problem set: 0 solved, 494 unsolved
[2024-05-31 19:45:49] [INFO ] Deduced a trap composed of 35 places in 818 ms of which 103 ms to minimize.
[2024-05-31 19:45:50] [INFO ] Deduced a trap composed of 48 places in 457 ms of which 7 ms to minimize.
[2024-05-31 19:45:50] [INFO ] Deduced a trap composed of 56 places in 315 ms of which 6 ms to minimize.
[2024-05-31 19:45:51] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 2 ms to minimize.
[2024-05-31 19:45:51] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:45:53] [INFO ] Deduced a trap composed of 75 places in 360 ms of which 6 ms to minimize.
[2024-05-31 19:45:54] [INFO ] Deduced a trap composed of 45 places in 538 ms of which 8 ms to minimize.
[2024-05-31 19:45:56] [INFO ] Deduced a trap composed of 48 places in 286 ms of which 5 ms to minimize.
[2024-05-31 19:45:57] [INFO ] Deduced a trap composed of 71 places in 332 ms of which 6 ms to minimize.
[2024-05-31 19:45:57] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 4 ms to minimize.
[2024-05-31 19:45:57] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 4 ms to minimize.
[2024-05-31 19:46:01] [INFO ] Deduced a trap composed of 44 places in 364 ms of which 5 ms to minimize.
[2024-05-31 19:46:02] [INFO ] Deduced a trap composed of 50 places in 584 ms of which 8 ms to minimize.
[2024-05-31 19:46:03] [INFO ] Deduced a trap composed of 70 places in 561 ms of which 7 ms to minimize.
[2024-05-31 19:46:03] [INFO ] Deduced a trap composed of 96 places in 499 ms of which 6 ms to minimize.
[2024-05-31 19:46:04] [INFO ] Deduced a trap composed of 55 places in 511 ms of which 6 ms to minimize.
[2024-05-31 19:46:05] [INFO ] Deduced a trap composed of 42 places in 495 ms of which 8 ms to minimize.
[2024-05-31 19:46:08] [INFO ] Deduced a trap composed of 23 places in 532 ms of which 8 ms to minimize.
[2024-05-31 19:46:08] [INFO ] Deduced a trap composed of 33 places in 518 ms of which 9 ms to minimize.
[2024-05-31 19:46:09] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 679/2590 variables, and 94 constraints, problems are : Problem set: 0 solved, 494 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 24/44 constraints, Generalized P Invariants (flows): 50/106 constraints, State Equation: 0/1070 constraints, PredecessorRefiner: 0/494 constraints, Known Traps: 20/20 constraints]
After SMT, in 90467ms problems are : Problem set: 0 solved, 494 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 494 out of 1070 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1070/1070 places, 1520/1520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1070 transition count 1500
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 1050 transition count 1500
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 40 place count 1050 transition count 1485
Deduced a syphon composed of 15 places in 5 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 70 place count 1035 transition count 1485
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 92 place count 1024 transition count 1474
Applied a total of 92 rules in 206 ms. Remains 1024 /1070 variables (removed 46) and now considering 1474/1520 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 1024/1070 places, 1474/1520 transitions.
RANDOM walk for 2208629 steps (28114 resets) in 120018 ms. (18 steps per ms) remains 379/494 properties
BEST_FIRST walk for 40002 steps (114 resets) in 529 ms. (75 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (111 resets) in 657 ms. (60 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (114 resets) in 707 ms. (56 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (111 resets) in 724 ms. (55 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (109 resets) in 764 ms. (52 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (117 resets) in 681 ms. (58 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (115 resets) in 605 ms. (66 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (106 resets) in 706 ms. (56 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (111 resets) in 835 ms. (47 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (111 resets) in 963 ms. (41 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (103 resets) in 756 ms. (52 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (107 resets) in 822 ms. (48 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (117 resets) in 656 ms. (60 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (112 resets) in 777 ms. (51 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (110 resets) in 654 ms. (61 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (106 resets) in 721 ms. (55 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (110 resets) in 828 ms. (48 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (112 resets) in 792 ms. (50 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (112 resets) in 788 ms. (50 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (103 resets) in 763 ms. (52 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (113 resets) in 658 ms. (60 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (107 resets) in 829 ms. (48 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (118 resets) in 804 ms. (49 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (105 resets) in 733 ms. (54 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (114 resets) in 772 ms. (51 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40001 steps (106 resets) in 809 ms. (49 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (112 resets) in 728 ms. (54 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (112 resets) in 792 ms. (50 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (118 resets) in 606 ms. (65 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (115 resets) in 632 ms. (63 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (122 resets) in 815 ms. (49 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (113 resets) in 709 ms. (56 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (109 resets) in 688 ms. (58 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (112 resets) in 843 ms. (47 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (110 resets) in 904 ms. (44 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (113 resets) in 792 ms. (50 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (115 resets) in 611 ms. (65 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (109 resets) in 769 ms. (51 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (115 resets) in 611 ms. (65 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (112 resets) in 618 ms. (64 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (110 resets) in 854 ms. (46 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40001 steps (116 resets) in 709 ms. (56 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (116 resets) in 626 ms. (63 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (114 resets) in 893 ms. (44 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (112 resets) in 791 ms. (50 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (110 resets) in 723 ms. (55 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (109 resets) in 766 ms. (52 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (116 resets) in 694 ms. (57 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (112 resets) in 739 ms. (54 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (117 resets) in 784 ms. (50 steps per ms) remains 379/379 properties
// Phase 1: matrix 1474 rows 1024 cols
[2024-05-31 19:46:56] [INFO ] Computed 150 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/379 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 19/398 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (OVERLAPS) 1/399 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 195/594 variables, 32/64 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/594 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 9 (OVERLAPS) 41/635 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/635 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 11 (OVERLAPS) 2/637 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/637 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 13 (OVERLAPS) 192/829 variables, 26/103 constraints. Problems are: Problem set: 0 solved, 379 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 829/2498 variables, and 103 constraints, problems are : Problem set: 0 solved, 379 unsolved in 75019 ms.
Refiners :[Positive P Invariants (semi-flows): 32/44 constraints, Generalized P Invariants (flows): 71/106 constraints, State Equation: 0/1024 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/379 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 19/398 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (OVERLAPS) 1/399 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 195/594 variables, 32/64 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-31 19:48:24] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 4 ms to minimize.
[2024-05-31 19:48:24] [INFO ] Deduced a trap composed of 73 places in 285 ms of which 4 ms to minimize.
[2024-05-31 19:48:24] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:48:24] [INFO ] Deduced a trap composed of 61 places in 226 ms of which 3 ms to minimize.
[2024-05-31 19:48:25] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-05-31 19:48:25] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
[2024-05-31 19:48:26] [INFO ] Deduced a trap composed of 74 places in 311 ms of which 5 ms to minimize.
[2024-05-31 19:48:27] [INFO ] Deduced a trap composed of 23 places in 328 ms of which 4 ms to minimize.
[2024-05-31 19:48:27] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 3 ms to minimize.
[2024-05-31 19:48:29] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 4 ms to minimize.
[2024-05-31 19:48:31] [INFO ] Deduced a trap composed of 62 places in 349 ms of which 4 ms to minimize.
[2024-05-31 19:48:33] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:48:35] [INFO ] Deduced a trap composed of 33 places in 435 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/594 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-31 19:48:39] [INFO ] Deduced a trap composed of 89 places in 316 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-31 19:48:50] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/594 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 12 (OVERLAPS) 41/635 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 14 (OVERLAPS) 2/637 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/637 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 16 (OVERLAPS) 192/829 variables, 26/118 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 829/2498 variables, and 118 constraints, problems are : Problem set: 0 solved, 379 unsolved in 75018 ms.
Refiners :[Positive P Invariants (semi-flows): 32/44 constraints, Generalized P Invariants (flows): 71/106 constraints, State Equation: 0/1024 constraints, PredecessorRefiner: 0/379 constraints, Known Traps: 15/15 constraints]
After SMT, in 150218ms problems are : Problem set: 0 solved, 379 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 379 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 1474/1474 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1024 transition count 1459
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1009 transition count 1459
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 30 place count 1009 transition count 1427
Deduced a syphon composed of 32 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 98 place count 973 transition count 1427
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 2 with 4 rules applied. Total rules applied 102 place count 973 transition count 1423
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 106 place count 969 transition count 1423
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 108 place count 967 transition count 1421
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 967 transition count 1421
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 132 place count 955 transition count 1411
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 4 with 1 rules applied. Total rules applied 133 place count 955 transition count 1410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 134 place count 954 transition count 1410
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 134 place count 954 transition count 1407
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 140 place count 951 transition count 1407
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 141 place count 950 transition count 1407
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 142 place count 949 transition count 1401
Iterating global reduction 7 with 1 rules applied. Total rules applied 143 place count 949 transition count 1401
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 144 place count 948 transition count 1401
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 150 place count 945 transition count 1398
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 152 place count 943 transition count 1396
Iterating global reduction 8 with 2 rules applied. Total rules applied 154 place count 943 transition count 1396
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 155 place count 942 transition count 1395
Iterating global reduction 8 with 1 rules applied. Total rules applied 156 place count 942 transition count 1395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 157 place count 942 transition count 1394
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 158 place count 942 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 159 place count 941 transition count 1393
Applied a total of 159 rules in 183 ms. Remains 941 /1024 variables (removed 83) and now considering 1393/1474 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 941/1024 places, 1393/1474 transitions.
RANDOM walk for 2658473 steps (34574 resets) in 120004 ms. (22 steps per ms) remains 375/379 properties
BEST_FIRST walk for 40004 steps (121 resets) in 557 ms. (71 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (114 resets) in 764 ms. (52 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (112 resets) in 870 ms. (45 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40001 steps (112 resets) in 838 ms. (47 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (111 resets) in 837 ms. (47 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (112 resets) in 832 ms. (48 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (114 resets) in 847 ms. (47 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40001 steps (117 resets) in 836 ms. (47 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (122 resets) in 711 ms. (56 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (113 resets) in 682 ms. (58 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (121 resets) in 663 ms. (60 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (115 resets) in 724 ms. (55 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (111 resets) in 764 ms. (52 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (114 resets) in 913 ms. (43 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (117 resets) in 982 ms. (40 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40000 steps (108 resets) in 813 ms. (49 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (116 resets) in 874 ms. (45 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (116 resets) in 686 ms. (58 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (114 resets) in 799 ms. (50 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (110 resets) in 674 ms. (59 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (117 resets) in 706 ms. (56 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (115 resets) in 801 ms. (49 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (120 resets) in 787 ms. (50 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (122 resets) in 740 ms. (53 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (114 resets) in 783 ms. (51 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (116 resets) in 815 ms. (49 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (116 resets) in 849 ms. (47 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (111 resets) in 807 ms. (49 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (117 resets) in 669 ms. (59 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (108 resets) in 742 ms. (53 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (120 resets) in 847 ms. (47 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (117 resets) in 780 ms. (51 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (126 resets) in 702 ms. (56 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (118 resets) in 769 ms. (51 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (118 resets) in 773 ms. (51 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (116 resets) in 739 ms. (54 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (113 resets) in 813 ms. (49 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (115 resets) in 809 ms. (49 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (115 resets) in 964 ms. (41 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (114 resets) in 784 ms. (50 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (112 resets) in 877 ms. (45 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (115 resets) in 867 ms. (46 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (112 resets) in 785 ms. (50 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (114 resets) in 981 ms. (40 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40004 steps (115 resets) in 736 ms. (54 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40002 steps (116 resets) in 699 ms. (57 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (121 resets) in 993 ms. (40 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (119 resets) in 744 ms. (53 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (119 resets) in 900 ms. (44 steps per ms) remains 375/375 properties
BEST_FIRST walk for 40003 steps (114 resets) in 839 ms. (47 steps per ms) remains 375/375 properties
Interrupted probabilistic random walk after 3093265 steps, run timeout after 126001 ms. (steps per millisecond=24 ) properties seen :33 out of 375
Probabilistic random walk after 3093265 steps, saw 795087 distinct states, run finished after 126021 ms. (steps per millisecond=24 ) properties seen :33
// Phase 1: matrix 1393 rows 941 cols
[2024-05-31 19:52:15] [INFO ] Computed 142 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (OVERLAPS) 16/358 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 1/359 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 119/478 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 9 (OVERLAPS) 35/513 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (OVERLAPS) 2/515 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/515 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 13 (OVERLAPS) 121/636 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/636 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 15 (OVERLAPS) 26/662 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/662 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 17 (OVERLAPS) 2/664 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 19 (OVERLAPS) 109/773 variables, 15/102 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/773 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 21 (OVERLAPS) 60/833 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/833 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 23 (OVERLAPS) 9/842 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/842 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 25 (OVERLAPS) 97/939 variables, 29/140 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 939/2334 variables, and 140 constraints, problems are : Problem set: 0 solved, 342 unsolved in 90017 ms.
Refiners :[Positive P Invariants (semi-flows): 41/42 constraints, Generalized P Invariants (flows): 99/100 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (OVERLAPS) 16/358 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 1/359 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 119/478 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-31 19:53:57] [INFO ] Deduced a trap composed of 67 places in 338 ms of which 6 ms to minimize.
[2024-05-31 19:53:58] [INFO ] Deduced a trap composed of 48 places in 337 ms of which 5 ms to minimize.
[2024-05-31 19:53:59] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-05-31 19:53:59] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-31 19:54:01] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:54:01] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:54:01] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 2 ms to minimize.
[2024-05-31 19:54:02] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 3 ms to minimize.
[2024-05-31 19:54:02] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 3 ms to minimize.
[2024-05-31 19:54:04] [INFO ] Deduced a trap composed of 49 places in 316 ms of which 5 ms to minimize.
[2024-05-31 19:54:05] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:54:06] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-31 19:54:09] [INFO ] Deduced a trap composed of 104 places in 216 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-31 19:54:18] [INFO ] Deduced a trap composed of 83 places in 219 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 12 (OVERLAPS) 35/513 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/513 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (OVERLAPS) 2/515 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 16 (OVERLAPS) 121/636 variables, 19/95 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-31 19:54:42] [INFO ] Deduced a trap composed of 84 places in 420 ms of which 5 ms to minimize.
[2024-05-31 19:54:47] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/636 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-31 19:54:59] [INFO ] Deduced a trap composed of 43 places in 405 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/636 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/636 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 20 (OVERLAPS) 26/662 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/2334 variables, and 102 constraints, problems are : Problem set: 0 solved, 342 unsolved in 90025 ms.
Refiners :[Positive P Invariants (semi-flows): 30/42 constraints, Generalized P Invariants (flows): 55/100 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 0/342 constraints, Known Traps: 17/17 constraints]
After SMT, in 180182ms problems are : Problem set: 0 solved, 342 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 342 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 1393/1393 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 941 transition count 1378
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 926 transition count 1378
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 30 place count 926 transition count 1370
Deduced a syphon composed of 8 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 47 place count 917 transition count 1370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 47 place count 917 transition count 1369
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 915 transition count 1369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 915 transition count 1368
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 914 transition count 1368
Applied a total of 52 rules in 104 ms. Remains 914 /941 variables (removed 27) and now considering 1368/1393 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 914/941 places, 1368/1393 transitions.
RANDOM walk for 2978212 steps (38611 resets) in 120004 ms. (24 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (108 resets) in 702 ms. (56 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (107 resets) in 850 ms. (47 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (118 resets) in 757 ms. (52 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (114 resets) in 811 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (114 resets) in 795 ms. (50 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (122 resets) in 782 ms. (51 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (114 resets) in 805 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (113 resets) in 835 ms. (47 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (116 resets) in 814 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (115 resets) in 838 ms. (47 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (117 resets) in 720 ms. (55 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (111 resets) in 790 ms. (50 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (118 resets) in 775 ms. (51 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (120 resets) in 769 ms. (51 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (119 resets) in 790 ms. (50 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (116 resets) in 731 ms. (54 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (117 resets) in 809 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40001 steps (115 resets) in 754 ms. (52 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (111 resets) in 805 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (111 resets) in 813 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (121 resets) in 756 ms. (52 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (113 resets) in 868 ms. (46 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (111 resets) in 821 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (113 resets) in 799 ms. (50 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (110 resets) in 820 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (120 resets) in 794 ms. (50 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (118 resets) in 709 ms. (56 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (118 resets) in 752 ms. (53 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (121 resets) in 775 ms. (51 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (116 resets) in 746 ms. (53 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (122 resets) in 767 ms. (52 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40001 steps (114 resets) in 813 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (116 resets) in 788 ms. (50 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (107 resets) in 867 ms. (46 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (125 resets) in 723 ms. (55 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (114 resets) in 794 ms. (50 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (116 resets) in 800 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (112 resets) in 904 ms. (44 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (120 resets) in 842 ms. (47 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (115 resets) in 793 ms. (50 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (113 resets) in 738 ms. (54 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (115 resets) in 997 ms. (40 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (119 resets) in 1069 ms. (37 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (119 resets) in 792 ms. (50 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (120 resets) in 770 ms. (51 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (118 resets) in 793 ms. (50 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (116 resets) in 822 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (110 resets) in 969 ms. (41 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (122 resets) in 974 ms. (41 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (116 resets) in 904 ms. (44 steps per ms) remains 342/342 properties
Interrupted probabilistic random walk after 2717102 steps, run timeout after 123001 ms. (steps per millisecond=22 ) properties seen :0 out of 342
Probabilistic random walk after 2717102 steps, saw 743755 distinct states, run finished after 123003 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 1368 rows 914 cols
[2024-05-31 19:58:00] [INFO ] Computed 140 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (OVERLAPS) 16/358 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 1/359 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 117/476 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 9 (OVERLAPS) 25/501 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (OVERLAPS) 2/503 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 13 (OVERLAPS) 106/609 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/609 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 15 (OVERLAPS) 26/635 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/635 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 17 (OVERLAPS) 2/637 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/637 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 19 (OVERLAPS) 109/746 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/746 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 21 (OVERLAPS) 60/806 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/806 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 23 (OVERLAPS) 13/819 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/819 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 25 (OVERLAPS) 95/914 variables, 30/140 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/914 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 27 (OVERLAPS) 1368/2282 variables, 914/1054 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2282/2282 variables, and 1054 constraints, problems are : Problem set: 0 solved, 342 unsolved in 105023 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 914/914 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (OVERLAPS) 16/358 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 1/359 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 117/476 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-31 20:00:00] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:00:01] [INFO ] Deduced a trap composed of 74 places in 295 ms of which 7 ms to minimize.
[2024-05-31 20:00:01] [INFO ] Deduced a trap composed of 48 places in 347 ms of which 5 ms to minimize.
[2024-05-31 20:00:02] [INFO ] Deduced a trap composed of 87 places in 339 ms of which 5 ms to minimize.
[2024-05-31 20:00:02] [INFO ] Deduced a trap composed of 78 places in 326 ms of which 5 ms to minimize.
[2024-05-31 20:00:02] [INFO ] Deduced a trap composed of 81 places in 344 ms of which 6 ms to minimize.
[2024-05-31 20:00:03] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2024-05-31 20:00:03] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-31 20:00:04] [INFO ] Deduced a trap composed of 72 places in 350 ms of which 5 ms to minimize.
[2024-05-31 20:00:05] [INFO ] Deduced a trap composed of 77 places in 315 ms of which 6 ms to minimize.
[2024-05-31 20:00:05] [INFO ] Deduced a trap composed of 42 places in 421 ms of which 6 ms to minimize.
[2024-05-31 20:00:07] [INFO ] Deduced a trap composed of 64 places in 350 ms of which 6 ms to minimize.
[2024-05-31 20:00:07] [INFO ] Deduced a trap composed of 88 places in 222 ms of which 3 ms to minimize.
[2024-05-31 20:00:08] [INFO ] Deduced a trap composed of 87 places in 184 ms of which 3 ms to minimize.
[2024-05-31 20:00:13] [INFO ] Deduced a trap composed of 29 places in 313 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-31 20:00:14] [INFO ] Deduced a trap composed of 83 places in 187 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 11 (OVERLAPS) 25/501 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-31 20:00:29] [INFO ] Deduced a trap composed of 76 places in 324 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 14 (OVERLAPS) 2/503 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/503 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 16 (OVERLAPS) 106/609 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-31 20:00:52] [INFO ] Deduced a trap composed of 40 places in 540 ms of which 8 ms to minimize.
[2024-05-31 20:01:01] [INFO ] Deduced a trap composed of 44 places in 356 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/609 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-31 20:01:10] [INFO ] Deduced a trap composed of 80 places in 492 ms of which 6 ms to minimize.
[2024-05-31 20:01:11] [INFO ] Deduced a trap composed of 57 places in 321 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/609 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 20 (OVERLAPS) 26/635 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/2282 variables, and 104 constraints, problems are : Problem set: 0 solved, 342 unsolved in 105016 ms.
Refiners :[Positive P Invariants (semi-flows): 30/42 constraints, Generalized P Invariants (flows): 53/98 constraints, State Equation: 0/914 constraints, PredecessorRefiner: 0/342 constraints, Known Traps: 21/21 constraints]
After SMT, in 210188ms problems are : Problem set: 0 solved, 342 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 342 out of 914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 914/914 places, 1368/1368 transitions.
Applied a total of 0 rules in 27 ms. Remains 914 /914 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 914/914 places, 1368/1368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 914/914 places, 1368/1368 transitions.
Applied a total of 0 rules in 23 ms. Remains 914 /914 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
[2024-05-31 20:01:30] [INFO ] Invariant cache hit.
[2024-05-31 20:01:31] [INFO ] Implicit Places using invariants in 975 ms returned [108, 312, 335, 490, 514, 515, 516, 534, 552, 571, 621, 622, 633, 634, 636, 653, 671, 740, 744, 745, 748, 759, 760, 761, 779, 781, 785, 803, 804, 805, 806, 818, 824, 830, 836, 842, 848, 854, 860, 866, 872, 878]
[2024-05-31 20:01:31] [INFO ] Actually due to overlaps returned [779, 761, 108, 335, 534, 653, 785, 636, 515, 516, 633, 759, 803, 312, 514, 634, 760, 781, 804, 490, 621, 622, 744, 745, 671, 805, 848, 866, 878, 552, 571, 748, 806, 818, 824, 830, 836, 842, 854, 860, 872]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 990 ms to find 41 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 873/914 places, 1368/1368 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 872 transition count 1296
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 147 place count 800 transition count 1294
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 147 place count 800 transition count 1276
Deduced a syphon composed of 18 places in 2 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 184 place count 781 transition count 1276
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 196 place count 777 transition count 1268
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 204 place count 769 transition count 1268
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 219 place count 754 transition count 1253
Iterating global reduction 4 with 15 rules applied. Total rules applied 234 place count 754 transition count 1253
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 237 place count 754 transition count 1250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 237 place count 754 transition count 1249
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 239 place count 753 transition count 1249
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 242 place count 750 transition count 1243
Iterating global reduction 5 with 3 rules applied. Total rules applied 245 place count 750 transition count 1243
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 246 place count 749 transition count 1242
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 749 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 248 place count 748 transition count 1240
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 748 transition count 1240
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 311 place count 717 transition count 1209
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 312 place count 716 transition count 1208
Iterating global reduction 5 with 1 rules applied. Total rules applied 313 place count 716 transition count 1208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 314 place count 716 transition count 1207
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 318 place count 714 transition count 1208
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 327 place count 714 transition count 1199
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 337 place count 704 transition count 1199
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 349 place count 704 transition count 1199
Applied a total of 349 rules in 169 ms. Remains 704 /873 variables (removed 169) and now considering 1199/1368 (removed 169) transitions.
// Phase 1: matrix 1199 rows 704 cols
[2024-05-31 20:01:31] [INFO ] Computed 92 invariants in 12 ms
[2024-05-31 20:01:32] [INFO ] Implicit Places using invariants in 592 ms returned [236, 278, 279, 433, 439, 442, 444, 465, 466, 543, 549, 552, 554, 559, 560, 612, 629, 635, 638, 640]
[2024-05-31 20:01:32] [INFO ] Actually due to overlaps returned [278, 465, 559, 279, 466, 560, 433, 439, 444, 543, 549, 554, 629, 635, 640, 236, 612]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 596 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 687/914 places, 1199/1368 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 675 transition count 1187
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 675 transition count 1187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 672 transition count 1184
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 672 transition count 1184
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 668 transition count 1180
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 47 place count 668 transition count 1171
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 659 transition count 1171
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 659 transition count 1170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 658 transition count 1170
Applied a total of 58 rules in 127 ms. Remains 658 /687 variables (removed 29) and now considering 1170/1199 (removed 29) transitions.
// Phase 1: matrix 1170 rows 658 cols
[2024-05-31 20:01:32] [INFO ] Computed 75 invariants in 16 ms
[2024-05-31 20:01:32] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-05-31 20:01:32] [INFO ] Invariant cache hit.
[2024-05-31 20:01:34] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 2024 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 658/914 places, 1170/1368 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3930 ms. Remains : 658/914 places, 1170/1368 transitions.
RANDOM walk for 3993277 steps (76086 resets) in 117604 ms. (33 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (193 resets) in 867 ms. (46 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (194 resets) in 832 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (183 resets) in 1090 ms. (36 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (186 resets) in 964 ms. (41 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (189 resets) in 821 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (176 resets) in 943 ms. (42 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (188 resets) in 881 ms. (45 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (197 resets) in 826 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (194 resets) in 837 ms. (47 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (179 resets) in 869 ms. (45 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (196 resets) in 1027 ms. (38 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (189 resets) in 876 ms. (45 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (199 resets) in 965 ms. (41 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (181 resets) in 998 ms. (40 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (204 resets) in 840 ms. (47 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (195 resets) in 788 ms. (50 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (190 resets) in 725 ms. (55 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (185 resets) in 851 ms. (46 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (197 resets) in 801 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (182 resets) in 957 ms. (41 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (179 resets) in 942 ms. (42 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (191 resets) in 800 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (185 resets) in 826 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40001 steps (192 resets) in 809 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (195 resets) in 958 ms. (41 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (198 resets) in 1008 ms. (39 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (191 resets) in 956 ms. (41 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (184 resets) in 845 ms. (47 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (192 resets) in 923 ms. (43 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (194 resets) in 840 ms. (47 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (195 resets) in 721 ms. (55 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (191 resets) in 848 ms. (47 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (183 resets) in 895 ms. (44 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (195 resets) in 865 ms. (46 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (194 resets) in 741 ms. (53 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (195 resets) in 920 ms. (43 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (180 resets) in 969 ms. (41 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (199 resets) in 863 ms. (46 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (191 resets) in 916 ms. (43 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (192 resets) in 821 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (197 resets) in 855 ms. (46 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (200 resets) in 816 ms. (48 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (197 resets) in 996 ms. (40 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (181 resets) in 1087 ms. (36 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (183 resets) in 987 ms. (40 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40002 steps (191 resets) in 805 ms. (49 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (194 resets) in 838 ms. (47 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (190 resets) in 853 ms. (46 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40003 steps (191 resets) in 864 ms. (46 steps per ms) remains 342/342 properties
BEST_FIRST walk for 40004 steps (194 resets) in 861 ms. (46 steps per ms) remains 342/342 properties
Interrupted probabilistic random walk after 4073858 steps, run timeout after 129001 ms. (steps per millisecond=31 ) properties seen :109 out of 342
Probabilistic random walk after 4073858 steps, saw 980053 distinct states, run finished after 129002 ms. (steps per millisecond=31 ) properties seen :109
[2024-05-31 20:04:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 11/244 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 178/422 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 20/442 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 13/455 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (OVERLAPS) 33/488 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (OVERLAPS) 137/625 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/625 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 15 (OVERLAPS) 22/647 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/647 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 17 (OVERLAPS) 11/658 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/658 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 19 (OVERLAPS) 1170/1828 variables, 658/733 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1828 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 21 (OVERLAPS) 0/1828 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1828/1828 variables, and 733 constraints, problems are : Problem set: 0 solved, 233 unsolved in 65228 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 658/658 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 11/244 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-31 20:05:33] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:05:33] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:05:34] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 178/422 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-31 20:05:37] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 4 ms to minimize.
[2024-05-31 20:05:37] [INFO ] Deduced a trap composed of 62 places in 235 ms of which 4 ms to minimize.
[2024-05-31 20:05:37] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 4 ms to minimize.
[2024-05-31 20:05:39] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 3 ms to minimize.
[2024-05-31 20:05:39] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 2 ms to minimize.
[2024-05-31 20:05:40] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 3 ms to minimize.
[2024-05-31 20:05:40] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 2 ms to minimize.
[2024-05-31 20:05:41] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-31 20:05:43] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:05:45] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-05-31 20:05:45] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-31 20:05:46] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 4 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 121 places in 252 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (OVERLAPS) 20/442 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-31 20:05:57] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 14 (OVERLAPS) 13/455 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/455 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 16 (OVERLAPS) 33/488 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/488 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 18 (OVERLAPS) 137/625 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/625 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 20 (OVERLAPS) 22/647 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/647 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 22 (OVERLAPS) 11/658 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/658 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 24 (OVERLAPS) 1170/1828 variables, 658/750 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1828 variables, 233/983 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1828/1828 variables, and 983 constraints, problems are : Problem set: 0 solved, 233 unsolved in 120022 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 658/658 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 17/17 constraints]
After SMT, in 185303ms problems are : Problem set: 0 solved, 233 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 233 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 1170/1170 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 658 transition count 1155
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 643 transition count 1155
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 30 place count 643 transition count 1125
Deduced a syphon composed of 30 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 93 place count 610 transition count 1125
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 2 with 3 rules applied. Total rules applied 96 place count 610 transition count 1122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 607 transition count 1122
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 101 place count 605 transition count 1120
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 605 transition count 1120
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 123 place count 594 transition count 1111
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 4 with 1 rules applied. Total rules applied 124 place count 594 transition count 1110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 125 place count 593 transition count 1110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 125 place count 593 transition count 1107
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 131 place count 590 transition count 1107
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 132 place count 589 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 133 place count 588 transition count 1101
Iterating global reduction 7 with 1 rules applied. Total rules applied 134 place count 588 transition count 1101
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 135 place count 587 transition count 1101
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 141 place count 584 transition count 1098
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 143 place count 582 transition count 1096
Iterating global reduction 8 with 2 rules applied. Total rules applied 145 place count 582 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 146 place count 581 transition count 1095
Iterating global reduction 8 with 1 rules applied. Total rules applied 147 place count 581 transition count 1095
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 148 place count 581 transition count 1094
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 149 place count 581 transition count 1093
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 151 place count 580 transition count 1092
Applied a total of 151 rules in 120 ms. Remains 580 /658 variables (removed 78) and now considering 1092/1170 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 580/658 places, 1092/1170 transitions.
RANDOM walk for 1809186 steps (35266 resets) in 120004 ms. (15 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40001 steps (208 resets) in 526 ms. (75 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (213 resets) in 650 ms. (61 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (205 resets) in 854 ms. (46 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (204 resets) in 862 ms. (46 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (202 resets) in 861 ms. (46 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (199 resets) in 861 ms. (46 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (198 resets) in 981 ms. (40 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (197 resets) in 810 ms. (49 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (209 resets) in 687 ms. (58 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (198 resets) in 765 ms. (52 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (199 resets) in 785 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (196 resets) in 698 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (200 resets) in 869 ms. (45 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (203 resets) in 930 ms. (42 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (195 resets) in 720 ms. (55 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (216 resets) in 588 ms. (67 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (200 resets) in 614 ms. (65 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (205 resets) in 739 ms. (54 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (213 resets) in 717 ms. (55 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (205 resets) in 797 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (194 resets) in 797 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (204 resets) in 794 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (193 resets) in 772 ms. (51 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (203 resets) in 942 ms. (42 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (208 resets) in 973 ms. (41 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (193 resets) in 771 ms. (51 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (197 resets) in 779 ms. (51 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (199 resets) in 654 ms. (61 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (200 resets) in 845 ms. (47 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (213 resets) in 922 ms. (43 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (192 resets) in 1047 ms. (38 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (202 resets) in 1050 ms. (38 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (204 resets) in 881 ms. (45 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (209 resets) in 832 ms. (48 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (194 resets) in 909 ms. (43 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (208 resets) in 807 ms. (49 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40001 steps (206 resets) in 843 ms. (47 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (192 resets) in 860 ms. (46 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (199 resets) in 894 ms. (44 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (203 resets) in 940 ms. (42 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (203 resets) in 672 ms. (59 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (192 resets) in 731 ms. (54 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40001 steps (206 resets) in 626 ms. (63 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (197 resets) in 864 ms. (46 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (204 resets) in 819 ms. (48 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (205 resets) in 666 ms. (59 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (215 resets) in 681 ms. (58 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40004 steps (208 resets) in 998 ms. (40 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40003 steps (208 resets) in 785 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 40002 steps (200 resets) in 778 ms. (51 steps per ms) remains 233/233 properties
Interrupted probabilistic random walk after 2806280 steps, run timeout after 126007 ms. (steps per millisecond=22 ) properties seen :38 out of 233
Probabilistic random walk after 2806280 steps, saw 960475 distinct states, run finished after 126008 ms. (steps per millisecond=22 ) properties seen :38
// Phase 1: matrix 1092 rows 580 cols
[2024-05-31 20:10:20] [INFO ] Computed 68 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 11/206 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 125/331 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 15/346 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 151/497 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (OVERLAPS) 48/545 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 13 (OVERLAPS) 35/580 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/580 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 15 (OVERLAPS) 1092/1672 variables, 580/648 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1672 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 17 (OVERLAPS) 0/1672 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1672/1672 variables, and 648 constraints, problems are : Problem set: 0 solved, 195 unsolved in 45000 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 11/206 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-31 20:11:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
[2024-05-31 20:11:07] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-31 20:11:08] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 125/331 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-31 20:11:11] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 4 ms to minimize.
[2024-05-31 20:11:11] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 4 ms to minimize.
[2024-05-31 20:11:12] [INFO ] Deduced a trap composed of 54 places in 249 ms of which 4 ms to minimize.
[2024-05-31 20:11:13] [INFO ] Deduced a trap composed of 116 places in 243 ms of which 4 ms to minimize.
[2024-05-31 20:11:13] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 4 ms to minimize.
[2024-05-31 20:11:14] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 4 ms to minimize.
[2024-05-31 20:11:15] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-31 20:11:17] [INFO ] Deduced a trap composed of 73 places in 248 ms of which 4 ms to minimize.
[2024-05-31 20:11:18] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 15/346 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (OVERLAPS) 151/497 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (OVERLAPS) 48/545 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 16 (OVERLAPS) 35/580 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/580 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 18 (OVERLAPS) 1092/1672 variables, 580/660 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1672 variables, 195/855 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1672/1672 variables, and 855 constraints, problems are : Problem set: 0 solved, 195 unsolved in 135016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 12/12 constraints]
After SMT, in 180073ms problems are : Problem set: 0 solved, 195 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 195 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1092/1092 transitions.
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 0 with 18 rules applied. Total rules applied 18 place count 580 transition count 1074
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 562 transition count 1074
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 36 place count 562 transition count 1066
Deduced a syphon composed of 8 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 53 place count 553 transition count 1066
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 53 place count 553 transition count 1065
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 551 transition count 1065
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 56 place count 551 transition count 1064
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 550 transition count 1064
Applied a total of 58 rules in 33 ms. Remains 550 /580 variables (removed 30) and now considering 1064/1092 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 550/580 places, 1064/1092 transitions.

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-04b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-04b, 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 r466-smll-171620124300043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b 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 ;