Execution Chart

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

Trace from the execution

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

--------------------
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 1716243424173

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 22:17:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-20 22:17:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:17:07] [INFO ] Load time of PNML (sax parser for PT used): 390 ms
[2024-05-20 22:17:07] [INFO ] Transformed 1638 places.
[2024-05-20 22:17:07] [INFO ] Transformed 2094 transitions.
[2024-05-20 22:17:07] [INFO ] Found NUPN structural information;
[2024-05-20 22:17:07] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 768 ms.
Structural test allowed to assert that 196 places are NOT stable. Took 23 ms.
RANDOM walk for 40000 steps (119 resets) in 4305 ms. (9 steps per ms) remains 286/1442 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 286/286 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 286/286 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 286/286 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 286/286 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 286/286 properties
// Phase 1: matrix 2094 rows 1638 cols
[2024-05-20 22:17:09] [INFO ] Computed 160 invariants in 180 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 8/294 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/3732 variables, and 294 constraints, problems are : Problem set: 0 solved, 286 unsolved in 5109 ms.
Refiners :[Domain max(s): 286/1638 constraints, Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 8/123 constraints, State Equation: 0/1638 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 8/294 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 90/376 variables, 15/309 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 90/399 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/3732 variables, and 400 constraints, problems are : Problem set: 0 solved, 286 unsolved in 5023 ms.
Refiners :[Domain max(s): 376/1638 constraints, Positive P Invariants (semi-flows): 15/37 constraints, Generalized P Invariants (flows): 9/123 constraints, State Equation: 0/1638 constraints, PredecessorRefiner: 0/286 constraints, Known Traps: 0/0 constraints]
After SMT, in 10681ms problems are : Problem set: 0 solved, 286 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 286 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 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 315 place count 1638 transition count 1779
Reduce places removed 315 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 333 rules applied. Total rules applied 648 place count 1323 transition count 1761
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 653 place count 1318 transition count 1761
Performed 306 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 306 Pre rules applied. Total rules applied 653 place count 1318 transition count 1455
Deduced a syphon composed of 306 places in 7 ms
Ensure Unique test removed 25 places
Reduce places removed 331 places and 0 transitions.
Iterating global reduction 3 with 637 rules applied. Total rules applied 1290 place count 987 transition count 1455
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 18 rules applied. Total rules applied 1308 place count 985 transition count 1439
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1324 place count 969 transition count 1439
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 1324 place count 969 transition count 1429
Deduced a syphon composed of 10 places in 9 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 1354 place count 949 transition count 1429
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 1354 place count 949 transition count 1419
Deduced a syphon composed of 10 places in 8 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1374 place count 939 transition count 1419
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 1410 place count 903 transition count 1383
Iterating global reduction 5 with 36 rules applied. Total rules applied 1446 place count 903 transition count 1383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1447 place count 903 transition count 1382
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1447 place count 903 transition count 1371
Deduced a syphon composed of 11 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 23 rules applied. Total rules applied 1470 place count 891 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1470 place count 891 transition count 1370
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 1473 place count 889 transition count 1370
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1476 place count 886 transition count 1349
Iterating global reduction 6 with 3 rules applied. Total rules applied 1479 place count 886 transition count 1349
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1479 place count 886 transition count 1348
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 1481 place count 885 transition count 1348
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1482 place count 884 transition count 1340
Iterating global reduction 6 with 1 rules applied. Total rules applied 1483 place count 884 transition count 1340
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1484 place count 883 transition count 1332
Iterating global reduction 6 with 1 rules applied. Total rules applied 1485 place count 883 transition count 1332
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1486 place count 882 transition count 1324
Iterating global reduction 6 with 1 rules applied. Total rules applied 1487 place count 882 transition count 1324
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1488 place count 881 transition count 1316
Iterating global reduction 6 with 1 rules applied. Total rules applied 1489 place count 881 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1490 place count 880 transition count 1308
Iterating global reduction 6 with 1 rules applied. Total rules applied 1491 place count 880 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1492 place count 879 transition count 1300
Iterating global reduction 6 with 1 rules applied. Total rules applied 1493 place count 879 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1494 place count 878 transition count 1292
Iterating global reduction 6 with 1 rules applied. Total rules applied 1495 place count 878 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1496 place count 877 transition count 1284
Iterating global reduction 6 with 1 rules applied. Total rules applied 1497 place count 877 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1498 place count 876 transition count 1276
Iterating global reduction 6 with 1 rules applied. Total rules applied 1499 place count 876 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1500 place count 875 transition count 1268
Iterating global reduction 6 with 1 rules applied. Total rules applied 1501 place count 875 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1502 place count 874 transition count 1260
Iterating global reduction 6 with 1 rules applied. Total rules applied 1503 place count 874 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1504 place count 873 transition count 1252
Iterating global reduction 6 with 1 rules applied. Total rules applied 1505 place count 873 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1506 place count 872 transition count 1244
Iterating global reduction 6 with 1 rules applied. Total rules applied 1507 place count 872 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1508 place count 871 transition count 1236
Iterating global reduction 6 with 1 rules applied. Total rules applied 1509 place count 871 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1510 place count 870 transition count 1228
Iterating global reduction 6 with 1 rules applied. Total rules applied 1511 place count 870 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1512 place count 869 transition count 1220
Iterating global reduction 6 with 1 rules applied. Total rules applied 1513 place count 869 transition count 1220
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 2 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 6 with 164 rules applied. Total rules applied 1677 place count 787 transition count 1138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1679 place count 786 transition count 1147
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1683 place count 786 transition count 1143
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1687 place count 782 transition count 1143
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1688 place count 782 transition count 1142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1689 place count 781 transition count 1142
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 1690 place count 781 transition count 1142
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1691 place count 781 transition count 1142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1692 place count 780 transition count 1141
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 1696 place count 777 transition count 1140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1697 place count 776 transition count 1140
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 5 Pre rules applied. Total rules applied 1697 place count 776 transition count 1135
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1707 place count 771 transition count 1135
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 1708 place count 770 transition count 1135
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 1714 place count 767 transition count 1132
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1715 place count 766 transition count 1131
Iterating global reduction 11 with 1 rules applied. Total rules applied 1716 place count 766 transition count 1131
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1717 place count 766 transition count 1130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1718 place count 765 transition count 1130
Applied a total of 1718 rules in 1478 ms. Remains 765 /1638 variables (removed 873) and now considering 1130/2094 (removed 964) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1501 ms. Remains : 765/1638 places, 1130/2094 transitions.
RANDOM walk for 4000000 steps (59089 resets) in 90626 ms. (44 steps per ms) remains 223/286 properties
BEST_FIRST walk for 40004 steps (166 resets) in 246 ms. (161 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (158 resets) in 249 ms. (160 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (149 resets) in 253 ms. (157 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (164 resets) in 237 ms. (168 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (160 resets) in 255 ms. (156 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (161 resets) in 246 ms. (161 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (163 resets) in 242 ms. (164 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40001 steps (171 resets) in 234 ms. (170 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (153 resets) in 248 ms. (160 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (159 resets) in 248 ms. (160 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (158 resets) in 264 ms. (150 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (166 resets) in 238 ms. (167 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (157 resets) in 274 ms. (145 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (151 resets) in 301 ms. (132 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40000 steps (159 resets) in 293 ms. (136 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (160 resets) in 305 ms. (130 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (165 resets) in 298 ms. (133 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (154 resets) in 266 ms. (149 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (155 resets) in 254 ms. (156 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (156 resets) in 260 ms. (153 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (153 resets) in 266 ms. (149 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (162 resets) in 260 ms. (153 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (154 resets) in 257 ms. (155 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (165 resets) in 254 ms. (156 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (161 resets) in 298 ms. (133 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (159 resets) in 308 ms. (129 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (176 resets) in 294 ms. (135 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (164 resets) in 299 ms. (133 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (161 resets) in 289 ms. (137 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (153 resets) in 263 ms. (151 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40001 steps (162 resets) in 246 ms. (161 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (160 resets) in 264 ms. (150 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (171 resets) in 249 ms. (160 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (170 resets) in 246 ms. (161 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (154 resets) in 267 ms. (149 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (165 resets) in 251 ms. (158 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (167 resets) in 251 ms. (158 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (158 resets) in 264 ms. (150 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (167 resets) in 248 ms. (160 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40001 steps (155 resets) in 261 ms. (152 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (162 resets) in 256 ms. (155 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (158 resets) in 252 ms. (158 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (150 resets) in 327 ms. (121 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (160 resets) in 261 ms. (152 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (163 resets) in 240 ms. (165 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (169 resets) in 246 ms. (161 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (159 resets) in 256 ms. (155 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (158 resets) in 248 ms. (160 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (160 resets) in 257 ms. (155 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (155 resets) in 250 ms. (159 steps per ms) remains 223/223 properties
// Phase 1: matrix 1130 rows 765 cols
[2024-05-20 22:17:49] [INFO ] Computed 117 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) 24/247 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 2/249 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 161/410 variables, 27/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 35/445 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 2/447 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (OVERLAPS) 150/597 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/597 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 15 (OVERLAPS) 64/661 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/661 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 17 (OVERLAPS) 13/674 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/674 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 19 (OVERLAPS) 91/765 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/765 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 21 (OVERLAPS) 1130/1895 variables, 765/882 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1895 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1895/1895 variables, and 882 constraints, problems are : Problem set: 0 solved, 223 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 765/765 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) 24/247 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 2/249 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 161/410 variables, 27/47 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-20 22:18:39] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 37 ms to minimize.
[2024-05-20 22:18:40] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-20 22:18:40] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 2 ms to minimize.
[2024-05-20 22:18:41] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 3 ms to minimize.
[2024-05-20 22:18:41] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-05-20 22:18:42] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-20 22:18:44] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 35/445 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-20 22:18:50] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (OVERLAPS) 2/447 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 16 (OVERLAPS) 150/597 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-20 22:19:01] [INFO ] Deduced a trap composed of 76 places in 198 ms of which 3 ms to minimize.
[2024-05-20 22:19:02] [INFO ] Deduced a trap composed of 95 places in 208 ms of which 3 ms to minimize.
[2024-05-20 22:19:02] [INFO ] Deduced a trap composed of 80 places in 204 ms of which 4 ms to minimize.
[2024-05-20 22:19:04] [INFO ] Deduced a trap composed of 115 places in 222 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/597 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-20 22:19:08] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 3 ms to minimize.
[2024-05-20 22:19:09] [INFO ] Deduced a trap composed of 83 places in 216 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/597 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-20 22:19:13] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 3 ms to minimize.
[2024-05-20 22:19:14] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/597 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/1895 variables, and 96 constraints, problems are : Problem set: 0 solved, 223 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 23/32 constraints, Generalized P Invariants (flows): 57/85 constraints, State Equation: 0/765 constraints, PredecessorRefiner: 0/223 constraints, Known Traps: 16/16 constraints]
After SMT, in 90222ms problems are : Problem set: 0 solved, 223 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 223 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 1130/1130 transitions.
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 0 with 17 rules applied. Total rules applied 17 place count 765 transition count 1113
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 748 transition count 1113
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 34 place count 748 transition count 1099
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 64 place count 732 transition count 1099
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 732 transition count 1097
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 730 transition count 1097
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 19 rules applied. Total rules applied 87 place count 720 transition count 1088
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 place count 720 transition count 1087
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 719 transition count 1087
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 718 transition count 1087
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 94 place count 716 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 715 transition count 1084
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 715 transition count 1084
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 715 transition count 1083
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 714 transition count 1083
Applied a total of 98 rules in 115 ms. Remains 714 /765 variables (removed 51) and now considering 1083/1130 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 714/765 places, 1083/1130 transitions.
RANDOM walk for 4000000 steps (57689 resets) in 83540 ms. (47 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40001 steps (155 resets) in 315 ms. (126 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (162 resets) in 390 ms. (102 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (155 resets) in 339 ms. (117 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (167 resets) in 325 ms. (122 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (158 resets) in 337 ms. (118 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (145 resets) in 370 ms. (107 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (154 resets) in 375 ms. (106 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (173 resets) in 322 ms. (123 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (150 resets) in 423 ms. (94 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (165 resets) in 473 ms. (84 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (151 resets) in 456 ms. (87 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (137 resets) in 376 ms. (106 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (159 resets) in 396 ms. (100 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (167 resets) in 377 ms. (105 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (152 resets) in 401 ms. (99 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (155 resets) in 507 ms. (78 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (158 resets) in 445 ms. (89 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (157 resets) in 403 ms. (99 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (148 resets) in 448 ms. (89 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (155 resets) in 374 ms. (106 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (169 resets) in 372 ms. (107 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (152 resets) in 440 ms. (90 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (153 resets) in 433 ms. (92 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (157 resets) in 407 ms. (98 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (153 resets) in 423 ms. (94 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (156 resets) in 418 ms. (95 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (162 resets) in 390 ms. (102 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40001 steps (155 resets) in 390 ms. (102 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (156 resets) in 468 ms. (85 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (158 resets) in 536 ms. (74 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (153 resets) in 622 ms. (64 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (157 resets) in 367 ms. (108 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (166 resets) in 385 ms. (103 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (150 resets) in 628 ms. (63 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40001 steps (154 resets) in 398 ms. (100 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (162 resets) in 461 ms. (86 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (162 resets) in 390 ms. (102 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (168 resets) in 524 ms. (76 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (160 resets) in 584 ms. (68 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (163 resets) in 540 ms. (73 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (161 resets) in 472 ms. (84 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (167 resets) in 419 ms. (95 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40001 steps (168 resets) in 462 ms. (86 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (156 resets) in 430 ms. (92 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (156 resets) in 442 ms. (90 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (153 resets) in 378 ms. (105 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (161 resets) in 510 ms. (78 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40003 steps (157 resets) in 481 ms. (82 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (157 resets) in 506 ms. (78 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40002 steps (155 resets) in 572 ms. (69 steps per ms) remains 223/223 properties
Interrupted probabilistic random walk after 3649585 steps, run timeout after 87001 ms. (steps per millisecond=41 ) properties seen :33 out of 223
Probabilistic random walk after 3649585 steps, saw 902318 distinct states, run finished after 87034 ms. (steps per millisecond=41 ) properties seen :33
// Phase 1: matrix 1083 rows 714 cols
[2024-05-20 22:21:15] [INFO ] Computed 113 invariants in 21 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) 8/198 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 1/199 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 77/276 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 36/312 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 2/314 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 102/416 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 26/442 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (OVERLAPS) 2/444 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/444 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (OVERLAPS) 107/551 variables, 15/76 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (OVERLAPS) 59/610 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 23 (OVERLAPS) 8/618 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/618 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 25 (OVERLAPS) 94/712 variables, 27/111 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/712 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 27 (OVERLAPS) 1/713 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/713 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (OVERLAPS) 1/714 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/714 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (OVERLAPS) 1083/1797 variables, 714/827 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1797 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 33 (OVERLAPS) 0/1797 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1797/1797 variables, and 827 constraints, problems are : Problem set: 0 solved, 190 unsolved in 64964 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 714/714 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) 8/198 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 1/199 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 77/276 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:22:24] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-20 22:22:24] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-20 22:22:24] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-20 22:22:24] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-20 22:22:25] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 3 ms to minimize.
[2024-05-20 22:22:26] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:22:27] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:22:29] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (OVERLAPS) 36/312 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:22:31] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
[2024-05-20 22:22:32] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 2/314 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/314 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (OVERLAPS) 102/416 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:22:38] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/416 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:22:43] [INFO ] Deduced a trap composed of 56 places in 259 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/416 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/416 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (OVERLAPS) 26/442 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:22:49] [INFO ] Deduced a trap composed of 129 places in 198 ms of which 3 ms to minimize.
[2024-05-20 22:22:50] [INFO ] Deduced a trap composed of 29 places in 289 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/442 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/442 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (OVERLAPS) 2/444 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/444 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (OVERLAPS) 107/551 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/551 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (OVERLAPS) 59/610 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/610 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 30 (OVERLAPS) 8/618 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/618 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 32 (OVERLAPS) 94/712 variables, 27/125 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/712 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 34 (OVERLAPS) 1/713 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/713 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 36 (OVERLAPS) 1/714 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/714 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 38 (OVERLAPS) 1083/1797 variables, 714/841 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1797/1797 variables, and 1031 constraints, problems are : Problem set: 0 solved, 190 unsolved in 75049 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 14/14 constraints]
After SMT, in 140124ms problems are : Problem set: 0 solved, 190 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 190 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 1083/1083 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 714 transition count 1069
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 700 transition count 1069
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 700 transition count 1062
Deduced a syphon composed of 7 places in 3 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 692 transition count 1062
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 692 transition count 1061
Deduced a syphon composed of 1 places in 3 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 690 transition count 1061
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 690 transition count 1060
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 689 transition count 1060
Applied a total of 48 rules in 76 ms. Remains 689 /714 variables (removed 25) and now considering 1060/1083 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 689/714 places, 1060/1083 transitions.
RANDOM walk for 4000000 steps (57554 resets) in 75938 ms. (52 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (160 resets) in 373 ms. (106 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (146 resets) in 342 ms. (116 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (151 resets) in 481 ms. (82 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (156 resets) in 451 ms. (88 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (159 resets) in 383 ms. (104 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (153 resets) in 395 ms. (101 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (153 resets) in 409 ms. (97 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (159 resets) in 409 ms. (97 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (158 resets) in 499 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (150 resets) in 401 ms. (99 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (160 resets) in 443 ms. (90 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (169 resets) in 494 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (167 resets) in 405 ms. (98 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (163 resets) in 460 ms. (86 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (152 resets) in 496 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (149 resets) in 457 ms. (87 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (157 resets) in 424 ms. (94 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (163 resets) in 392 ms. (101 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (161 resets) in 419 ms. (95 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (163 resets) in 430 ms. (92 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (154 resets) in 492 ms. (81 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (168 resets) in 383 ms. (104 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (145 resets) in 467 ms. (85 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (154 resets) in 344 ms. (115 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (164 resets) in 363 ms. (109 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (152 resets) in 372 ms. (107 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (159 resets) in 352 ms. (113 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (163 resets) in 398 ms. (100 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (158 resets) in 330 ms. (120 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (160 resets) in 338 ms. (118 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (159 resets) in 332 ms. (120 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (152 resets) in 558 ms. (71 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (155 resets) in 506 ms. (78 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (159 resets) in 456 ms. (87 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (156 resets) in 539 ms. (74 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (173 resets) in 400 ms. (99 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (158 resets) in 504 ms. (79 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (158 resets) in 436 ms. (91 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (160 resets) in 487 ms. (81 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (164 resets) in 452 ms. (88 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (153 resets) in 393 ms. (101 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (160 resets) in 410 ms. (97 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (151 resets) in 331 ms. (120 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (163 resets) in 326 ms. (122 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (148 resets) in 356 ms. (112 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40000 steps (150 resets) in 332 ms. (120 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (159 resets) in 481 ms. (82 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (153 resets) in 325 ms. (122 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (166 resets) in 501 ms. (79 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (156 resets) in 547 ms. (72 steps per ms) remains 190/190 properties
Interrupted probabilistic random walk after 3202983 steps, run timeout after 81001 ms. (steps per millisecond=39 ) properties seen :0 out of 190
Probabilistic random walk after 3202983 steps, saw 867977 distinct states, run finished after 81002 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 1060 rows 689 cols
[2024-05-20 22:25:23] [INFO ] Computed 111 invariants in 13 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) 8/198 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 1/199 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 77/276 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 26/302 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 2/304 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 87/391 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 26/417 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (OVERLAPS) 2/419 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (OVERLAPS) 107/526 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (OVERLAPS) 59/585 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/585 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 23 (OVERLAPS) 8/593 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/593 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 25 (OVERLAPS) 94/687 variables, 27/109 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/687 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 27 (OVERLAPS) 1/688 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/688 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (OVERLAPS) 1/689 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/689 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (OVERLAPS) 1060/1749 variables, 689/800 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1749 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 33 (OVERLAPS) 0/1749 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1749/1749 variables, and 800 constraints, problems are : Problem set: 0 solved, 190 unsolved in 59598 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 689/689 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) 8/198 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 1/199 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 77/276 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:26:27] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-20 22:26:27] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-20 22:26:28] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-20 22:26:28] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:26:29] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 26/302 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (OVERLAPS) 2/304 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:26:35] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 87/391 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:26:38] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/391 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:26:41] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/391 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/391 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (OVERLAPS) 26/417 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 21 (OVERLAPS) 2/419 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/419 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 23 (OVERLAPS) 107/526 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/526 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 25 (OVERLAPS) 59/585 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/585 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 27 (OVERLAPS) 8/593 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/593 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 29 (OVERLAPS) 94/687 variables, 27/117 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:27:05] [INFO ] Deduced a trap composed of 105 places in 390 ms of which 5 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/687 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/687 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 32 (OVERLAPS) 1/688 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/688 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 34 (OVERLAPS) 1/689 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/689 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 36 (OVERLAPS) 1060/1749 variables, 689/809 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1749 variables, 190/999 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1749/1749 variables, and 999 constraints, problems are : Problem set: 0 solved, 190 unsolved in 90014 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 689/689 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 9/9 constraints]
After SMT, in 149675ms problems are : Problem set: 0 solved, 190 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 190 out of 689 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 689/689 places, 1060/1060 transitions.
Applied a total of 0 rules in 20 ms. Remains 689 /689 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 689/689 places, 1060/1060 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 689/689 places, 1060/1060 transitions.
Applied a total of 0 rules in 17 ms. Remains 689 /689 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
[2024-05-20 22:27:53] [INFO ] Invariant cache hit.
[2024-05-20 22:27:54] [INFO ] Implicit Places using invariants in 1050 ms returned [90, 285, 286, 288, 305, 323, 392, 396, 397, 408, 409, 411, 428, 446, 515, 519, 520, 523, 534, 535, 536, 554, 556, 560, 578, 579, 580, 581, 593, 599, 605, 611, 617, 623, 629, 635, 641, 647, 653]
[2024-05-20 22:27:54] [INFO ] Actually due to overlaps returned [554, 536, 90, 305, 428, 560, 288, 411, 286, 408, 534, 578, 285, 409, 535, 556, 579, 396, 397, 519, 520, 323, 446, 580, 623, 641, 653, 523, 581, 593, 599, 605, 611, 617, 629, 635, 647]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 1071 ms to find 37 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 652/689 places, 1060/1060 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 650 transition count 993
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 583 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 138 place count 583 transition count 973
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 175 place count 564 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 187 place count 560 transition count 965
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 195 place count 552 transition count 965
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 210 place count 537 transition count 950
Iterating global reduction 4 with 15 rules applied. Total rules applied 225 place count 537 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 228 place count 537 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 228 place count 537 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 230 place count 536 transition count 946
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 233 place count 533 transition count 940
Iterating global reduction 5 with 3 rules applied. Total rules applied 236 place count 533 transition count 940
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 237 place count 532 transition count 939
Iterating global reduction 5 with 1 rules applied. Total rules applied 238 place count 532 transition count 939
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 239 place count 531 transition count 937
Iterating global reduction 5 with 1 rules applied. Total rules applied 240 place count 531 transition count 937
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 290 place count 506 transition count 912
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 292 place count 504 transition count 910
Iterating global reduction 5 with 2 rules applied. Total rules applied 294 place count 504 transition count 910
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 296 place count 504 transition count 908
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 300 place count 502 transition count 909
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 306 place count 502 transition count 903
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 313 place count 495 transition count 903
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 322 place count 495 transition count 903
Applied a total of 322 rules in 183 ms. Remains 495 /652 variables (removed 157) and now considering 903/1060 (removed 157) transitions.
// Phase 1: matrix 903 rows 495 cols
[2024-05-20 22:27:54] [INFO ] Computed 66 invariants in 14 ms
[2024-05-20 22:27:55] [INFO ] Implicit Places using invariants in 591 ms returned [204, 210, 213, 215, 250, 251, 317, 334, 340, 343, 345, 350, 351, 403, 420, 426, 429, 431]
[2024-05-20 22:27:55] [INFO ] Actually due to overlaps returned [250, 350, 251, 351, 204, 210, 215, 334, 340, 345, 420, 426, 431, 317, 403]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 596 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 480/689 places, 903/1060 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 468 transition count 891
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 468 transition count 891
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 465 transition count 888
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 465 transition count 888
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 460 transition count 883
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 49 place count 460 transition count 874
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 58 place count 451 transition count 874
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 451 transition count 872
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 449 transition count 872
Applied a total of 62 rules in 78 ms. Remains 449 /480 variables (removed 31) and now considering 872/903 (removed 31) transitions.
// Phase 1: matrix 872 rows 449 cols
[2024-05-20 22:27:55] [INFO ] Computed 51 invariants in 11 ms
[2024-05-20 22:27:56] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-20 22:27:56] [INFO ] Invariant cache hit.
[2024-05-20 22:27:57] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1630 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 449/689 places, 872/1060 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3578 ms. Remains : 449/689 places, 872/1060 transitions.
RANDOM walk for 4000000 steps (89220 resets) in 69439 ms. (57 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (276 resets) in 320 ms. (124 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (276 resets) in 303 ms. (131 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (288 resets) in 332 ms. (120 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (262 resets) in 383 ms. (104 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (279 resets) in 314 ms. (126 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (274 resets) in 360 ms. (110 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (286 resets) in 318 ms. (125 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (272 resets) in 334 ms. (119 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (267 resets) in 320 ms. (124 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (266 resets) in 313 ms. (127 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (276 resets) in 442 ms. (90 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (259 resets) in 441 ms. (90 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (273 resets) in 440 ms. (90 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (276 resets) in 430 ms. (92 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (283 resets) in 430 ms. (92 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (277 resets) in 365 ms. (109 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (289 resets) in 387 ms. (103 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (285 resets) in 402 ms. (99 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (286 resets) in 378 ms. (105 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (289 resets) in 369 ms. (108 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (293 resets) in 422 ms. (94 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (289 resets) in 332 ms. (120 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (279 resets) in 408 ms. (97 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (279 resets) in 354 ms. (112 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (286 resets) in 335 ms. (119 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (269 resets) in 364 ms. (109 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (279 resets) in 318 ms. (125 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (277 resets) in 338 ms. (118 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (275 resets) in 349 ms. (114 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (283 resets) in 293 ms. (136 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (277 resets) in 307 ms. (129 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (293 resets) in 315 ms. (126 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (277 resets) in 338 ms. (118 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (272 resets) in 317 ms. (125 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (270 resets) in 328 ms. (121 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (256 resets) in 302 ms. (132 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (286 resets) in 348 ms. (114 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (262 resets) in 355 ms. (112 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (282 resets) in 324 ms. (123 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (276 resets) in 375 ms. (106 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (270 resets) in 427 ms. (93 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (279 resets) in 483 ms. (82 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (276 resets) in 639 ms. (62 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (283 resets) in 510 ms. (78 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40001 steps (289 resets) in 493 ms. (80 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (290 resets) in 484 ms. (82 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (267 resets) in 474 ms. (84 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (287 resets) in 522 ms. (76 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (285 resets) in 416 ms. (95 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40002 steps (269 resets) in 392 ms. (101 steps per ms) remains 190/190 properties
Interrupted probabilistic random walk after 5220015 steps, run timeout after 72001 ms. (steps per millisecond=72 ) properties seen :119 out of 190
Probabilistic random walk after 5220015 steps, saw 1038154 distinct states, run finished after 72002 ms. (steps per millisecond=72 ) properties seen :119
[2024-05-20 22:29:34] [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 9704 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-20 22:29:44] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-20 22:29:44] [INFO ] Deduced a trap composed of 14 places in 39 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-20 22:29:47] [INFO ] Deduced a trap composed of 56 places in 87 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-20 22:29:49] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/449 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/449 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 21 (OVERLAPS) 872/1321 variables, 449/504 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1321 variables, 71/575 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1321 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 24 (OVERLAPS) 0/1321 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1321/1321 variables, and 575 constraints, problems are : Problem set: 0 solved, 71 unsolved in 19885 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: 4/4 constraints]
After SMT, in 29612ms problems are : Problem set: 0 solved, 71 unsolved
Fused 71 Parikh solutions to 66 different solutions.
Parikh walk visited 0 properties in 29644 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 1 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 1 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 125 ms. Remains : 370/449 places, 793/872 transitions.
RANDOM walk for 4000000 steps (86220 resets) in 57513 ms. (69 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2761 resets) in 1825 ms. (219 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2758 resets) in 2190 ms. (182 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2730 resets) in 2402 ms. (166 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2728 resets) in 1815 ms. (220 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2778 resets) in 2083 ms. (191 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2776 resets) in 2333 ms. (171 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2722 resets) in 2181 ms. (183 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2777 resets) in 2156 ms. (185 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2734 resets) in 1968 ms. (203 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2749 resets) in 2497 ms. (160 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2790 resets) in 2321 ms. (172 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2742 resets) in 1922 ms. (208 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2727 resets) in 2030 ms. (196 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2785 resets) in 2162 ms. (184 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2726 resets) in 2067 ms. (193 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2771 resets) in 1983 ms. (201 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2767 resets) in 2303 ms. (173 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2727 resets) in 2219 ms. (180 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2775 resets) in 2359 ms. (169 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2780 resets) in 2359 ms. (169 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2761 resets) in 2362 ms. (169 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2740 resets) in 2243 ms. (178 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2752 resets) in 2119 ms. (188 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2742 resets) in 2138 ms. (187 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2801 resets) in 2280 ms. (175 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400000 steps (2761 resets) in 2308 ms. (173 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2709 resets) in 1977 ms. (202 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2727 resets) in 2354 ms. (169 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2803 resets) in 2323 ms. (172 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2766 resets) in 2456 ms. (162 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2800 resets) in 2354 ms. (169 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2788 resets) in 2397 ms. (166 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2793 resets) in 2411 ms. (165 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2759 resets) in 2475 ms. (161 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2761 resets) in 2176 ms. (183 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2730 resets) in 2651 ms. (150 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2758 resets) in 2218 ms. (180 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2766 resets) in 2230 ms. (179 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2750 resets) in 2387 ms. (167 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2744 resets) in 2508 ms. (159 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2769 resets) in 2492 ms. (160 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2787 resets) in 2070 ms. (193 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2783 resets) in 2159 ms. (185 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2776 resets) in 2196 ms. (182 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2730 resets) in 1780 ms. (224 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2770 resets) in 2411 ms. (165 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2774 resets) in 1946 ms. (205 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2746 resets) in 2195 ms. (182 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2797 resets) in 2049 ms. (195 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2752 resets) in 1836 ms. (217 steps per ms) remains 71/71 properties
Interrupted probabilistic random walk after 16157700 steps, run timeout after 171001 ms. (steps per millisecond=94 ) properties seen :63 out of 71
Probabilistic random walk after 16157700 steps, saw 3380178 distinct states, run finished after 171001 ms. (steps per millisecond=94 ) properties seen :63
// Phase 1: matrix 793 rows 370 cols
[2024-05-20 22:34:21] [INFO ] Computed 45 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 15/48 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 206/254 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 53/307 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 63/370 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 793/1163 variables, 370/415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1163 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1163 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 415 constraints, problems are : Problem set: 0 solved, 8 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 15/48 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 206/254 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 53/307 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 63/370 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 793/1163 variables, 370/415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1163 variables, 8/423 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1163 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/1163 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 423 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 2133ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 6545 ms.
Support contains 8 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 370 transition count 776
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 353 transition count 776
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 34 place count 353 transition count 760
Deduced a syphon composed of 16 places in 1 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 68 place count 335 transition count 760
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 334 transition count 758
Reduce places removed 2 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 with 4 rules applied. Total rules applied 75 place count 331 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 330 transition count 757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 76 place count 330 transition count 756
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 5 with 3 rules applied. Total rules applied 79 place count 328 transition count 756
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 79 place count 328 transition count 755
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 81 place count 327 transition count 755
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 7 rules applied. Total rules applied 88 place count 323 transition count 752
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 88 place count 323 transition count 750
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 92 place count 321 transition count 750
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 93 place count 320 transition count 750
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 93 place count 320 transition count 749
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 95 place count 319 transition count 749
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 97 place count 318 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 98 place count 318 transition count 747
Applied a total of 98 rules in 55 ms. Remains 318 /370 variables (removed 52) and now considering 747/793 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 318/370 places, 747/793 transitions.
RANDOM walk for 4000000 steps (86327 resets) in 27737 ms. (144 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (27616 resets) in 11422 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 3769369 steps (26009 resets) in 11895 ms. (316 steps per ms) remains 8/8 properties
BEST_FIRST walk for 3583499 steps (24685 resets) in 12291 ms. (291 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (27497 resets) in 13192 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 3948850 steps (27366 resets) in 11432 ms. (345 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (27583 resets) in 11533 ms. (346 steps per ms) remains 8/8 properties
BEST_FIRST walk for 3825529 steps (26269 resets) in 11682 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 3803276 steps (26269 resets) in 11956 ms. (318 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 11168128 steps, run timeout after 141001 ms. (steps per millisecond=79 ) properties seen :0 out of 8
Probabilistic random walk after 11168128 steps, saw 3185786 distinct states, run finished after 141001 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 747 rows 318 cols
[2024-05-20 22:37:39] [INFO ] Computed 38 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 17/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 13/38 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 3/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 13/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 33/87 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 170/257 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 23/280 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 38/318 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/318 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 747/1065 variables, 318/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1065 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/1065 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1065/1065 variables, and 356 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 17/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 13/38 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 3/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 13/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 33/87 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 170/257 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 23/280 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 38/318 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 22:37:40] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/318 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/318 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 747/1065 variables, 318/357 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1065 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1065 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/1065 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1065/1065 variables, and 365 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1923 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 3048ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 7673 ms.
Support contains 8 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 747/747 transitions.
Applied a total of 0 rules in 14 ms. Remains 318 /318 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 318/318 places, 747/747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 747/747 transitions.
Applied a total of 0 rules in 14 ms. Remains 318 /318 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2024-05-20 22:37:49] [INFO ] Invariant cache hit.
[2024-05-20 22:37:50] [INFO ] Implicit Places using invariants in 594 ms returned [0, 18, 19, 31, 66, 107]
[2024-05-20 22:37:50] [INFO ] Actually due to overlaps returned [31, 0, 19, 66, 18]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 596 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 313/318 places, 747/747 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 312 transition count 736
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 301 transition count 736
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 301 transition count 735
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 25 place count 300 transition count 735
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 2 with 4 rules applied. Total rules applied 29 place count 298 transition count 733
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 297 transition count 732
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 297 transition count 732
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 297 transition count 731
Applied a total of 32 rules in 49 ms. Remains 297 /313 variables (removed 16) and now considering 731/747 (removed 16) transitions.
// Phase 1: matrix 731 rows 297 cols
[2024-05-20 22:37:50] [INFO ] Computed 32 invariants in 9 ms
[2024-05-20 22:37:51] [INFO ] Implicit Places using invariants in 500 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 501 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 296/318 places, 731/747 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 295 transition count 730
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 295 transition count 729
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 294 transition count 729
Applied a total of 4 rules in 23 ms. Remains 294 /296 variables (removed 2) and now considering 729/731 (removed 2) transitions.
// Phase 1: matrix 729 rows 294 cols
[2024-05-20 22:37:51] [INFO ] Computed 31 invariants in 6 ms
[2024-05-20 22:37:51] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-20 22:37:51] [INFO ] Invariant cache hit.
[2024-05-20 22:37:52] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 294/318 places, 729/747 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2865 ms. Remains : 294/318 places, 729/747 transitions.
RANDOM walk for 4000000 steps (86813 resets) in 30724 ms. (130 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (27657 resets) in 10292 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (27755 resets) in 12391 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 3868078 steps (26657 resets) in 12523 ms. (308 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (27567 resets) in 11686 ms. (342 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (27560 resets) in 10622 ms. (376 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (27585 resets) in 12349 ms. (323 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (27725 resets) in 10875 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 3549610 steps (24530 resets) in 11478 ms. (309 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 69658 steps, run visited all 8 properties in 1395 ms. (steps per millisecond=49 )
Probabilistic random walk after 69658 steps, saw 43734 distinct states, run finished after 1416 ms. (steps per millisecond=49 ) properties seen :8
Able to resolve query StableMarking after proving 1443 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 1294142 ms.
ITS solved all properties within timeout

BK_STOP 1716244720795

--------------------
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="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ASLink-PT-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 r012-smll-171620123700033"
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 ;