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-171620124300033.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-03b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124300033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1004K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.4K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K 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 544K 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 1717182818077

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-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:13:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 19:13:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:13:41] [INFO ] Load time of PNML (sax parser for PT used): 410 ms
[2024-05-31 19:13:41] [INFO ] Transformed 1638 places.
[2024-05-31 19:13:41] [INFO ] Transformed 2094 transitions.
[2024-05-31 19:13:41] [INFO ] Found NUPN structural information;
[2024-05-31 19:13:41] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 628 ms.
Structural test allowed to assert that 196 places are NOT stable. Took 169 ms.
RANDOM walk for 40000 steps (103 resets) in 4389 ms. (9 steps per ms) remains 280/1442 properties
BEST_FIRST walk for 404 steps (8 resets) in 27 ms. (14 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 24 ms. (16 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 32 ms. (12 steps per ms) remains 280/280 properties
BEST_FIRST walk for 402 steps (8 resets) in 23 ms. (16 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 30 ms. (13 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 27 ms. (14 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 26 ms. (14 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 31 ms. (12 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 25 ms. (15 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 27 ms. (14 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 29 ms. (13 steps per ms) remains 280/280 properties
BEST_FIRST walk for 402 steps (8 resets) in 24 ms. (16 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 280/280 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 280/280 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 280/280 properties
// Phase 1: matrix 2094 rows 1638 cols
[2024-05-31 19:13:43] [INFO ] Computed 160 invariants in 262 ms
Error getting values : (error "ParserException while parsing response: ((s7 (/ 1.0 2.0))
(s8 (/ 1.0 2.0))
(s9 (/ 1.0 2.0))
(s10 (/ 1.0 2.0))
(s11 (/ 1.0 2.0))
(s12 (/ 1.0 2.0))
(s13 (/ 1.0 2.0))
(s14 (/ 1.0 2.0))
(s15 (/ 1.0 2.0))
(s16 (/ 1.0 2.0))
(s17 (/ 1.0 2.0))
(s18 (/ 1.0 2.0))
(s19 (/ 1.0 2.0))
(s20 (/ 1.0 2.0))
(s21 (/ 1.0 2.0))
(s22 (/ 1.0 2.0))
(s23 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 280 unsolved
SMT process timed out in 5788ms, After SMT, problems are : Problem set: 0 solved, 280 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 280 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 1638 transition count 1780
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 332 rules applied. Total rules applied 646 place count 1324 transition count 1762
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 651 place count 1319 transition count 1762
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 308 Pre rules applied. Total rules applied 651 place count 1319 transition count 1454
Deduced a syphon composed of 308 places in 6 ms
Ensure Unique test removed 26 places
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 642 rules applied. Total rules applied 1293 place count 985 transition count 1454
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 19 rules applied. Total rules applied 1312 place count 983 transition count 1437
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1329 place count 966 transition count 1437
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 1329 place count 966 transition count 1427
Deduced a syphon composed of 10 places in 16 ms
Ensure Unique test removed 10 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1359 place count 946 transition count 1427
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 1359 place count 946 transition count 1417
Deduced a syphon composed of 10 places in 14 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1379 place count 936 transition count 1417
Discarding 39 places :
Symmetric choice reduction at 5 with 39 rule applications. Total rules 1418 place count 897 transition count 1378
Iterating global reduction 5 with 39 rules applied. Total rules applied 1457 place count 897 transition count 1378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1458 place count 897 transition count 1377
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1458 place count 897 transition count 1365
Deduced a syphon composed of 12 places in 13 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 25 rules applied. Total rules applied 1483 place count 884 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1483 place count 884 transition count 1364
Deduced a syphon composed of 1 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1486 place count 882 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1489 place count 879 transition count 1343
Iterating global reduction 6 with 3 rules applied. Total rules applied 1492 place count 879 transition count 1343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1492 place count 879 transition count 1342
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1494 place count 878 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1495 place count 877 transition count 1334
Iterating global reduction 6 with 1 rules applied. Total rules applied 1496 place count 877 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1497 place count 876 transition count 1326
Iterating global reduction 6 with 1 rules applied. Total rules applied 1498 place count 876 transition count 1326
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1499 place count 875 transition count 1318
Iterating global reduction 6 with 1 rules applied. Total rules applied 1500 place count 875 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1501 place count 874 transition count 1310
Iterating global reduction 6 with 1 rules applied. Total rules applied 1502 place count 874 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1503 place count 873 transition count 1302
Iterating global reduction 6 with 1 rules applied. Total rules applied 1504 place count 873 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1505 place count 872 transition count 1294
Iterating global reduction 6 with 1 rules applied. Total rules applied 1506 place count 872 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1507 place count 871 transition count 1286
Iterating global reduction 6 with 1 rules applied. Total rules applied 1508 place count 871 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1509 place count 870 transition count 1278
Iterating global reduction 6 with 1 rules applied. Total rules applied 1510 place count 870 transition count 1278
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1511 place count 869 transition count 1270
Iterating global reduction 6 with 1 rules applied. Total rules applied 1512 place count 869 transition count 1270
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1513 place count 868 transition count 1262
Iterating global reduction 6 with 1 rules applied. Total rules applied 1514 place count 868 transition count 1262
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1515 place count 867 transition count 1254
Iterating global reduction 6 with 1 rules applied. Total rules applied 1516 place count 867 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1517 place count 866 transition count 1246
Iterating global reduction 6 with 1 rules applied. Total rules applied 1518 place count 866 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1519 place count 865 transition count 1238
Iterating global reduction 6 with 1 rules applied. Total rules applied 1520 place count 865 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1521 place count 864 transition count 1230
Iterating global reduction 6 with 1 rules applied. Total rules applied 1522 place count 864 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1523 place count 863 transition count 1222
Iterating global reduction 6 with 1 rules applied. Total rules applied 1524 place count 863 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1525 place count 862 transition count 1214
Iterating global reduction 6 with 1 rules applied. Total rules applied 1526 place count 862 transition count 1214
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 2 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 6 with 162 rules applied. Total rules applied 1688 place count 781 transition count 1133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1690 place count 780 transition count 1142
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 1695 place count 780 transition count 1137
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1700 place count 775 transition count 1137
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1701 place count 775 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1702 place count 774 transition count 1136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1703 place count 773 transition count 1135
Reduce places removed 3 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 4 rules applied. Total rules applied 1707 place count 770 transition count 1134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1708 place count 769 transition count 1134
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 1708 place count 769 transition count 1130
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1716 place count 765 transition count 1130
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 10 with 2 rules applied. Total rules applied 1718 place count 763 transition count 1130
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 11 with 6 rules applied. Total rules applied 1724 place count 760 transition count 1127
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1726 place count 758 transition count 1125
Iterating global reduction 11 with 2 rules applied. Total rules applied 1728 place count 758 transition count 1125
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1730 place count 758 transition count 1123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1732 place count 756 transition count 1123
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1733 place count 756 transition count 1123
Applied a total of 1733 rules in 1793 ms. Remains 756 /1638 variables (removed 882) and now considering 1123/2094 (removed 971) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1813 ms. Remains : 756/1638 places, 1123/2094 transitions.
RANDOM walk for 4000000 steps (56694 resets) in 87297 ms. (45 steps per ms) remains 223/280 properties
BEST_FIRST walk for 40004 steps (147 resets) in 251 ms. (158 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (151 resets) in 233 ms. (170 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (153 resets) in 237 ms. (168 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (158 resets) in 237 ms. (168 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40001 steps (153 resets) in 236 ms. (168 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (156 resets) in 231 ms. (172 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (152 resets) in 248 ms. (160 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (160 resets) in 228 ms. (174 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (160 resets) in 232 ms. (171 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (156 resets) in 233 ms. (170 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (157 resets) in 233 ms. (170 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (155 resets) in 234 ms. (170 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (162 resets) in 230 ms. (173 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (152 resets) in 232 ms. (171 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (141 resets) in 248 ms. (160 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (149 resets) in 235 ms. (169 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (163 resets) in 232 ms. (171 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (160 resets) in 239 ms. (166 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (161 resets) in 237 ms. (168 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (154 resets) in 229 ms. (173 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (158 resets) in 240 ms. (165 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (154 resets) in 236 ms. (168 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (153 resets) in 238 ms. (167 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (152 resets) in 235 ms. (169 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (154 resets) in 234 ms. (170 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (157 resets) in 234 ms. (170 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (155 resets) in 238 ms. (167 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (154 resets) in 237 ms. (168 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (161 resets) in 234 ms. (170 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (158 resets) in 233 ms. (170 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (151 resets) in 242 ms. (164 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (149 resets) in 243 ms. (163 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (150 resets) in 234 ms. (170 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (153 resets) in 234 ms. (170 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (168 resets) in 227 ms. (175 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (154 resets) in 258 ms. (154 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (148 resets) in 238 ms. (167 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (142 resets) in 254 ms. (156 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (156 resets) in 230 ms. (173 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (151 resets) in 247 ms. (161 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (149 resets) in 235 ms. (169 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (161 resets) in 237 ms. (168 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (153 resets) in 244 ms. (163 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (144 resets) in 242 ms. (164 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (148 resets) in 330 ms. (120 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (156 resets) in 250 ms. (159 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (140 resets) in 288 ms. (138 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (145 resets) in 294 ms. (135 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (155 resets) in 268 ms. (148 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (147 resets) in 290 ms. (137 steps per ms) remains 223/223 properties
// Phase 1: matrix 1123 rows 756 cols
[2024-05-31 19:14:17] [INFO ] Computed 115 invariants in 68 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 29/252 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 155/409 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 35/444 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 2/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (OVERLAPS) 137/583 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/583 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 15 (OVERLAPS) 64/647 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/647 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 17 (OVERLAPS) 9/656 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/656 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 19 (OVERLAPS) 98/754 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/754 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 21 (OVERLAPS) 1/755 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 755/1879 variables, and 114 constraints, problems are : Problem set: 0 solved, 223 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 85/86 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 29/252 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 155/409 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-31 19:15:08] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 19 ms to minimize.
[2024-05-31 19:15:09] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:15:10] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2024-05-31 19:15:10] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:15:10] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
[2024-05-31 19:15:11] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-31 19:15:13] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 7 ms to minimize.
[2024-05-31 19:15:14] [INFO ] Deduced a trap composed of 99 places in 172 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-31 19:15:17] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 3 ms to minimize.
[2024-05-31 19:15:17] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (OVERLAPS) 35/444 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (OVERLAPS) 2/446 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/446 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 16 (OVERLAPS) 137/583 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 18 (OVERLAPS) 64/647 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/647 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 20 (OVERLAPS) 9/656 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 22 (OVERLAPS) 98/754 variables, 29/123 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 754/1879 variables, and 123 constraints, problems are : Problem set: 0 solved, 223 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 28/29 constraints, Generalized P Invariants (flows): 85/86 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 0/223 constraints, Known Traps: 10/10 constraints]
After SMT, in 90231ms problems are : Problem set: 0 solved, 223 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 223 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 1123/1123 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 756 transition count 1105
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 738 transition count 1105
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 36 place count 738 transition count 1094
Deduced a syphon composed of 11 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 59 place count 726 transition count 1094
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 726 transition count 1093
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 725 transition count 1093
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 74 place count 718 transition count 1087
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 74 place count 718 transition count 1085
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 78 place count 716 transition count 1085
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 79 place count 715 transition count 1085
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 83 place count 713 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 84 place count 712 transition count 1082
Iterating global reduction 5 with 1 rules applied. Total rules applied 85 place count 712 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 86 place count 711 transition count 1081
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 711 transition count 1081
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 711 transition count 1080
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 711 transition count 1079
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 90 place count 710 transition count 1079
Applied a total of 90 rules in 141 ms. Remains 710 /756 variables (removed 46) and now considering 1079/1123 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 710/756 places, 1079/1123 transitions.
RANDOM walk for 4000000 steps (57671 resets) in 82203 ms. (48 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (167 resets) in 252 ms. (158 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (152 resets) in 258 ms. (154 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (164 resets) in 380 ms. (104 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (154 resets) in 335 ms. (119 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (160 resets) in 351 ms. (113 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (154 resets) in 345 ms. (115 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (157 resets) in 328 ms. (121 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (156 resets) in 331 ms. (120 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (167 resets) in 343 ms. (116 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (157 resets) in 470 ms. (84 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (155 resets) in 394 ms. (101 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (155 resets) in 327 ms. (121 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (155 resets) in 416 ms. (95 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (144 resets) in 393 ms. (101 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (155 resets) in 346 ms. (115 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (160 resets) in 472 ms. (84 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (163 resets) in 543 ms. (73 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (153 resets) in 552 ms. (72 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (165 resets) in 341 ms. (116 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (154 resets) in 547 ms. (72 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (155 resets) in 342 ms. (116 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (157 resets) in 435 ms. (91 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (165 resets) in 466 ms. (85 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (161 resets) in 474 ms. (84 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (166 resets) in 367 ms. (108 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (168 resets) in 408 ms. (97 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (151 resets) in 363 ms. (109 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (152 resets) in 394 ms. (101 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (165 resets) in 413 ms. (96 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (144 resets) in 502 ms. (79 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (155 resets) in 587 ms. (68 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (156 resets) in 334 ms. (119 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40001 steps (157 resets) in 361 ms. (110 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (161 resets) in 363 ms. (109 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (156 resets) in 435 ms. (91 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (149 resets) in 476 ms. (83 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (144 resets) in 453 ms. (88 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (160 resets) in 489 ms. (81 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (157 resets) in 514 ms. (77 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (161 resets) in 509 ms. (78 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40001 steps (155 resets) in 427 ms. (93 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (166 resets) in 426 ms. (93 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (158 resets) in 400 ms. (99 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (155 resets) in 450 ms. (88 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (159 resets) in 549 ms. (72 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (154 resets) in 489 ms. (81 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (157 resets) in 419 ms. (95 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (155 resets) in 398 ms. (100 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (164 resets) in 421 ms. (94 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (162 resets) in 430 ms. (92 steps per ms) remains 223/223 properties
Interrupted probabilistic random walk after 3549995 steps, run timeout after 84001 ms. (steps per millisecond=42 ) properties seen :33 out of 223
Probabilistic random walk after 3549995 steps, saw 909881 distinct states, run finished after 84012 ms. (steps per millisecond=42 ) properties seen :33
// Phase 1: matrix 1079 rows 710 cols
[2024-05-31 19:17:40] [INFO ] Computed 112 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 4/194 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 65/259 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 40/299 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 2/301 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 111/412 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 26/438 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 2/440 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (OVERLAPS) 107/547 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (OVERLAPS) 59/606 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (OVERLAPS) 9/615 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/615 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 23 (OVERLAPS) 93/708 variables, 27/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/708 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 25 (OVERLAPS) 1/709 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/709 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 27 (OVERLAPS) 1/710 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/710 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (OVERLAPS) 1079/1789 variables, 710/822 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1789 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (OVERLAPS) 0/1789 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1789/1789 variables, and 822 constraints, problems are : Problem set: 0 solved, 190 unsolved in 55814 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 710/710 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 4/194 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 65/259 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 19:18:38] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-31 19:18:39] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:18:39] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-31 19:18:39] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:18:40] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 19:18:41] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 40/299 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 2/301 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 111/412 variables, 17/60 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 19:18:49] [INFO ] Deduced a trap composed of 75 places in 171 ms of which 3 ms to minimize.
[2024-05-31 19:18:50] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 19:18:53] [INFO ] Deduced a trap composed of 80 places in 204 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (OVERLAPS) 26/438 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (OVERLAPS) 2/440 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/440 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (OVERLAPS) 107/547 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/547 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 23 (OVERLAPS) 59/606 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 25 (OVERLAPS) 9/615 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/615 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 27 (OVERLAPS) 93/708 variables, 27/119 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/708 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (OVERLAPS) 1/709 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/709 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (OVERLAPS) 1/710 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/710 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 33 (OVERLAPS) 1079/1789 variables, 710/831 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1789 variables, 190/1021 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1789/1789 variables, and 1021 constraints, problems are : Problem set: 0 solved, 190 unsolved in 75013 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 710/710 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 9/9 constraints]
After SMT, in 130893ms problems are : Problem set: 0 solved, 190 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 190 out of 710 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 710/710 places, 1079/1079 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 710 transition count 1065
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 696 transition count 1065
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 28 place count 696 transition count 1058
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 43 place count 688 transition count 1058
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 43 place count 688 transition count 1057
Deduced a syphon composed of 1 places in 1 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 46 place count 686 transition count 1057
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 46 place count 686 transition count 1056
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 48 place count 685 transition count 1056
Applied a total of 48 rules in 43 ms. Remains 685 /710 variables (removed 25) and now considering 1056/1079 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 685/710 places, 1056/1079 transitions.
RANDOM walk for 4000000 steps (57756 resets) in 70665 ms. (56 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (153 resets) in 380 ms. (104 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (149 resets) in 489 ms. (81 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (156 resets) in 471 ms. (84 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (164 resets) in 595 ms. (67 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (149 resets) in 619 ms. (64 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (162 resets) in 443 ms. (90 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40000 steps (156 resets) in 377 ms. (105 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (151 resets) in 573 ms. (69 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (152 resets) in 550 ms. (72 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (154 resets) in 403 ms. (99 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (162 resets) in 468 ms. (85 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (143 resets) in 461 ms. (86 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (157 resets) in 365 ms. (109 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (153 resets) in 519 ms. (76 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (158 resets) in 495 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (164 resets) in 391 ms. (102 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (151 resets) in 476 ms. (83 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (164 resets) in 605 ms. (66 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (150 resets) in 505 ms. (79 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (158 resets) in 443 ms. (90 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (163 resets) in 518 ms. (77 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (160 resets) in 498 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (160 resets) in 576 ms. (69 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (162 resets) in 421 ms. (94 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (167 resets) in 422 ms. (94 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (165 resets) in 414 ms. (96 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (154 resets) in 451 ms. (88 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (166 resets) in 508 ms. (78 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (159 resets) in 548 ms. (72 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (158 resets) in 515 ms. (77 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (153 resets) in 540 ms. (73 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (158 resets) in 497 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (154 resets) in 442 ms. (90 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (162 resets) in 570 ms. (70 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (153 resets) in 489 ms. (81 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (148 resets) in 517 ms. (77 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (158 resets) in 389 ms. (102 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (160 resets) in 532 ms. (75 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (164 resets) in 452 ms. (88 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (166 resets) in 452 ms. (88 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (158 resets) in 544 ms. (73 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (153 resets) in 498 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (157 resets) in 526 ms. (75 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (149 resets) in 401 ms. (99 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (158 resets) in 390 ms. (102 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (150 resets) in 598 ms. (66 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (161 resets) in 381 ms. (104 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (153 resets) in 596 ms. (67 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (165 resets) in 475 ms. (84 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (168 resets) in 540 ms. (73 steps per ms) remains 190/190 properties
Interrupted probabilistic random walk after 2646994 steps, run timeout after 75001 ms. (steps per millisecond=35 ) properties seen :0 out of 190
Probabilistic random walk after 2646994 steps, saw 718653 distinct states, run finished after 75002 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 1056 rows 685 cols
[2024-05-31 19:21:32] [INFO ] Computed 110 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 4/194 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 65/259 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 30/289 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 2/291 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 96/387 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 26/413 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 2/415 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/415 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (OVERLAPS) 107/522 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/522 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (OVERLAPS) 59/581 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/581 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (OVERLAPS) 9/590 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/590 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 23 (OVERLAPS) 93/683 variables, 27/108 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/683 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 25 (OVERLAPS) 1/684 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/684 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 27 (OVERLAPS) 1/685 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/685 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (OVERLAPS) 1056/1741 variables, 685/795 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1741 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (OVERLAPS) 0/1741 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1741/1741 variables, and 795 constraints, problems are : Problem set: 0 solved, 190 unsolved in 61417 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 685/685 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 4/194 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 65/259 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 19:22:36] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:22:36] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-31 19:22:37] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:22:37] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 19:22:38] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-31 19:22:39] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 30/289 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 2/291 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 96/387 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 19:22:46] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (OVERLAPS) 26/413 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/413 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (OVERLAPS) 2/415 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/415 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (OVERLAPS) 107/522 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/522 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 22 (OVERLAPS) 59/581 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 19:23:00] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 3 ms to minimize.
[2024-05-31 19:23:01] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/581 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/581 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 25 (OVERLAPS) 9/590 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/590 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 27 (OVERLAPS) 93/683 variables, 27/117 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/683 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (OVERLAPS) 1/684 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/684 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (OVERLAPS) 1/685 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/685 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 33 (OVERLAPS) 1056/1741 variables, 685/804 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1741 variables, 190/994 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1741/1741 variables, and 994 constraints, problems are : Problem set: 0 solved, 190 unsolved in 90020 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 685/685 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 9/9 constraints]
After SMT, in 151496ms problems are : Problem set: 0 solved, 190 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 190 out of 685 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 1056/1056 transitions.
Applied a total of 0 rules in 19 ms. Remains 685 /685 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 685/685 places, 1056/1056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 1056/1056 transitions.
Applied a total of 0 rules in 17 ms. Remains 685 /685 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
[2024-05-31 19:24:03] [INFO ] Invariant cache hit.
[2024-05-31 19:24:04] [INFO ] Implicit Places using invariants in 715 ms returned [90, 285, 286, 288, 305, 323, 343, 392, 393, 404, 405, 407, 424, 442, 511, 515, 516, 519, 530, 531, 532, 550, 552, 556, 574, 575, 576, 577, 589, 595, 601, 607, 613, 619, 625, 631, 637, 643, 649]
[2024-05-31 19:24:04] [INFO ] Actually due to overlaps returned [550, 532, 90, 305, 424, 556, 288, 407, 285, 404, 530, 574, 286, 405, 531, 552, 575, 392, 393, 515, 516, 442, 576, 619, 637, 649, 323, 343, 519, 577, 589, 595, 601, 607, 613, 625, 631, 643]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 730 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 647/685 places, 1056/1056 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 646 transition count 992
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 582 transition count 991
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 130 place count 582 transition count 973
Deduced a syphon composed of 18 places in 1 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 167 place count 563 transition count 973
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 179 place count 559 transition count 965
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 187 place count 551 transition count 965
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 202 place count 536 transition count 950
Iterating global reduction 4 with 15 rules applied. Total rules applied 217 place count 536 transition count 950
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 220 place count 536 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 220 place count 536 transition count 946
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 535 transition count 946
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 225 place count 532 transition count 940
Iterating global reduction 5 with 3 rules applied. Total rules applied 228 place count 532 transition count 940
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 229 place count 531 transition count 939
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 531 transition count 939
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 231 place count 530 transition count 937
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 530 transition count 937
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 286 place count 503 transition count 910
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 287 place count 503 transition count 909
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 288 place count 502 transition count 908
Iterating global reduction 6 with 1 rules applied. Total rules applied 289 place count 502 transition count 908
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 290 place count 502 transition count 907
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 294 place count 500 transition count 908
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 301 place count 500 transition count 901
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 309 place count 492 transition count 901
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 318 place count 492 transition count 901
Applied a total of 318 rules in 146 ms. Remains 492 /647 variables (removed 155) and now considering 901/1056 (removed 155) transitions.
// Phase 1: matrix 901 rows 492 cols
[2024-05-31 19:24:04] [INFO ] Computed 65 invariants in 9 ms
[2024-05-31 19:24:05] [INFO ] Implicit Places using invariants in 425 ms returned [204, 210, 213, 215, 250, 251, 331, 337, 340, 342, 347, 348, 400, 417, 423, 426, 428]
[2024-05-31 19:24:05] [INFO ] Actually due to overlaps returned [250, 347, 251, 348, 204, 210, 215, 331, 337, 342, 417, 423, 428, 400]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 430 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 478/685 places, 901/1056 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 466 transition count 889
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 466 transition count 889
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 463 transition count 886
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 463 transition count 886
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 459 transition count 882
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 47 place count 459 transition count 873
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 450 transition count 873
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 450 transition count 872
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 449 transition count 872
Applied a total of 58 rules in 82 ms. Remains 449 /478 variables (removed 29) and now considering 872/901 (removed 29) transitions.
// Phase 1: matrix 872 rows 449 cols
[2024-05-31 19:24:05] [INFO ] Computed 51 invariants in 7 ms
[2024-05-31 19:24:05] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-31 19:24:05] [INFO ] Invariant cache hit.
[2024-05-31 19:24:06] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 449/685 places, 872/1056 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2607 ms. Remains : 449/685 places, 872/1056 transitions.
RANDOM walk for 4000000 steps (88981 resets) in 69477 ms. (57 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (274 resets) in 376 ms. (106 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (273 resets) in 493 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (273 resets) in 473 ms. (84 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (270 resets) in 519 ms. (76 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (281 resets) in 646 ms. (61 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (273 resets) in 542 ms. (73 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (259 resets) in 648 ms. (61 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (252 resets) in 514 ms. (77 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (262 resets) in 477 ms. (83 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (279 resets) in 475 ms. (84 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (276 resets) in 492 ms. (81 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (282 resets) in 410 ms. (97 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (275 resets) in 508 ms. (78 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (267 resets) in 615 ms. (64 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (284 resets) in 551 ms. (72 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (278 resets) in 601 ms. (66 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (292 resets) in 578 ms. (69 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (272 resets) in 509 ms. (78 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (265 resets) in 558 ms. (71 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (281 resets) in 546 ms. (73 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (287 resets) in 494 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (278 resets) in 567 ms. (70 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (272 resets) in 454 ms. (87 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (280 resets) in 553 ms. (72 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (282 resets) in 546 ms. (73 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (278 resets) in 497 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (284 resets) in 484 ms. (82 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (272 resets) in 432 ms. (92 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (276 resets) in 493 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (273 resets) in 543 ms. (73 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (282 resets) in 546 ms. (73 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (271 resets) in 558 ms. (71 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (275 resets) in 468 ms. (85 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (285 resets) in 573 ms. (69 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (270 resets) in 580 ms. (68 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (282 resets) in 538 ms. (74 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (276 resets) in 568 ms. (70 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (284 resets) in 585 ms. (68 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (289 resets) in 585 ms. (68 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (279 resets) in 605 ms. (66 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (276 resets) in 403 ms. (99 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (279 resets) in 603 ms. (66 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (265 resets) in 593 ms. (67 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (288 resets) in 480 ms. (83 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (269 resets) in 527 ms. (75 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (262 resets) in 498 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (265 resets) in 525 ms. (76 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (274 resets) in 451 ms. (88 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (267 resets) in 551 ms. (72 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (271 resets) in 586 ms. (68 steps per ms) remains 190/190 properties
Interrupted probabilistic random walk after 5749415 steps, run timeout after 78001 ms. (steps per millisecond=73 ) properties seen :119 out of 190
Probabilistic random walk after 5749415 steps, saw 1030150 distinct states, run finished after 78001 ms. (steps per millisecond=73 ) properties seen :119
[2024-05-31 19:25:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 28/99 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 13/112 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 3/115 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 13/128 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 33/161 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 205/366 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 14 (OVERLAPS) 24/390 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 16 (OVERLAPS) 59/449 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 18 (OVERLAPS) 872/1321 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1321 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 20 (OVERLAPS) 0/1321 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1321/1321 variables, and 500 constraints, problems are : Problem set: 0 solved, 71 unsolved in 9056 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 28/99 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 19:26:00] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 19:26:01] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 13/112 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 3/115 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 13/128 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 33/161 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (OVERLAPS) 205/366 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/366 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 15 (OVERLAPS) 24/390 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 19:26:04] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/390 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/390 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 18 (OVERLAPS) 59/449 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 19:26:08] [INFO ] Deduced a trap composed of 97 places in 217 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/449 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 19:26:09] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/449 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/449 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 22 (OVERLAPS) 872/1321 variables, 449/505 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1321 variables, 71/576 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1321 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 25 (OVERLAPS) 0/1321 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1321/1321 variables, and 576 constraints, problems are : Problem set: 0 solved, 71 unsolved in 27693 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 5/5 constraints]
After SMT, in 36769ms problems are : Problem set: 0 solved, 71 unsolved
Fused 71 Parikh solutions to 66 different solutions.
Parikh walk visited 0 properties in 30169 ms.
Support contains 71 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 872/872 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 449 transition count 858
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 435 transition count 858
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 28 place count 435 transition count 825
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 97 place count 399 transition count 825
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 100 place count 399 transition count 822
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 103 place count 396 transition count 822
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 394 transition count 820
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 394 transition count 820
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 25 rules applied. Total rules applied 132 place count 381 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 132 place count 381 transition count 807
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 380 transition count 807
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 378 transition count 800
Ensure Unique test removed 1 places
Iterating global reduction 4 with 3 rules applied. Total rules applied 139 place count 377 transition count 800
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 376 transition count 800
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 375 transition count 799
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 375 transition count 799
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 144 place count 375 transition count 797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 145 place count 374 transition count 797
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 149 place count 372 transition count 795
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 150 place count 371 transition count 794
Iterating global reduction 7 with 1 rules applied. Total rules applied 151 place count 371 transition count 794
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 152 place count 371 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 153 place count 370 transition count 793
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 154 place count 370 transition count 793
Applied a total of 154 rules in 125 ms. Remains 370 /449 variables (removed 79) and now considering 793/872 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 370/449 places, 793/872 transitions.
RANDOM walk for 3969260 steps (85370 resets) in 101702 ms. (39 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2775 resets) in 4070 ms. (98 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2716 resets) in 3361 ms. (118 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2782 resets) in 3977 ms. (100 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2752 resets) in 3773 ms. (105 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2747 resets) in 4217 ms. (94 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2760 resets) in 4227 ms. (94 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2763 resets) in 4041 ms. (98 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2765 resets) in 3713 ms. (107 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2782 resets) in 3431 ms. (116 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2756 resets) in 3589 ms. (111 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2704 resets) in 3783 ms. (105 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2824 resets) in 4072 ms. (98 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2771 resets) in 3947 ms. (101 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2761 resets) in 5824 ms. (68 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2775 resets) in 3874 ms. (103 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2737 resets) in 3841 ms. (104 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2769 resets) in 3610 ms. (110 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2759 resets) in 3819 ms. (104 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2814 resets) in 3309 ms. (120 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2769 resets) in 4177 ms. (95 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2829 resets) in 4446 ms. (89 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2757 resets) in 3540 ms. (112 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2762 resets) in 4172 ms. (95 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2776 resets) in 4320 ms. (92 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2742 resets) in 4026 ms. (99 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2747 resets) in 3965 ms. (100 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2762 resets) in 3800 ms. (105 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2767 resets) in 3802 ms. (105 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2768 resets) in 4384 ms. (91 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2756 resets) in 3849 ms. (103 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2768 resets) in 4012 ms. (99 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2735 resets) in 4124 ms. (96 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2741 resets) in 3535 ms. (113 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2798 resets) in 3988 ms. (100 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2760 resets) in 3917 ms. (102 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2760 resets) in 3445 ms. (116 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2812 resets) in 3371 ms. (118 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2791 resets) in 4000 ms. (99 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2756 resets) in 4642 ms. (86 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2763 resets) in 3272 ms. (122 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2743 resets) in 4282 ms. (93 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2753 resets) in 3915 ms. (102 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2753 resets) in 4135 ms. (96 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2800 resets) in 4224 ms. (94 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2785 resets) in 3501 ms. (114 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2782 resets) in 3965 ms. (100 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2745 resets) in 3443 ms. (116 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2734 resets) in 4278 ms. (93 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2789 resets) in 3860 ms. (103 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2757 resets) in 4236 ms. (94 steps per ms) remains 71/71 properties
Interrupted probabilistic random walk after 31318393 steps, run timeout after 300001 ms. (steps per millisecond=104 ) properties seen :69 out of 71
Probabilistic random walk after 31318393 steps, saw 6392194 distinct states, run finished after 300001 ms. (steps per millisecond=104 ) properties seen :69
// Phase 1: matrix 793 rows 370 cols
[2024-05-31 19:33:38] [INFO ] Computed 45 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/35 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/48 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 206/254 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 53/307 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 63/370 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 793/1163 variables, 370/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1163 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1163 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 415 constraints, problems are : Problem set: 0 solved, 2 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/35 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/48 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 206/254 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 53/307 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 63/370 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 793/1163 variables, 370/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1163 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:33:39] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 9 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1163 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1163 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1163 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 418 constraints, problems are : Problem set: 0 solved, 2 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1441ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1112 ms.
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 793/793 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 370 transition count 774
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 351 transition count 774
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 38 place count 351 transition count 758
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 333 transition count 758
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 rules applied. Total rules applied 76 place count 332 transition count 755
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 79 place count 329 transition count 755
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 329 transition count 754
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 82 place count 327 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 82 place count 327 transition count 753
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 326 transition count 753
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 99 place count 318 transition count 746
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 99 place count 318 transition count 744
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 104 place count 315 transition count 744
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 105 place count 314 transition count 744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 105 place count 314 transition count 743
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 107 place count 313 transition count 743
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 111 place count 311 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 112 place count 311 transition count 740
Applied a total of 112 rules in 59 ms. Remains 311 /370 variables (removed 59) and now considering 740/793 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 311/370 places, 740/793 transitions.
RANDOM walk for 4000000 steps (86699 resets) in 32558 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (27540 resets) in 13888 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (27614 resets) in 12696 ms. (315 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4740691 steps, run visited all 2 properties in 44722 ms. (steps per millisecond=106 )
Probabilistic random walk after 4740691 steps, saw 1665757 distinct states, run finished after 44735 ms. (steps per millisecond=105 ) properties seen :2
Able to resolve query StableMarking after proving 1443 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 1264013 ms.
ITS solved all properties within timeout

BK_STOP 1717184084710

--------------------
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-03b"
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-03b, 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-171620124300033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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