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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.8K 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 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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:23 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 757K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-08a-LTLCardinality-00
FORMULA_NAME ASLink-PT-08a-LTLCardinality-01
FORMULA_NAME ASLink-PT-08a-LTLCardinality-02
FORMULA_NAME ASLink-PT-08a-LTLCardinality-03
FORMULA_NAME ASLink-PT-08a-LTLCardinality-04
FORMULA_NAME ASLink-PT-08a-LTLCardinality-05
FORMULA_NAME ASLink-PT-08a-LTLCardinality-06
FORMULA_NAME ASLink-PT-08a-LTLCardinality-07
FORMULA_NAME ASLink-PT-08a-LTLCardinality-08
FORMULA_NAME ASLink-PT-08a-LTLCardinality-09
FORMULA_NAME ASLink-PT-08a-LTLCardinality-10
FORMULA_NAME ASLink-PT-08a-LTLCardinality-11
FORMULA_NAME ASLink-PT-08a-LTLCardinality-12
FORMULA_NAME ASLink-PT-08a-LTLCardinality-13
FORMULA_NAME ASLink-PT-08a-LTLCardinality-14
FORMULA_NAME ASLink-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717220640790

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:44:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:44:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:44:04] [INFO ] Load time of PNML (sax parser for PT used): 681 ms
[2024-06-01 05:44:04] [INFO ] Transformed 1796 places.
[2024-06-01 05:44:04] [INFO ] Transformed 2646 transitions.
[2024-06-01 05:44:04] [INFO ] Found NUPN structural information;
[2024-06-01 05:44:04] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 992 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-08a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 1796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1748 transition count 2618
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 61 place count 1735 transition count 2557
Ensure Unique test removed 1 places
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 1734 transition count 2557
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 77 place count 1734 transition count 2555
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 1733 transition count 2547
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1733 transition count 2547
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 1732 transition count 2539
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 1732 transition count 2539
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 1731 transition count 2531
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 1731 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1730 transition count 2523
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1730 transition count 2523
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1729 transition count 2515
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1729 transition count 2515
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1728 transition count 2507
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1728 transition count 2507
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 1727 transition count 2499
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 1727 transition count 2499
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 1726 transition count 2491
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 1726 transition count 2491
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 1725 transition count 2483
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 1725 transition count 2483
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 1724 transition count 2475
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 1724 transition count 2475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1723 transition count 2467
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1723 transition count 2467
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1722 transition count 2459
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1722 transition count 2459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1721 transition count 2451
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1721 transition count 2451
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1720 transition count 2443
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1720 transition count 2443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1719 transition count 2435
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1719 transition count 2435
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1718 transition count 2427
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1718 transition count 2427
Applied a total of 109 rules in 2225 ms. Remains 1718 /1796 variables (removed 78) and now considering 2427/2618 (removed 191) transitions.
// Phase 1: matrix 2427 rows 1718 cols
[2024-06-01 05:44:07] [INFO ] Computed 297 invariants in 563 ms
[2024-06-01 05:44:10] [INFO ] Implicit Places using invariants in 3690 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 778, 783, 785, 803, 821, 950, 966, 971, 972, 973, 991, 1009, 1138, 1154, 1159, 1160, 1161, 1179, 1197, 1326, 1342, 1347, 1348, 1349, 1367, 1385, 1514, 1519, 1531, 1536, 1537, 1538, 1556, 1558, 1561, 1579, 1580, 1581, 1582, 1599, 1607, 1615, 1621, 1627, 1633, 1639, 1647, 1653, 1659, 1667]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 3757 ms to find 78 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1640/1796 places, 2427/2618 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1627 transition count 2414
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1627 transition count 2414
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1618 transition count 2405
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1618 transition count 2405
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 1613 transition count 2400
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 1613 transition count 2400
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1611 transition count 2398
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1611 transition count 2398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1609 transition count 2396
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1609 transition count 2396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1608 transition count 2395
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1608 transition count 2395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1607 transition count 2394
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1607 transition count 2394
Applied a total of 66 rules in 1011 ms. Remains 1607 /1640 variables (removed 33) and now considering 2394/2427 (removed 33) transitions.
// Phase 1: matrix 2394 rows 1607 cols
[2024-06-01 05:44:12] [INFO ] Computed 219 invariants in 300 ms
[2024-06-01 05:44:13] [INFO ] Implicit Places using invariants in 2044 ms returned []
[2024-06-01 05:44:13] [INFO ] Invariant cache hit.
[2024-06-01 05:44:24] [INFO ] Implicit Places using invariants and state equation in 10684 ms returned []
Implicit Place search using SMT with State Equation took 12735 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1607/1796 places, 2394/2618 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19767 ms. Remains : 1607/1796 places, 2394/2618 transitions.
Support contains 27 out of 1607 places after structural reductions.
[2024-06-01 05:44:25] [INFO ] Flatten gal took : 416 ms
[2024-06-01 05:44:25] [INFO ] Flatten gal took : 188 ms
[2024-06-01 05:44:26] [INFO ] Input system was already deterministic with 2394 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (184 resets) in 3019 ms. (13 steps per ms) remains 7/16 properties
BEST_FIRST walk for 40004 steps (17 resets) in 240 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (19 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (18 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (18 resets) in 136 ms. (291 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (18 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (19 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
[2024-06-01 05:44:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 245/260 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 423/683 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 923/1606 variables, 165/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1606 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/1607 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1607 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2394/4001 variables, 1607/1826 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4001 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/4001 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4001/4001 variables, and 1826 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3992 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 166/166 constraints, State Equation: 1607/1607 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 245/260 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 423/683 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 923/1606 variables, 165/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1606 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/1607 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1607 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2394/4001 variables, 1607/1826 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4001 variables, 6/1832 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4001/4001 variables, and 1832 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 166/166 constraints, State Equation: 1607/1607 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 9099ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1607/1607 places, 2394/2394 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 1607 transition count 2088
Reduce places removed 306 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 308 rules applied. Total rules applied 614 place count 1301 transition count 2086
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 616 place count 1299 transition count 2086
Performed 205 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 205 Pre rules applied. Total rules applied 616 place count 1299 transition count 1881
Deduced a syphon composed of 205 places in 3 ms
Ensure Unique test removed 68 places
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1094 place count 1026 transition count 1881
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 29 rules applied. Total rules applied 1123 place count 1014 transition count 1864
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1140 place count 997 transition count 1864
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 1140 place count 997 transition count 1841
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 1186 place count 974 transition count 1841
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1192 place count 968 transition count 1835
Iterating global reduction 5 with 6 rules applied. Total rules applied 1198 place count 968 transition count 1835
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 1202 place count 968 transition count 1831
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1203 place count 967 transition count 1831
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1203 place count 967 transition count 1830
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1205 place count 966 transition count 1830
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 4 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 7 with 172 rules applied. Total rules applied 1377 place count 880 transition count 1744
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1385 place count 880 transition count 1736
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1393 place count 872 transition count 1736
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 8 with 37 rules applied. Total rules applied 1430 place count 872 transition count 1699
Ensure Unique test removed 1 places
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 8 with 38 rules applied. Total rules applied 1468 place count 834 transition count 1699
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1473 place count 834 transition count 1694
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 1497 place count 834 transition count 1694
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1499 place count 834 transition count 1694
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1500 place count 834 transition count 1693
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1501 place count 833 transition count 1692
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1513 place count 823 transition count 1690
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 23 Pre rules applied. Total rules applied 1513 place count 823 transition count 1667
Deduced a syphon composed of 23 places in 3 ms
Ensure Unique test removed 7 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 10 with 53 rules applied. Total rules applied 1566 place count 793 transition count 1667
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1573 place count 786 transition count 1660
Iterating global reduction 10 with 7 rules applied. Total rules applied 1580 place count 786 transition count 1660
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1587 place count 786 transition count 1653
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1588 place count 786 transition count 1652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1589 place count 785 transition count 1652
Applied a total of 1589 rules in 1456 ms. Remains 785 /1607 variables (removed 822) and now considering 1652/2394 (removed 742) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1456 ms. Remains : 785/1607 places, 1652/2394 transitions.
RANDOM walk for 40000 steps (581 resets) in 656 ms. (60 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (87 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (89 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (89 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (82 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (88 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
// Phase 1: matrix 1652 rows 785 cols
[2024-06-01 05:44:38] [INFO ] Computed 121 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 52/63 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 360/423 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 40/463 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 271/734 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/734 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 4/738 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/738 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 47/785 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/785 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1652/2437 variables, 785/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/2437 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 906 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1777 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 785/785 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 52/63 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 360/423 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 40/463 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 271/734 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 05:44:40] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 34 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/734 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/738 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/738 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 47/785 variables, 10/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/785 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1652/2437 variables, 785/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2437 variables, 5/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2437 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/2437 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 912 constraints, problems are : Problem set: 0 solved, 5 unsolved in 18742 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 785/785 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 20571ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 2 properties in 16511 ms.
Support contains 7 out of 785 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 1652/1652 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 0 with 1 rules applied. Total rules applied 1 place count 785 transition count 1651
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 784 transition count 1651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 784 transition count 1650
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 782 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 781 transition count 1649
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 781 transition count 1649
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 781 transition count 1648
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 780 transition count 1647
Applied a total of 10 rules in 139 ms. Remains 780 /785 variables (removed 5) and now considering 1647/1652 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 780/785 places, 1647/1652 transitions.
RANDOM walk for 40000 steps (606 resets) in 349 ms. (114 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (86 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (76 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (89 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 159194 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :1 out of 3
Probabilistic random walk after 159194 steps, saw 62504 distinct states, run finished after 3007 ms. (steps per millisecond=52 ) properties seen :1
// Phase 1: matrix 1647 rows 780 cols
[2024-06-01 05:45:18] [INFO ] Computed 120 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/47 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 283/330 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 46/376 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 343/719 variables, 55/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/719 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/724 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/724 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 56/780 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1647/2427 variables, 780/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2427 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2427 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2427/2427 variables, and 900 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1254 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 780/780 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/47 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 283/330 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 46/376 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 343/719 variables, 55/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:45:20] [INFO ] Deduced a trap composed of 43 places in 332 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/719 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/719 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/724 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/724 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 56/780 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/780 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1647/2427 variables, 780/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2427 variables, 2/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2427 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2427 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2427/2427 variables, and 903 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 780/780 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 3136ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1183 ms.
Support contains 6 out of 780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 780/780 places, 1647/1647 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 0 with 1 rules applied. Total rules applied 1 place count 780 transition count 1646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 779 transition count 1646
Applied a total of 2 rules in 80 ms. Remains 779 /780 variables (removed 1) and now considering 1646/1647 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 779/780 places, 1646/1647 transitions.
RANDOM walk for 40000 steps (593 resets) in 273 ms. (145 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 199730 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 199730 steps, saw 90121 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 1646 rows 779 cols
[2024-06-01 05:45:26] [INFO ] Computed 120 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/47 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 282/329 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/382 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 336/718 variables, 54/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/723 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/723 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 56/779 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/779 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1646/2425 variables, 779/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2425 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2425 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2425/2425 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 99/99 constraints, State Equation: 779/779 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/47 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 282/329 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/382 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 336/718 variables, 54/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/723 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/723 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 56/779 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/779 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1646/2425 variables, 779/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2425 variables, 2/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2425 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2425 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2425/2425 variables, and 901 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 99/99 constraints, State Equation: 779/779 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2857ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1421 ms.
Support contains 6 out of 779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 1646/1646 transitions.
Applied a total of 0 rules in 57 ms. Remains 779 /779 variables (removed 0) and now considering 1646/1646 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 779/779 places, 1646/1646 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 1646/1646 transitions.
Applied a total of 0 rules in 54 ms. Remains 779 /779 variables (removed 0) and now considering 1646/1646 (removed 0) transitions.
[2024-06-01 05:45:30] [INFO ] Invariant cache hit.
[2024-06-01 05:45:32] [INFO ] Implicit Places using invariants in 1291 ms returned [72, 89, 95, 98, 100, 101, 106, 107, 159, 177, 183, 186, 188, 189, 194, 195, 247, 264, 270, 273, 275, 276, 281, 282, 334, 351, 357, 360, 362, 363, 368, 369, 421, 439, 445, 448, 450, 451, 456, 457, 509, 526, 535, 538, 540, 541, 546, 547, 599, 616, 622, 625, 627, 628, 633, 634, 686, 703, 709, 712, 714, 716]
[2024-06-01 05:45:32] [INFO ] Actually due to overlaps returned [189, 276, 363, 451, 541, 716, 628, 89, 95, 100, 177, 183, 188, 264, 270, 275, 351, 357, 362, 439, 445, 450, 526, 535, 540, 616, 622, 627, 703, 709, 714, 72, 101, 159, 247, 334, 421, 509, 599, 686]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1295 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 739/779 places, 1646/1646 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 708 transition count 1615
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 708 transition count 1615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 701 transition count 1608
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 701 transition count 1608
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 108 place count 685 transition count 1592
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 131 place count 685 transition count 1569
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 154 place count 662 transition count 1569
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 162 place count 662 transition count 1561
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 170 place count 654 transition count 1561
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 654 transition count 1561
Applied a total of 171 rules in 195 ms. Remains 654 /739 variables (removed 85) and now considering 1561/1646 (removed 85) transitions.
// Phase 1: matrix 1561 rows 654 cols
[2024-06-01 05:45:32] [INFO ] Computed 80 invariants in 17 ms
[2024-06-01 05:45:33] [INFO ] Implicit Places using invariants in 1075 ms returned [89, 90, 161, 162, 232, 233, 303, 304, 375, 376, 453, 454, 524, 525]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1077 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 640/779 places, 1561/1646 transitions.
Applied a total of 0 rules in 26 ms. Remains 640 /640 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2648 ms. Remains : 640/779 places, 1561/1646 transitions.
RANDOM walk for 40000 steps (652 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (112 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (89 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 167798 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 2
Probabilistic random walk after 167798 steps, saw 101457 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
// Phase 1: matrix 1561 rows 640 cols
[2024-06-01 05:45:36] [INFO ] Computed 66 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 356/403 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/437 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 192/629 variables, 26/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/640 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1561/2201 variables, 640/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2201 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2201 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2201/2201 variables, and 706 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1287 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 356/403 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/437 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 192/629 variables, 26/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:45:38] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/640 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/640 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1561/2201 variables, 640/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2201 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:45:39] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2201 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2201 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2201 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2201/2201 variables, and 710 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2939ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 606 ms.
Support contains 6 out of 640 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 640/640 places, 1561/1561 transitions.
Applied a total of 0 rules in 42 ms. Remains 640 /640 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 640/640 places, 1561/1561 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 640/640 places, 1561/1561 transitions.
Applied a total of 0 rules in 45 ms. Remains 640 /640 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
[2024-06-01 05:45:40] [INFO ] Invariant cache hit.
[2024-06-01 05:45:41] [INFO ] Implicit Places using invariants in 1189 ms returned []
[2024-06-01 05:45:41] [INFO ] Invariant cache hit.
[2024-06-01 05:45:43] [INFO ] Implicit Places using invariants and state equation in 2591 ms returned []
Implicit Place search using SMT with State Equation took 3782 ms to find 0 implicit places.
[2024-06-01 05:45:44] [INFO ] Redundant transitions in 126 ms returned []
Running 1523 sub problems to find dead transitions.
[2024-06-01 05:45:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 1523 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 639/2201 variables, and 62 constraints, problems are : Problem set: 0 solved, 1523 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 51/52 constraints, State Equation: 0/640 constraints, PredecessorRefiner: 1523/1523 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/2201 variables, and 62 constraints, problems are : Problem set: 0 solved, 1523 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 51/52 constraints, State Equation: 0/640 constraints, PredecessorRefiner: 0/1523 constraints, Known Traps: 0/0 constraints]
After SMT, in 61530ms problems are : Problem set: 0 solved, 1523 unsolved
Search for dead transitions found 0 dead transitions in 61557ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65527 ms. Remains : 640/640 places, 1561/1561 transitions.
FORMULA ASLink-PT-08a-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(p0) U p1))))))'
Support contains 3 out of 1607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 2394/2394 transitions.
Applied a total of 0 rules in 106 ms. Remains 1607 /1607 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
// Phase 1: matrix 2394 rows 1607 cols
[2024-06-01 05:46:46] [INFO ] Computed 219 invariants in 43 ms
[2024-06-01 05:46:48] [INFO ] Implicit Places using invariants in 2206 ms returned [391, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2221 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1605/1607 places, 2394/2394 transitions.
Applied a total of 0 rules in 124 ms. Remains 1605 /1605 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2454 ms. Remains : 1605/1607 places, 2394/2394 transitions.
Stuttering acceptance computed with spot in 687 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-00
Product exploration explored 100000 steps with 20000 reset in 1581 ms.
Product exploration explored 100000 steps with 20000 reset in 1064 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
RANDOM walk for 40000 steps (196 resets) in 470 ms. (84 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (17 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
// Phase 1: matrix 2394 rows 1605 cols
[2024-06-01 05:46:52] [INFO ] Computed 217 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/674 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 923/1597 variables, 166/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1597 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1605 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1605 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3999/3999 variables, and 1822 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1904 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 167/167 constraints, State Equation: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/674 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 923/1597 variables, 166/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1597 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1605 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1605 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2394/3999 variables, 1605/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3999 variables, 1/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3999 variables, 0/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3999 variables, 0/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3999/3999 variables, and 1823 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2023 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 167/167 constraints, State Equation: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3992ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 386 ms.
Support contains 3 out of 1605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1605/1605 places, 2394/2394 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 318 transitions
Trivial Post-agglo rules discarded 318 transitions
Performed 318 trivial Post agglomeration. Transition count delta: 318
Iterating post reduction 0 with 318 rules applied. Total rules applied 318 place count 1605 transition count 2076
Reduce places removed 318 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 319 rules applied. Total rules applied 637 place count 1287 transition count 2075
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 638 place count 1286 transition count 2075
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 214 Pre rules applied. Total rules applied 638 place count 1286 transition count 1861
Deduced a syphon composed of 214 places in 5 ms
Ensure Unique test removed 68 places
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 1134 place count 1004 transition count 1861
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 21 rules applied. Total rules applied 1155 place count 992 transition count 1852
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1164 place count 983 transition count 1852
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 31 Pre rules applied. Total rules applied 1164 place count 983 transition count 1821
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1226 place count 952 transition count 1821
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1231 place count 947 transition count 1816
Iterating global reduction 5 with 5 rules applied. Total rules applied 1236 place count 947 transition count 1816
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1239 place count 947 transition count 1813
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1239 place count 947 transition count 1812
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1241 place count 946 transition count 1812
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 5 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 6 with 174 rules applied. Total rules applied 1415 place count 859 transition count 1725
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1423 place count 859 transition count 1717
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1431 place count 851 transition count 1717
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 7 with 33 rules applied. Total rules applied 1464 place count 851 transition count 1684
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 7 with 34 rules applied. Total rules applied 1498 place count 817 transition count 1684
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1506 place count 817 transition count 1676
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 8 with 25 rules applied. Total rules applied 1531 place count 817 transition count 1676
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1532 place count 816 transition count 1675
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1540 place count 808 transition count 1675
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 1540 place count 808 transition count 1659
Deduced a syphon composed of 16 places in 3 ms
Ensure Unique test removed 8 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 1580 place count 784 transition count 1659
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 1588 place count 776 transition count 1651
Iterating global reduction 9 with 8 rules applied. Total rules applied 1596 place count 776 transition count 1651
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1604 place count 776 transition count 1643
Applied a total of 1604 rules in 707 ms. Remains 776 /1605 variables (removed 829) and now considering 1643/2394 (removed 751) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 710 ms. Remains : 776/1605 places, 1643/2394 transitions.
RANDOM walk for 40000 steps (611 resets) in 336 ms. (118 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (86 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 308378 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 308378 steps, saw 86505 distinct states, run finished after 3002 ms. (steps per millisecond=102 ) properties seen :0
// Phase 1: matrix 1643 rows 776 cols
[2024-06-01 05:47:00] [INFO ] Computed 120 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/153 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/167 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/390 variables, 37/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/397 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 152/549 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/549 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/553 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 82/635 variables, 12/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/635 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/641 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 76/717 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/717 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/722 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/722 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/723 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/723 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 53/776 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/776 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1643/2419 variables, 776/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2419 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2419 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2419/2419 variables, and 896 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1122 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 99/99 constraints, State Equation: 776/776 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:47:02] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 115/153 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/167 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 223/390 variables, 37/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/397 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 152/549 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/549 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/553 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 82/635 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/635 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/641 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/641 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 76/717 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/717 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 5/722 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/722 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/723 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/723 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 53/776 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/776 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1643/2419 variables, 776/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2419 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2419 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2419 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2419/2419 variables, and 898 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1470 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 99/99 constraints, State Equation: 776/776 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2635ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 3 out of 776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 1643/1643 transitions.
Applied a total of 0 rules in 44 ms. Remains 776 /776 variables (removed 0) and now considering 1643/1643 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 776/776 places, 1643/1643 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 1643/1643 transitions.
Applied a total of 0 rules in 45 ms. Remains 776 /776 variables (removed 0) and now considering 1643/1643 (removed 0) transitions.
[2024-06-01 05:47:03] [INFO ] Invariant cache hit.
[2024-06-01 05:47:05] [INFO ] Implicit Places using invariants in 1515 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 349, 355, 358, 360, 361, 366, 367, 419, 436, 442, 445, 447, 448, 453, 454, 506, 523, 529, 532, 534, 535, 540, 541, 593, 610, 617, 622, 624, 625, 630, 631, 683, 700, 706, 709, 711, 712]
[2024-06-01 05:47:05] [INFO ] Actually due to overlaps returned [187, 274, 361, 448, 535, 625, 712, 88, 94, 99, 175, 181, 186, 262, 268, 273, 349, 355, 360, 436, 442, 447, 523, 529, 534, 610, 617, 624, 700, 706, 711, 71, 100, 158, 245, 332, 419, 506, 593, 683]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1519 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 736/776 places, 1643/1643 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 705 transition count 1612
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 705 transition count 1612
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 698 transition count 1605
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 698 transition count 1605
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 108 place count 682 transition count 1589
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 131 place count 682 transition count 1566
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 154 place count 659 transition count 1566
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 162 place count 659 transition count 1558
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 170 place count 651 transition count 1558
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 651 transition count 1558
Applied a total of 171 rules in 293 ms. Remains 651 /736 variables (removed 85) and now considering 1558/1643 (removed 85) transitions.
// Phase 1: matrix 1558 rows 651 cols
[2024-06-01 05:47:05] [INFO ] Computed 80 invariants in 26 ms
[2024-06-01 05:47:06] [INFO ] Implicit Places using invariants in 1452 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 372, 373, 443, 444, 521, 522]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1455 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 637/776 places, 1558/1643 transitions.
Applied a total of 0 rules in 35 ms. Remains 637 /637 variables (removed 0) and now considering 1558/1558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3348 ms. Remains : 637/776 places, 1558/1643 transitions.
RANDOM walk for 40000 steps (638 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (106 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 221387 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 221387 steps, saw 104284 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 1558 rows 637 cols
[2024-06-01 05:47:10] [INFO ] Computed 66 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/91 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/137 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 228/365 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/370 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 136/506 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/506 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/510 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/510 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 112/622 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/622 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/626 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/626 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 11/637 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/637 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1558/2195 variables, 637/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2195 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2195 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2195/2195 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 637/637 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/91 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:47:11] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/104 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/137 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 228/365 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/370 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 136/506 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/510 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/510 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 112/622 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/622 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/626 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/626 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 11/637 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/637 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1558/2195 variables, 637/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2195 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2195 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2195 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2195/2195 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1377 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 637/637 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2453ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 3 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1558/1558 transitions.
Applied a total of 0 rules in 37 ms. Remains 637 /637 variables (removed 0) and now considering 1558/1558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 637/637 places, 1558/1558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1558/1558 transitions.
Applied a total of 0 rules in 37 ms. Remains 637 /637 variables (removed 0) and now considering 1558/1558 (removed 0) transitions.
[2024-06-01 05:47:12] [INFO ] Invariant cache hit.
[2024-06-01 05:47:13] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2024-06-01 05:47:13] [INFO ] Invariant cache hit.
[2024-06-01 05:47:16] [INFO ] Implicit Places using invariants and state equation in 2310 ms returned []
Implicit Place search using SMT with State Equation took 3567 ms to find 0 implicit places.
[2024-06-01 05:47:16] [INFO ] Redundant transitions in 97 ms returned []
Running 1520 sub problems to find dead transitions.
[2024-06-01 05:47:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/2195 variables, and 62 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 51/52 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 1520/1520 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 636/2195 variables, and 62 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 51/52 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 0/1520 constraints, Known Traps: 0/0 constraints]
After SMT, in 61419ms problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 61438ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65154 ms. Remains : 637/637 places, 1558/1558 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 41 ms. Remains 637 /637 variables (removed 0) and now considering 1558/1558 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 05:48:17] [INFO ] Invariant cache hit.
[2024-06-01 05:48:18] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 05:48:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 05:48:18] [INFO ] [Nat]Absence check using 14 positive and 52 generalized place invariants in 53 ms returned sat
[2024-06-01 05:48:19] [INFO ] After 857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 05:48:19] [INFO ] After 947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 05:48:19] [INFO ] After 1291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1579 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 201 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 298 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 3 out of 1605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1605/1605 places, 2394/2394 transitions.
Applied a total of 0 rules in 108 ms. Remains 1605 /1605 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
// Phase 1: matrix 2394 rows 1605 cols
[2024-06-01 05:48:20] [INFO ] Computed 217 invariants in 40 ms
[2024-06-01 05:48:22] [INFO ] Implicit Places using invariants in 2228 ms returned []
[2024-06-01 05:48:22] [INFO ] Invariant cache hit.
[2024-06-01 05:48:29] [INFO ] Implicit Places using invariants and state equation in 7201 ms returned []
Implicit Place search using SMT with State Equation took 9435 ms to find 0 implicit places.
Running 2393 sub problems to find dead transitions.
[2024-06-01 05:48:29] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 16.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 8.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 18.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 7.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 5.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 2.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 3.0)
(s201 1.0)
(s202 2.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 2.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 13.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 14.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 11.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 8.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 14.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 5.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 2.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 3.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 3.0)
(s382 1.0)
(s383 2.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 11.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1604 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 2393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1604/3999 variables, and 154 constraints, problems are : Problem set: 0 solved, 2393 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, Generalized P Invariants (flows): 154/167 constraints, State Equation: 0/1605 constraints, PredecessorRefiner: 2393/2393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1604 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 2393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1604/3999 variables, and 154 constraints, problems are : Problem set: 0 solved, 2393 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, Generalized P Invariants (flows): 154/167 constraints, State Equation: 0/1605 constraints, PredecessorRefiner: 0/2393 constraints, Known Traps: 0/0 constraints]
After SMT, in 61973ms problems are : Problem set: 0 solved, 2393 unsolved
Search for dead transitions found 0 dead transitions in 62021ms
Finished structural reductions in LTL mode , in 1 iterations and 71577 ms. Remains : 1605/1605 places, 2394/2394 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
RANDOM walk for 40000 steps (181 resets) in 345 ms. (115 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (17 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
[2024-06-01 05:49:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/674 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 923/1597 variables, 166/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1597 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1605 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1605 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3999/3999 variables, and 1822 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1960 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 167/167 constraints, State Equation: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/674 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 923/1597 variables, 166/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:49:35] [INFO ] Deduced a trap composed of 50 places in 882 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1597 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1597 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/1605 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1605 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2394/3999 variables, 1605/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3999 variables, 1/1824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3999 variables, 0/1824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3999 variables, 0/1824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3999/3999 variables, and 1824 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2952 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 167/167 constraints, State Equation: 1605/1605 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 4933ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 444 ms.
Support contains 3 out of 1605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1605/1605 places, 2394/2394 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 318 transitions
Trivial Post-agglo rules discarded 318 transitions
Performed 318 trivial Post agglomeration. Transition count delta: 318
Iterating post reduction 0 with 318 rules applied. Total rules applied 318 place count 1605 transition count 2076
Reduce places removed 318 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 319 rules applied. Total rules applied 637 place count 1287 transition count 2075
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 638 place count 1286 transition count 2075
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 214 Pre rules applied. Total rules applied 638 place count 1286 transition count 1861
Deduced a syphon composed of 214 places in 4 ms
Ensure Unique test removed 68 places
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 1134 place count 1004 transition count 1861
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 21 rules applied. Total rules applied 1155 place count 992 transition count 1852
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1164 place count 983 transition count 1852
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 31 Pre rules applied. Total rules applied 1164 place count 983 transition count 1821
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1226 place count 952 transition count 1821
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1231 place count 947 transition count 1816
Iterating global reduction 5 with 5 rules applied. Total rules applied 1236 place count 947 transition count 1816
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1239 place count 947 transition count 1813
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1239 place count 947 transition count 1812
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1241 place count 946 transition count 1812
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 6 with 174 rules applied. Total rules applied 1415 place count 859 transition count 1725
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1423 place count 859 transition count 1717
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1431 place count 851 transition count 1717
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 7 with 33 rules applied. Total rules applied 1464 place count 851 transition count 1684
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 7 with 34 rules applied. Total rules applied 1498 place count 817 transition count 1684
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1506 place count 817 transition count 1676
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 8 with 25 rules applied. Total rules applied 1531 place count 817 transition count 1676
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1532 place count 816 transition count 1675
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1540 place count 808 transition count 1675
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 1540 place count 808 transition count 1659
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 1580 place count 784 transition count 1659
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 1588 place count 776 transition count 1651
Iterating global reduction 9 with 8 rules applied. Total rules applied 1596 place count 776 transition count 1651
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1604 place count 776 transition count 1643
Applied a total of 1604 rules in 609 ms. Remains 776 /1605 variables (removed 829) and now considering 1643/2394 (removed 751) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 609 ms. Remains : 776/1605 places, 1643/2394 transitions.
RANDOM walk for 40000 steps (608 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (83 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 282638 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 282638 steps, saw 80968 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
// Phase 1: matrix 1643 rows 776 cols
[2024-06-01 05:49:41] [INFO ] Computed 120 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/153 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/167 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/390 variables, 37/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/397 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 152/549 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/549 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/553 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 82/635 variables, 12/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/635 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/641 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 76/717 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/717 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/722 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/722 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/723 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/723 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 53/776 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/776 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1643/2419 variables, 776/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2419 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2419 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2419/2419 variables, and 896 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 99/99 constraints, State Equation: 776/776 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:49:42] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 115/153 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/167 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 223/390 variables, 37/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/397 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 152/549 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/549 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/553 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 82/635 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/635 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/641 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/641 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 76/717 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/717 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 5/722 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/722 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/723 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/723 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 53/776 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/776 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1643/2419 variables, 776/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2419 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2419 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2419 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2419/2419 variables, and 898 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1389 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 99/99 constraints, State Equation: 776/776 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 3 out of 776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 1643/1643 transitions.
Applied a total of 0 rules in 48 ms. Remains 776 /776 variables (removed 0) and now considering 1643/1643 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 776/776 places, 1643/1643 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 1643/1643 transitions.
Applied a total of 0 rules in 46 ms. Remains 776 /776 variables (removed 0) and now considering 1643/1643 (removed 0) transitions.
[2024-06-01 05:49:44] [INFO ] Invariant cache hit.
[2024-06-01 05:49:46] [INFO ] Implicit Places using invariants in 1777 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 349, 355, 358, 360, 361, 366, 367, 419, 436, 442, 445, 447, 448, 453, 454, 506, 523, 529, 532, 534, 535, 540, 541, 593, 610, 617, 622, 624, 625, 630, 631, 683, 700, 706, 709, 711, 712]
[2024-06-01 05:49:46] [INFO ] Actually due to overlaps returned [187, 274, 361, 448, 535, 625, 712, 88, 94, 99, 175, 181, 186, 262, 268, 273, 349, 355, 360, 436, 442, 447, 523, 529, 534, 610, 617, 624, 700, 706, 711, 71, 100, 158, 245, 332, 419, 506, 593, 683]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1781 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 736/776 places, 1643/1643 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 705 transition count 1612
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 705 transition count 1612
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 698 transition count 1605
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 698 transition count 1605
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 108 place count 682 transition count 1589
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 131 place count 682 transition count 1566
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 154 place count 659 transition count 1566
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 162 place count 659 transition count 1558
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 170 place count 651 transition count 1558
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 651 transition count 1558
Applied a total of 171 rules in 310 ms. Remains 651 /736 variables (removed 85) and now considering 1558/1643 (removed 85) transitions.
// Phase 1: matrix 1558 rows 651 cols
[2024-06-01 05:49:46] [INFO ] Computed 80 invariants in 38 ms
[2024-06-01 05:49:47] [INFO ] Implicit Places using invariants in 1409 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 372, 373, 443, 444, 521, 522]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1412 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 637/776 places, 1558/1643 transitions.
Applied a total of 0 rules in 25 ms. Remains 637 /637 variables (removed 0) and now considering 1558/1558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3578 ms. Remains : 637/776 places, 1558/1643 transitions.
RANDOM walk for 37499 steps (623 resets) in 160 ms. (232 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 222 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 1052 ms.
Product exploration explored 100000 steps with 20000 reset in 780 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 3 out of 1605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1605/1605 places, 2394/2394 transitions.
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 318 rules applied. Total rules applied 318 place count 1605 transition count 2394
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 115 Pre rules applied. Total rules applied 318 place count 1605 transition count 2431
Deduced a syphon composed of 433 places in 5 ms
Iterating global reduction 1 with 115 rules applied. Total rules applied 433 place count 1605 transition count 2431
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 439 place count 1602 transition count 2431
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 482 place count 1559 transition count 2388
Deduced a syphon composed of 395 places in 5 ms
Iterating global reduction 2 with 43 rules applied. Total rules applied 525 place count 1559 transition count 2388
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 596 places in 5 ms
Iterating global reduction 2 with 201 rules applied. Total rules applied 726 place count 1559 transition count 2415
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 833 place count 1452 transition count 2308
Deduced a syphon composed of 489 places in 3 ms
Iterating global reduction 2 with 107 rules applied. Total rules applied 940 place count 1452 transition count 2308
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 498 places in 3 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 949 place count 1452 transition count 2356
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 499 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 950 place count 1452 transition count 2360
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 952 place count 1450 transition count 2354
Deduced a syphon composed of 497 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 954 place count 1450 transition count 2354
Deduced a syphon composed of 497 places in 3 ms
Applied a total of 954 rules in 1273 ms. Remains 1450 /1605 variables (removed 155) and now considering 2354/2394 (removed 40) transitions.
[2024-06-01 05:49:53] [INFO ] Redundant transitions in 259 ms returned []
Running 2353 sub problems to find dead transitions.
// Phase 1: matrix 2354 rows 1450 cols
[2024-06-01 05:49:53] [INFO ] Computed 214 invariants in 41 ms
[2024-06-01 05:49:53] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1449 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 2353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1449/3804 variables, and 154 constraints, problems are : Problem set: 0 solved, 2353 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, Generalized P Invariants (flows): 154/164 constraints, State Equation: 0/1450 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 2353/2353 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1449 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 2353 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 0)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 16)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 8)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 0)
(s108 1)
(s109 8)
(s110 1)
(s111 0)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 2)
(s117 1)
(s118 18)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 8)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 6)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 3)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 16)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 8)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 0)
(s272 1)
(s273 0)
(s274 1)
(s275 1)
(s276 1)
(s277 8)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 17)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 8)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 2)
(s317 1)
(s318 7)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 3)
(s349 1)
(s350 1)
(s351 3)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 16)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 8)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 12)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 2)
(s464 1)
(s465 1)
(s466 9)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 2)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 6)
(s509 1)
(s510 1)
(s511 1)
(s512 3)
(s513 1)
(s514 1)
(s515 3)
(s516 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1449/3804 variables, and 154 constraints, problems are : Problem set: 0 solved, 2353 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, Generalized P Invariants (flows): 154/164 constraints, State Equation: 0/1450 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 0/2353 constraints, Known Traps: 0/0 constraints]
After SMT, in 61706ms problems are : Problem set: 0 solved, 2353 unsolved
Search for dead transitions found 0 dead transitions in 61734ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1450/1605 places, 2354/2394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63279 ms. Remains : 1450/1605 places, 2354/2394 transitions.
Support contains 3 out of 1605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1605/1605 places, 2394/2394 transitions.
Applied a total of 0 rules in 118 ms. Remains 1605 /1605 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
// Phase 1: matrix 2394 rows 1605 cols
[2024-06-01 05:50:54] [INFO ] Computed 217 invariants in 38 ms
[2024-06-01 05:50:56] [INFO ] Implicit Places using invariants in 1896 ms returned []
[2024-06-01 05:50:56] [INFO ] Invariant cache hit.
[2024-06-01 05:51:04] [INFO ] Implicit Places using invariants and state equation in 8011 ms returned []
Implicit Place search using SMT with State Equation took 9911 ms to find 0 implicit places.
Running 2393 sub problems to find dead transitions.
[2024-06-01 05:51:04] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 16.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 8.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 18.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 7.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 5.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 2.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 3.0)
(s201 1.0)
(s202 2.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 2.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 13.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 14.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 11.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 8.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 14.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 5.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 2.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 3.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 3.0)
(s382 1.0)
(s383 2.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 11.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 9.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 3.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 1.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 2.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 3.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 3.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 0.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 16.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 11.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 8.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 14.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 5.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 2.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 3.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 3.0)
(s744 1.0)
(s745 2.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 16.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 9.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 7.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 5.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 2.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 3.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 4.0)
(s924 3.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 2.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 0.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 0.0)
(s957 1.0)
(s958 0.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 16.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 11.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 8.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 14.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 5.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 2.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 3.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 3.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 2.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 0.0)
(s1134 1.0)
(s1135 0.0)
(s1136 1.0)
(s1137 0.0)
(s1138 1.0)
(s1139 0.0)
(s1140 1.0)
(s1141 0.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 16.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 6.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 16.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 7.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 5.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 0.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 2.0)
(s1291 1.0)
(s1292 1.0)
(s1293 3.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 0.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 0.0)
(s1319 1.0)
(s1320 0.0)
(s1321 1.0)
(s1322 0.0)
(s1323 1.0)
(s1324 0.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 16.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 33.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 6.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 16.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 7.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 5.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 2.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1604 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 2393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1604/3999 variables, and 154 constraints, problems are : Problem set: 0 solved, 2393 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, Generalized P Invariants (flows): 154/167 constraints, State Equation: 0/1605 constraints, PredecessorRefiner: 2393/2393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1604 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 2393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1604/3999 variables, and 154 constraints, problems are : Problem set: 0 solved, 2393 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, Generalized P Invariants (flows): 154/167 constraints, State Equation: 0/1605 constraints, PredecessorRefiner: 0/2393 constraints, Known Traps: 0/0 constraints]
After SMT, in 61788ms problems are : Problem set: 0 solved, 2393 unsolved
Search for dead transitions found 0 dead transitions in 61894ms
Finished structural reductions in LTL mode , in 1 iterations and 71933 ms. Remains : 1605/1605 places, 2394/2394 transitions.
Treatment of property ASLink-PT-08a-LTLCardinality-00 finished in 321166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G((!p1||G(p2)))))))'
Support contains 4 out of 1607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 2394/2394 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1606 transition count 2393
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1606 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1605 transition count 2392
Applied a total of 4 rules in 344 ms. Remains 1605 /1607 variables (removed 2) and now considering 2392/2394 (removed 2) transitions.
// Phase 1: matrix 2392 rows 1605 cols
[2024-06-01 05:52:07] [INFO ] Computed 219 invariants in 38 ms
[2024-06-01 05:52:09] [INFO ] Implicit Places using invariants in 1817 ms returned [391, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1819 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1607 places, 2392/2394 transitions.
Applied a total of 0 rules in 75 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2239 ms. Remains : 1603/1607 places, 2392/2394 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), true, (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2256 steps with 10 reset in 30 ms.
FORMULA ASLink-PT-08a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLCardinality-01 finished in 2575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(!p1)) U X(((p3 U p0)||p2))))'
Support contains 6 out of 1607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 2394/2394 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1606 transition count 2393
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1606 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1605 transition count 2392
Applied a total of 4 rules in 308 ms. Remains 1605 /1607 variables (removed 2) and now considering 2392/2394 (removed 2) transitions.
[2024-06-01 05:52:10] [INFO ] Invariant cache hit.
[2024-06-01 05:52:11] [INFO ] Implicit Places using invariants in 1327 ms returned [754]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1329 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1604/1607 places, 2392/2394 transitions.
Applied a total of 0 rules in 69 ms. Remains 1604 /1604 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1707 ms. Remains : 1604/1607 places, 2392/2394 transitions.
Stuttering acceptance computed with spot in 409 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), p1, (AND (NOT p0) p1)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 1545 ms.
Product exploration explored 100000 steps with 50000 reset in 1261 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p3), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (NOT (AND p1 (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 27 factoid took 31 ms. Reduced automaton from 7 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-08a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-08a-LTLCardinality-05 finished in 4999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 2394/2394 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1606 transition count 2393
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1606 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1605 transition count 2392
Applied a total of 4 rules in 269 ms. Remains 1605 /1607 variables (removed 2) and now considering 2392/2394 (removed 2) transitions.
[2024-06-01 05:52:15] [INFO ] Invariant cache hit.
[2024-06-01 05:52:17] [INFO ] Implicit Places using invariants in 2229 ms returned [391, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2235 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1607 places, 2392/2394 transitions.
Applied a total of 0 rules in 109 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2616 ms. Remains : 1603/1607 places, 2392/2394 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-11
Product exploration explored 100000 steps with 499 reset in 607 ms.
Product exploration explored 100000 steps with 487 reset in 493 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (181 resets) in 350 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (18 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 201385 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 201385 steps, saw 71726 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 2392 rows 1603 cols
[2024-06-01 05:52:21] [INFO ] Computed 217 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 609/675 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 920/1595 variables, 167/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1595 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1603 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1603 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2392/3995 variables, 1603/1820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3995 variables, 0/1820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3995 variables, 0/1820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3995/3995 variables, and 1820 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1889 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 168/168 constraints, State Equation: 1603/1603 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 609/675 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:52:24] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:52:24] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/675 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 920/1595 variables, 167/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1595 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/1603 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1603 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3995/3995 variables, and 1822 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3008 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 168/168 constraints, State Equation: 1603/1603 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 4934ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 861 ms.
Support contains 2 out of 1603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1603/1603 places, 2392/2392 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 317 transitions
Trivial Post-agglo rules discarded 317 transitions
Performed 317 trivial Post agglomeration. Transition count delta: 317
Iterating post reduction 0 with 317 rules applied. Total rules applied 317 place count 1603 transition count 2075
Reduce places removed 317 places and 0 transitions.
Iterating post reduction 1 with 317 rules applied. Total rules applied 634 place count 1286 transition count 2075
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 215 Pre rules applied. Total rules applied 634 place count 1286 transition count 1860
Deduced a syphon composed of 215 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 2 with 499 rules applied. Total rules applied 1133 place count 1002 transition count 1860
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 21 rules applied. Total rules applied 1154 place count 990 transition count 1851
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1163 place count 981 transition count 1851
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 1163 place count 981 transition count 1819
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 1227 place count 949 transition count 1819
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1232 place count 944 transition count 1814
Iterating global reduction 4 with 5 rules applied. Total rules applied 1237 place count 944 transition count 1814
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 1241 place count 944 transition count 1810
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1242 place count 943 transition count 1810
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1242 place count 943 transition count 1809
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1244 place count 942 transition count 1809
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 6 with 174 rules applied. Total rules applied 1418 place count 855 transition count 1722
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1426 place count 855 transition count 1714
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1434 place count 847 transition count 1714
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1466 place count 847 transition count 1682
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 1499 place count 814 transition count 1682
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1507 place count 814 transition count 1674
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 8 with 25 rules applied. Total rules applied 1532 place count 814 transition count 1674
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1533 place count 813 transition count 1673
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1541 place count 805 transition count 1673
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 1541 place count 805 transition count 1657
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 1581 place count 781 transition count 1657
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 1589 place count 773 transition count 1649
Iterating global reduction 9 with 8 rules applied. Total rules applied 1597 place count 773 transition count 1649
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1605 place count 773 transition count 1641
Applied a total of 1605 rules in 410 ms. Remains 773 /1603 variables (removed 830) and now considering 1641/2392 (removed 751) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 773/1603 places, 1641/2392 transitions.
RANDOM walk for 40000 steps (622 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (90 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 274403 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 274403 steps, saw 77852 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
// Phase 1: matrix 1641 rows 773 cols
[2024-06-01 05:52:31] [INFO ] Computed 119 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/98 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/127 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/265 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/287 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 150/437 variables, 24/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/469 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/469 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/629 variables, 21/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/629 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 25/654 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/654 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 94/748 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/748 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/753 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/753 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/754 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/754 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 19/773 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/773 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1641/2414 variables, 773/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2414 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2414 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2414/2414 variables, and 892 constraints, problems are : Problem set: 0 solved, 1 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 773/773 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/98 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/127 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/265 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/287 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 150/437 variables, 24/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/469 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/469 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/629 variables, 21/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/629 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 25/654 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/654 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 94/748 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/748 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/753 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/753 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/754 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/754 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 19/773 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/773 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1641/2414 variables, 773/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2414 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2414 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/2414 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2414/2414 variables, and 893 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1631 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 773/773 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2631ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 2 out of 773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 773/773 places, 1641/1641 transitions.
Applied a total of 0 rules in 44 ms. Remains 773 /773 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 773/773 places, 1641/1641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 773/773 places, 1641/1641 transitions.
Applied a total of 0 rules in 44 ms. Remains 773 /773 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
[2024-06-01 05:52:34] [INFO ] Invariant cache hit.
[2024-06-01 05:52:35] [INFO ] Implicit Places using invariants in 1554 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 349, 355, 358, 360, 361, 366, 367, 419, 437, 443, 446, 448, 449, 454, 455, 507, 524, 530, 533, 535, 536, 541, 542, 594, 611, 617, 620, 622, 623, 628, 629, 681, 698, 704, 707, 709, 710]
[2024-06-01 05:52:35] [INFO ] Actually due to overlaps returned [187, 274, 361, 449, 536, 623, 710, 88, 94, 99, 175, 181, 186, 262, 268, 273, 349, 355, 360, 437, 443, 448, 524, 530, 535, 611, 617, 622, 698, 704, 709, 71, 100, 158, 245, 332, 419, 507, 594, 681]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1561 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 733/773 places, 1641/1641 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 700 transition count 1608
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 700 transition count 1608
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 692 transition count 1600
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 692 transition count 1600
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 114 place count 676 transition count 1584
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 138 place count 676 transition count 1560
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 162 place count 652 transition count 1560
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 170 place count 652 transition count 1552
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 178 place count 644 transition count 1552
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 644 transition count 1552
Applied a total of 179 rules in 298 ms. Remains 644 /733 variables (removed 89) and now considering 1552/1641 (removed 89) transitions.
// Phase 1: matrix 1552 rows 644 cols
[2024-06-01 05:52:35] [INFO ] Computed 79 invariants in 24 ms
[2024-06-01 05:52:37] [INFO ] Implicit Places using invariants in 1439 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 373, 374, 444, 445, 515, 516]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1442 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 630/773 places, 1552/1641 transitions.
Applied a total of 0 rules in 42 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3396 ms. Remains : 630/773 places, 1552/1641 transitions.
RANDOM walk for 40000 steps (660 resets) in 387 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (111 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 206242 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 206242 steps, saw 129462 distinct states, run finished after 3005 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 1552 rows 630 cols
[2024-06-01 05:52:40] [INFO ] Computed 65 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/88 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/313 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/324 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/337 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/370 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 211/581 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/603 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 27/630 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1552/2182 variables, 630/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2182 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2182 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2182/2182 variables, and 695 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/88 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/313 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/324 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/337 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/370 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 211/581 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/603 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 27/630 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1552/2182 variables, 630/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2182 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2182 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2182 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2182/2182 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2432ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1552/1552 transitions.
Applied a total of 0 rules in 66 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 630/630 places, 1552/1552 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1552/1552 transitions.
Applied a total of 0 rules in 25 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
[2024-06-01 05:52:43] [INFO ] Invariant cache hit.
[2024-06-01 05:52:44] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2024-06-01 05:52:44] [INFO ] Invariant cache hit.
[2024-06-01 05:52:47] [INFO ] Implicit Places using invariants and state equation in 2846 ms returned []
Implicit Place search using SMT with State Equation took 3856 ms to find 0 implicit places.
[2024-06-01 05:52:47] [INFO ] Redundant transitions in 79 ms returned []
Running 1514 sub problems to find dead transitions.
[2024-06-01 05:52:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/2182 variables, and 60 constraints, problems are : Problem set: 0 solved, 1514 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 48/50 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 1514/1514 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1514 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/2182 variables, and 60 constraints, problems are : Problem set: 0 solved, 1514 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 48/50 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 0/1514 constraints, Known Traps: 0/0 constraints]
After SMT, in 61709ms problems are : Problem set: 0 solved, 1514 unsolved
Search for dead transitions found 0 dead transitions in 61735ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65709 ms. Remains : 630/630 places, 1552/1552 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 42 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 05:53:48] [INFO ] Invariant cache hit.
[2024-06-01 05:53:49] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 05:53:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 05:53:49] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 49 ms returned sat
[2024-06-01 05:53:50] [INFO ] After 993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 05:53:50] [INFO ] After 1140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 05:53:50] [INFO ] After 1478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1730 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Support contains 2 out of 1603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1603/1603 places, 2392/2392 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 317 transitions
Trivial Post-agglo rules discarded 317 transitions
Performed 317 trivial Post agglomeration. Transition count delta: 317
Iterating post reduction 0 with 317 rules applied. Total rules applied 317 place count 1602 transition count 2074
Reduce places removed 325 places and 0 transitions.
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 1 with 333 rules applied. Total rules applied 650 place count 1277 transition count 2066
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 658 place count 1269 transition count 2066
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 231 Pre rules applied. Total rules applied 658 place count 1269 transition count 1835
Deduced a syphon composed of 231 places in 3 ms
Ensure Unique test removed 69 places
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 3 with 531 rules applied. Total rules applied 1189 place count 969 transition count 1835
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 3 with 46 rules applied. Total rules applied 1235 place count 948 transition count 1810
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 1260 place count 923 transition count 1810
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 1260 place count 923 transition count 1777
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 1326 place count 890 transition count 1777
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1339 place count 877 transition count 1764
Iterating global reduction 5 with 13 rules applied. Total rules applied 1352 place count 877 transition count 1764
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 12 rules applied. Total rules applied 1364 place count 877 transition count 1752
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1365 place count 876 transition count 1752
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1365 place count 876 transition count 1751
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1367 place count 875 transition count 1751
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 7 with 158 rules applied. Total rules applied 1525 place count 796 transition count 1672
Applied a total of 1525 rules in 344 ms. Remains 796 /1603 variables (removed 807) and now considering 1672/2392 (removed 720) transitions.
// Phase 1: matrix 1672 rows 796 cols
[2024-06-01 05:53:51] [INFO ] Computed 119 invariants in 28 ms
[2024-06-01 05:53:52] [INFO ] Implicit Places using invariants in 1612 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 447, 453, 458, 460, 520, 537, 543, 548, 550, 610, 627, 633, 638, 640, 700, 717, 723, 728, 730, 793]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1615 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 756/1603 places, 1672/2392 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 0 with 1 rules applied. Total rules applied 1 place count 756 transition count 1671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 755 transition count 1671
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 739 transition count 1655
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 739 transition count 1655
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 723 transition count 1639
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 723 transition count 1639
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 715 transition count 1631
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 715 transition count 1631
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 114 place count 699 transition count 1615
Applied a total of 114 rules in 210 ms. Remains 699 /756 variables (removed 57) and now considering 1615/1672 (removed 57) transitions.
// Phase 1: matrix 1615 rows 699 cols
[2024-06-01 05:53:53] [INFO ] Computed 79 invariants in 24 ms
[2024-06-01 05:53:54] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2024-06-01 05:53:54] [INFO ] Invariant cache hit.
[2024-06-01 05:53:57] [INFO ] Implicit Places using invariants and state equation in 3220 ms returned []
Implicit Place search using SMT with State Equation took 4490 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 699/1603 places, 1615/2392 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6662 ms. Remains : 699/1603 places, 1615/2392 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (500 resets) in 388 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (85 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 214587 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 214587 steps, saw 128031 distinct states, run finished after 3004 ms. (steps per millisecond=71 ) properties seen :0
[2024-06-01 05:54:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/89 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 256/345 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/357 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 253/610 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 52/662 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 37/699 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1615/2314 variables, 699/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2314 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2314 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2314/2314 variables, and 778 constraints, problems are : Problem set: 0 solved, 1 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 699/699 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/89 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 256/345 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/357 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 253/610 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 52/662 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 37/699 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1615/2314 variables, 699/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2314 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:54:02] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2314 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2314 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2314 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2314/2314 variables, and 780 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1178 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 699/699 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2018ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 115 ms.
Support contains 2 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1615/1615 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 699 transition count 1583
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 72 place count 667 transition count 1575
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 667 transition count 1552
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 118 place count 644 transition count 1552
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 644 transition count 1552
Applied a total of 119 rules in 137 ms. Remains 644 /699 variables (removed 55) and now considering 1552/1615 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 644/699 places, 1552/1615 transitions.
RANDOM walk for 40000 steps (660 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (117 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 206999 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 206999 steps, saw 108858 distinct states, run finished after 3004 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 1552 rows 644 cols
[2024-06-01 05:54:06] [INFO ] Computed 79 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/74 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/290 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/297 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 241/538 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/576 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/644 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/644 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1552/2196 variables, 644/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2196 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2196 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2196/2196 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/74 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/290 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/297 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 241/538 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/576 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:54:07] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/644 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/644 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1552/2196 variables, 644/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2196 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2196 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2196 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2196/2196 variables, and 725 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1782ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 2 out of 644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 1552/1552 transitions.
Applied a total of 0 rules in 27 ms. Remains 644 /644 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 644/644 places, 1552/1552 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 1552/1552 transitions.
Applied a total of 0 rules in 64 ms. Remains 644 /644 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
[2024-06-01 05:54:08] [INFO ] Invariant cache hit.
[2024-06-01 05:54:09] [INFO ] Implicit Places using invariants in 914 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 373, 374, 444, 445, 515, 516]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 920 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 630/644 places, 1552/1552 transitions.
Applied a total of 0 rules in 26 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1012 ms. Remains : 630/644 places, 1552/1552 transitions.
RANDOM walk for 40000 steps (687 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (111 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 213658 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 213658 steps, saw 111609 distinct states, run finished after 3005 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 1552 rows 630 cols
[2024-06-01 05:54:12] [INFO ] Computed 65 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/88 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/313 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/324 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/337 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/370 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 211/581 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/603 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 27/630 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1552/2182 variables, 630/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2182 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2182 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2182/2182 variables, and 695 constraints, problems are : Problem set: 0 solved, 1 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/88 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/313 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/324 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/337 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/370 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 211/581 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/603 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 27/630 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1552/2182 variables, 630/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2182 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2182 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2182 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2182/2182 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1137 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1946ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 2 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1552/1552 transitions.
Applied a total of 0 rules in 26 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 630/630 places, 1552/1552 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1552/1552 transitions.
Applied a total of 0 rules in 25 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
[2024-06-01 05:54:14] [INFO ] Invariant cache hit.
[2024-06-01 05:54:14] [INFO ] Implicit Places using invariants in 734 ms returned []
[2024-06-01 05:54:14] [INFO ] Invariant cache hit.
[2024-06-01 05:54:16] [INFO ] Implicit Places using invariants and state equation in 1964 ms returned []
Implicit Place search using SMT with State Equation took 2700 ms to find 0 implicit places.
[2024-06-01 05:54:16] [INFO ] Redundant transitions in 42 ms returned []
Running 1514 sub problems to find dead transitions.
[2024-06-01 05:54:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/2182 variables, and 60 constraints, problems are : Problem set: 0 solved, 1514 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 48/50 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 1514/1514 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1514 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/2182 variables, and 60 constraints, problems are : Problem set: 0 solved, 1514 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 48/50 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 0/1514 constraints, Known Traps: 0/0 constraints]
After SMT, in 61099ms problems are : Problem set: 0 solved, 1514 unsolved
Search for dead transitions found 0 dead transitions in 61114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63895 ms. Remains : 630/630 places, 1552/1552 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 26 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 05:55:18] [INFO ] Invariant cache hit.
[2024-06-01 05:55:18] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 05:55:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 05:55:18] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 31 ms returned sat
[2024-06-01 05:55:19] [INFO ] After 720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 05:55:19] [INFO ] After 810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 05:55:19] [INFO ] After 1036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1206 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1323 reset in 294 ms.
Product exploration explored 100000 steps with 1293 reset in 410 ms.
Support contains 2 out of 699 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 699/699 places, 1615/1615 transitions.
Applied a total of 0 rules in 30 ms. Remains 699 /699 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
// Phase 1: matrix 1615 rows 699 cols
[2024-06-01 05:55:20] [INFO ] Computed 79 invariants in 17 ms
[2024-06-01 05:55:21] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2024-06-01 05:55:21] [INFO ] Invariant cache hit.
[2024-06-01 05:55:23] [INFO ] Implicit Places using invariants and state equation in 2033 ms returned []
Implicit Place search using SMT with State Equation took 3131 ms to find 0 implicit places.
[2024-06-01 05:55:23] [INFO ] Redundant transitions in 45 ms returned []
Running 1569 sub problems to find dead transitions.
[2024-06-01 05:55:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/698 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/698 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 698/2314 variables, and 75 constraints, problems are : Problem set: 0 solved, 1569 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 65/66 constraints, State Equation: 0/699 constraints, PredecessorRefiner: 1569/1569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/698 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/698 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/2314 variables, and 75 constraints, problems are : Problem set: 0 solved, 1569 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 65/66 constraints, State Equation: 0/699 constraints, PredecessorRefiner: 0/1569 constraints, Known Traps: 0/0 constraints]
After SMT, in 61053ms problems are : Problem set: 0 solved, 1569 unsolved
Search for dead transitions found 0 dead transitions in 61070ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64287 ms. Remains : 699/699 places, 1615/1615 transitions.
Treatment of property ASLink-PT-08a-LTLCardinality-11 finished in 249949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 2394/2394 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1606 transition count 2393
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1606 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1605 transition count 2392
Applied a total of 4 rules in 221 ms. Remains 1605 /1607 variables (removed 2) and now considering 2392/2394 (removed 2) transitions.
// Phase 1: matrix 2392 rows 1605 cols
[2024-06-01 05:56:24] [INFO ] Computed 219 invariants in 24 ms
[2024-06-01 05:56:26] [INFO ] Implicit Places using invariants in 1281 ms returned [391]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1293 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1604/1607 places, 2392/2394 transitions.
Applied a total of 0 rules in 69 ms. Remains 1604 /1604 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1585 ms. Remains : 1604/1607 places, 2392/2394 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-12
Stuttering criterion allowed to conclude after 287 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-08a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLCardinality-12 finished in 1682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(G(F(p0)))||!(p0 U p1)))))'
Support contains 4 out of 1607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1607/1607 places, 2394/2394 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1606 transition count 2393
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1606 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1605 transition count 2392
Applied a total of 4 rules in 204 ms. Remains 1605 /1607 variables (removed 2) and now considering 2392/2394 (removed 2) transitions.
[2024-06-01 05:56:26] [INFO ] Invariant cache hit.
[2024-06-01 05:56:28] [INFO ] Implicit Places using invariants in 1496 ms returned [391, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1499 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1607 places, 2392/2394 transitions.
Applied a total of 0 rules in 68 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1772 ms. Remains : 1603/1607 places, 2392/2394 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-13
Stuttering criterion allowed to conclude after 2048 steps with 9 reset in 9 ms.
FORMULA ASLink-PT-08a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLCardinality-13 finished in 2031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((p1||G(p2))))&&p0)))'
Support contains 5 out of 1607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1607/1607 places, 2394/2394 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 310 place count 1606 transition count 2083
Reduce places removed 318 places and 0 transitions.
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 1 with 326 rules applied. Total rules applied 636 place count 1288 transition count 2075
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 644 place count 1280 transition count 2075
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 221 Pre rules applied. Total rules applied 644 place count 1280 transition count 1854
Deduced a syphon composed of 221 places in 2 ms
Ensure Unique test removed 68 places
Reduce places removed 289 places and 0 transitions.
Iterating global reduction 3 with 510 rules applied. Total rules applied 1154 place count 991 transition count 1854
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 54 rules applied. Total rules applied 1208 place count 970 transition count 1821
Reduce places removed 35 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 39 rules applied. Total rules applied 1247 place count 935 transition count 1817
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1251 place count 931 transition count 1817
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 1251 place count 931 transition count 1785
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 1315 place count 899 transition count 1785
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1329 place count 885 transition count 1771
Iterating global reduction 6 with 14 rules applied. Total rules applied 1343 place count 885 transition count 1771
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 6 with 12 rules applied. Total rules applied 1355 place count 885 transition count 1759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1356 place count 884 transition count 1759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1356 place count 884 transition count 1758
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1358 place count 883 transition count 1758
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 8 with 158 rules applied. Total rules applied 1516 place count 804 transition count 1679
Applied a total of 1516 rules in 198 ms. Remains 804 /1607 variables (removed 803) and now considering 1679/2394 (removed 715) transitions.
// Phase 1: matrix 1679 rows 804 cols
[2024-06-01 05:56:28] [INFO ] Computed 120 invariants in 17 ms
[2024-06-01 05:56:29] [INFO ] Implicit Places using invariants in 1106 ms returned [74, 91, 97, 102, 161, 179, 185, 190, 192, 252, 269, 275, 280, 282, 342, 359, 365, 370, 372, 432, 449, 455, 460, 462, 522, 539, 548, 553, 555, 615, 633, 639, 644, 646, 706, 723, 729, 734, 738, 801]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1112 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 764/1607 places, 1679/2394 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 0 with 1 rules applied. Total rules applied 1 place count 764 transition count 1678
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 763 transition count 1678
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 17 place count 748 transition count 1663
Iterating global reduction 2 with 15 rules applied. Total rules applied 32 place count 748 transition count 1663
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 47 place count 733 transition count 1648
Iterating global reduction 2 with 15 rules applied. Total rules applied 62 place count 733 transition count 1648
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 69 place count 726 transition count 1641
Iterating global reduction 2 with 7 rules applied. Total rules applied 76 place count 726 transition count 1641
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 108 place count 710 transition count 1625
Applied a total of 108 rules in 130 ms. Remains 710 /764 variables (removed 54) and now considering 1625/1679 (removed 54) transitions.
// Phase 1: matrix 1625 rows 710 cols
[2024-06-01 05:56:29] [INFO ] Computed 80 invariants in 16 ms
[2024-06-01 05:56:30] [INFO ] Implicit Places using invariants in 895 ms returned []
[2024-06-01 05:56:30] [INFO ] Invariant cache hit.
[2024-06-01 05:56:32] [INFO ] Implicit Places using invariants and state equation in 2058 ms returned []
Implicit Place search using SMT with State Equation took 2969 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 710/1607 places, 1625/2394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4412 ms. Remains : 710/1607 places, 1625/2394 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-15
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLCardinality-15 finished in 4614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(p0) U p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : ASLink-PT-08a-LTLCardinality-11
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1607 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1607/1607 places, 2394/2394 transitions.
Reduce places removed 1 places and 1 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 1606 transition count 2078
Reduce places removed 323 places and 0 transitions.
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 1 with 331 rules applied. Total rules applied 646 place count 1283 transition count 2070
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 654 place count 1275 transition count 2070
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 223 Pre rules applied. Total rules applied 654 place count 1275 transition count 1847
Deduced a syphon composed of 223 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 515 rules applied. Total rules applied 1169 place count 983 transition count 1847
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 54 rules applied. Total rules applied 1223 place count 962 transition count 1814
Reduce places removed 35 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 39 rules applied. Total rules applied 1262 place count 927 transition count 1810
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1266 place count 923 transition count 1810
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 1266 place count 923 transition count 1777
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 1332 place count 890 transition count 1777
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1346 place count 876 transition count 1763
Iterating global reduction 6 with 14 rules applied. Total rules applied 1360 place count 876 transition count 1763
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 6 with 12 rules applied. Total rules applied 1372 place count 876 transition count 1751
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1373 place count 875 transition count 1751
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1373 place count 875 transition count 1750
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1375 place count 874 transition count 1750
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 8 with 156 rules applied. Total rules applied 1531 place count 796 transition count 1672
Applied a total of 1531 rules in 210 ms. Remains 796 /1607 variables (removed 811) and now considering 1672/2394 (removed 722) transitions.
// Phase 1: matrix 1672 rows 796 cols
[2024-06-01 05:56:33] [INFO ] Computed 119 invariants in 17 ms
[2024-06-01 05:56:34] [INFO ] Implicit Places using invariants in 1124 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 447, 453, 458, 460, 520, 537, 543, 548, 550, 610, 627, 633, 638, 640, 700, 717, 723, 728, 730, 793]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1127 ms to find 40 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 756/1607 places, 1672/2394 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 0 with 1 rules applied. Total rules applied 1 place count 756 transition count 1671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 755 transition count 1671
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 739 transition count 1655
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 739 transition count 1655
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 723 transition count 1639
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 723 transition count 1639
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 715 transition count 1631
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 715 transition count 1631
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 114 place count 699 transition count 1615
Applied a total of 114 rules in 130 ms. Remains 699 /756 variables (removed 57) and now considering 1615/1672 (removed 57) transitions.
// Phase 1: matrix 1615 rows 699 cols
[2024-06-01 05:56:34] [INFO ] Computed 79 invariants in 16 ms
[2024-06-01 05:56:35] [INFO ] Implicit Places using invariants in 935 ms returned []
[2024-06-01 05:56:35] [INFO ] Invariant cache hit.
[2024-06-01 05:56:37] [INFO ] Implicit Places using invariants and state equation in 2233 ms returned []
Implicit Place search using SMT with State Equation took 3187 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 699/1607 places, 1615/2394 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4657 ms. Remains : 699/1607 places, 1615/2394 transitions.
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-11
Product exploration explored 100000 steps with 1279 reset in 349 ms.
Product exploration explored 100000 steps with 1323 reset in 452 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (509 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (84 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 209909 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 209909 steps, saw 126444 distinct states, run finished after 3004 ms. (steps per millisecond=69 ) properties seen :0
[2024-06-01 05:56:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/89 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 256/345 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/357 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 253/610 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 52/662 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 37/699 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1615/2314 variables, 699/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2314 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2314 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2314/2314 variables, and 778 constraints, problems are : Problem set: 0 solved, 1 unsolved in 867 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 699/699 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/89 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 256/345 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/357 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 253/610 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 52/662 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 37/699 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1615/2314 variables, 699/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2314 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:56:43] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2314 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2314 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2314 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2314/2314 variables, and 780 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 699/699 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2035ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 2 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1615/1615 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 699 transition count 1583
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 72 place count 667 transition count 1575
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 667 transition count 1552
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 118 place count 644 transition count 1552
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 644 transition count 1552
Applied a total of 119 rules in 116 ms. Remains 644 /699 variables (removed 55) and now considering 1552/1615 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 644/699 places, 1552/1615 transitions.
RANDOM walk for 40000 steps (666 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (114 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 206450 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 206450 steps, saw 108638 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 1552 rows 644 cols
[2024-06-01 05:56:47] [INFO ] Computed 79 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/74 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/290 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/297 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 241/538 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/576 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/644 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/644 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1552/2196 variables, 644/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2196 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2196 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2196/2196 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/74 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/290 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/297 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 241/538 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/576 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:56:48] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/644 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/644 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1552/2196 variables, 644/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2196 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2196 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2196 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2196/2196 variables, and 725 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1050 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1830ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 2 out of 644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 1552/1552 transitions.
Applied a total of 0 rules in 26 ms. Remains 644 /644 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 644/644 places, 1552/1552 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 1552/1552 transitions.
Applied a total of 0 rules in 27 ms. Remains 644 /644 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
[2024-06-01 05:56:49] [INFO ] Invariant cache hit.
[2024-06-01 05:56:50] [INFO ] Implicit Places using invariants in 932 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 373, 374, 444, 445, 515, 516]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 935 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 630/644 places, 1552/1552 transitions.
Applied a total of 0 rules in 26 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 989 ms. Remains : 630/644 places, 1552/1552 transitions.
RANDOM walk for 40000 steps (695 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (118 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 210245 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 210245 steps, saw 110149 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 1552 rows 630 cols
[2024-06-01 05:56:53] [INFO ] Computed 65 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/88 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/313 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/324 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/337 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/370 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 211/581 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/603 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 27/630 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1552/2182 variables, 630/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2182 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2182 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2182/2182 variables, and 695 constraints, problems are : Problem set: 0 solved, 1 unsolved in 756 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/88 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/313 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/324 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/337 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/370 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 211/581 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/603 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 27/630 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1552/2182 variables, 630/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2182 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2182 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2182 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2182/2182 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1142 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1921ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 2 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1552/1552 transitions.
Applied a total of 0 rules in 26 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 630/630 places, 1552/1552 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1552/1552 transitions.
Applied a total of 0 rules in 26 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
[2024-06-01 05:56:55] [INFO ] Invariant cache hit.
[2024-06-01 05:56:56] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-06-01 05:56:56] [INFO ] Invariant cache hit.
[2024-06-01 05:56:58] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 2737 ms to find 0 implicit places.
[2024-06-01 05:56:58] [INFO ] Redundant transitions in 43 ms returned []
Running 1514 sub problems to find dead transitions.
[2024-06-01 05:56:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/2182 variables, and 60 constraints, problems are : Problem set: 0 solved, 1514 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 48/50 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 1514/1514 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1514 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/2182 variables, and 60 constraints, problems are : Problem set: 0 solved, 1514 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 48/50 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 0/1514 constraints, Known Traps: 0/0 constraints]
After SMT, in 61042ms problems are : Problem set: 0 solved, 1514 unsolved
Search for dead transitions found 0 dead transitions in 61059ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63874 ms. Remains : 630/630 places, 1552/1552 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 26 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 05:57:59] [INFO ] Invariant cache hit.
[2024-06-01 05:57:59] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 05:57:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 05:57:59] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 32 ms returned sat
[2024-06-01 05:58:00] [INFO ] After 774ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 05:58:00] [INFO ] After 865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 05:58:00] [INFO ] After 1090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1256 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Support contains 2 out of 699 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 699/699 places, 1615/1615 transitions.
Applied a total of 0 rules in 30 ms. Remains 699 /699 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
// Phase 1: matrix 1615 rows 699 cols
[2024-06-01 05:58:00] [INFO ] Computed 79 invariants in 16 ms
[2024-06-01 05:58:01] [INFO ] Implicit Places using invariants in 919 ms returned []
[2024-06-01 05:58:01] [INFO ] Invariant cache hit.
[2024-06-01 05:58:04] [INFO ] Implicit Places using invariants and state equation in 2334 ms returned []
Implicit Place search using SMT with State Equation took 3255 ms to find 0 implicit places.
[2024-06-01 05:58:04] [INFO ] Redundant transitions in 45 ms returned []
Running 1569 sub problems to find dead transitions.
[2024-06-01 05:58:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/698 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/698 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 698/2314 variables, and 75 constraints, problems are : Problem set: 0 solved, 1569 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 65/66 constraints, State Equation: 0/699 constraints, PredecessorRefiner: 1569/1569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/698 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/698 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1569 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 698/2314 variables, and 75 constraints, problems are : Problem set: 0 solved, 1569 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 65/66 constraints, State Equation: 0/699 constraints, PredecessorRefiner: 0/1569 constraints, Known Traps: 0/0 constraints]
After SMT, in 61080ms problems are : Problem set: 0 solved, 1569 unsolved
Search for dead transitions found 0 dead transitions in 61097ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64436 ms. Remains : 699/699 places, 1615/1615 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (522 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (80 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 209265 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 209265 steps, saw 126264 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
[2024-06-01 05:59:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/89 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 256/345 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/357 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 253/610 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 52/662 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 37/699 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1615/2314 variables, 699/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2314 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2314 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2314/2314 variables, and 778 constraints, problems are : Problem set: 0 solved, 1 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 699/699 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/89 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 256/345 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/357 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 253/610 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 52/662 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 37/699 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1615/2314 variables, 699/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2314 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:59:10] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2314 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2314 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2314 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2314/2314 variables, and 780 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1143 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 699/699 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2051ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 2 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1615/1615 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 699 transition count 1583
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 72 place count 667 transition count 1575
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 667 transition count 1552
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 118 place count 644 transition count 1552
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 644 transition count 1552
Applied a total of 119 rules in 122 ms. Remains 644 /699 variables (removed 55) and now considering 1552/1615 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 644/699 places, 1552/1615 transitions.
RANDOM walk for 40000 steps (697 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (111 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 204147 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 204147 steps, saw 107696 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 1552 rows 644 cols
[2024-06-01 05:59:13] [INFO ] Computed 79 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/74 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/290 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/297 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 241/538 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/576 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/644 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/644 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1552/2196 variables, 644/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2196 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2196 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2196/2196 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/74 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/290 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/297 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 241/538 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/576 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:59:14] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/644 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/644 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1552/2196 variables, 644/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2196 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2196 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2196 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2196/2196 variables, and 725 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1776ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 2 out of 644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 1552/1552 transitions.
Applied a total of 0 rules in 26 ms. Remains 644 /644 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 644/644 places, 1552/1552 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 1552/1552 transitions.
Applied a total of 0 rules in 26 ms. Remains 644 /644 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
[2024-06-01 05:59:15] [INFO ] Invariant cache hit.
[2024-06-01 05:59:16] [INFO ] Implicit Places using invariants in 796 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 373, 374, 444, 445, 515, 516]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 801 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 630/644 places, 1552/1552 transitions.
Applied a total of 0 rules in 26 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 853 ms. Remains : 630/644 places, 1552/1552 transitions.
RANDOM walk for 40000 steps (686 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (113 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 211415 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 211415 steps, saw 110696 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 1552 rows 630 cols
[2024-06-01 05:59:19] [INFO ] Computed 65 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/88 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/313 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/324 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/337 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/370 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 211/581 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/603 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 27/630 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1552/2182 variables, 630/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2182 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2182 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2182/2182 variables, and 695 constraints, problems are : Problem set: 0 solved, 1 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/88 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/313 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/324 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/337 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/370 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 211/581 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/603 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 27/630 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1552/2182 variables, 630/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2182 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2182 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2182 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2182/2182 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1137 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1921ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 2 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1552/1552 transitions.
Applied a total of 0 rules in 25 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 630/630 places, 1552/1552 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1552/1552 transitions.
Applied a total of 0 rules in 25 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
[2024-06-01 05:59:21] [INFO ] Invariant cache hit.
[2024-06-01 05:59:22] [INFO ] Implicit Places using invariants in 794 ms returned []
[2024-06-01 05:59:22] [INFO ] Invariant cache hit.
[2024-06-01 05:59:24] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
[2024-06-01 05:59:24] [INFO ] Redundant transitions in 42 ms returned []
Running 1514 sub problems to find dead transitions.
[2024-06-01 05:59:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/2182 variables, and 60 constraints, problems are : Problem set: 0 solved, 1514 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 48/50 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 1514/1514 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1514 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1514 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/2182 variables, and 60 constraints, problems are : Problem set: 0 solved, 1514 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 48/50 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 0/1514 constraints, Known Traps: 0/0 constraints]
After SMT, in 61085ms problems are : Problem set: 0 solved, 1514 unsolved
Search for dead transitions found 0 dead transitions in 61101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63852 ms. Remains : 630/630 places, 1552/1552 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 25 ms. Remains 630 /630 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 06:00:25] [INFO ] Invariant cache hit.
[2024-06-01 06:00:25] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:00:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 06:00:25] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 32 ms returned sat
[2024-06-01 06:00:26] [INFO ] After 769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:00:26] [INFO ] After 860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:00:26] [INFO ] After 1074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1238 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1261 reset in 313 ms.
Product exploration explored 100000 steps with 1274 reset in 341 ms.
Support contains 2 out of 699 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 699/699 places, 1615/1615 transitions.
Applied a total of 0 rules in 28 ms. Remains 699 /699 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
// Phase 1: matrix 1615 rows 699 cols
[2024-06-01 06:00:27] [INFO ] Computed 79 invariants in 16 ms
[2024-06-01 06:00:28] [INFO ] Implicit Places using invariants in 907 ms returned []
[2024-06-01 06:00:28] [INFO ] Invariant cache hit.
[2024-06-01 06:00:30] [INFO ] Implicit Places using invariants and state equation in 2309 ms returned []
Implicit Place search using SMT with State Equation took 3223 ms to find 0 implicit places.
[2024-06-01 06:00:31] [INFO ] Redundant transitions in 44 ms returned []
Running 1569 sub problems to find dead transitions.
[2024-06-01 06:00:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/698 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/698 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 698/2314 variables, and 75 constraints, problems are : Problem set: 0 solved, 1569 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 65/66 constraints, State Equation: 0/699 constraints, PredecessorRefiner: 1569/1569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/698 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/698 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/2314 variables, and 75 constraints, problems are : Problem set: 0 solved, 1569 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 65/66 constraints, State Equation: 0/699 constraints, PredecessorRefiner: 0/1569 constraints, Known Traps: 0/0 constraints]
After SMT, in 61047ms problems are : Problem set: 0 solved, 1569 unsolved
Search for dead transitions found 0 dead transitions in 61063ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64372 ms. Remains : 699/699 places, 1615/1615 transitions.
Treatment of property ASLink-PT-08a-LTLCardinality-11 finished in 299027 ms.
[2024-06-01 06:01:32] [INFO ] Flatten gal took : 101 ms
[2024-06-01 06:01:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 06:01:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1607 places, 2394 transitions and 8330 arcs took 45 ms.
Total runtime 1048958 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ASLink-PT-08a-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ASLink-PT-08a-LTLCardinality-11

BK_STOP 1717222934633

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ASLink-PT-08a-LTLCardinality-00
ltl formula formula --ltl=/tmp/1640/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1607 places, 2394 transitions and 8330 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.090 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1640/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1640/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1640/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1640/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1609 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1608, there are 2427 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~5 levels ~10000 states ~20736 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 14498
pnml2lts-mc( 0/ 4): unique states count: 14498
pnml2lts-mc( 0/ 4): unique transitions count: 39264
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 25759
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 14637
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14637 states 42009 transitions, fanout: 2.870
pnml2lts-mc( 0/ 4): Total exploration time 2.310 sec (2.310 sec minimum, 2.310 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6336, Transitions per second: 18186
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 12.2 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2451 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ASLink-PT-08a-LTLCardinality-11
ltl formula formula --ltl=/tmp/1640/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1607 places, 2394 transitions and 8330 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.100 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1640/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1640/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1640/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1640/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1609 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1608, there are 2402 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~249 levels ~10000 states ~41432 transitions
pnml2lts-mc( 1/ 4): ~249 levels ~20000 states ~83076 transitions
pnml2lts-mc( 1/ 4): ~249 levels ~40000 states ~178468 transitions
pnml2lts-mc( 1/ 4): ~249 levels ~80000 states ~375684 transitions
pnml2lts-mc( 1/ 4): ~249 levels ~160000 states ~818832 transitions
pnml2lts-mc( 1/ 4): ~249 levels ~320000 states ~1793856 transitions
pnml2lts-mc( 1/ 4): ~249 levels ~640000 states ~3753764 transitions
pnml2lts-mc( 1/ 4): ~249 levels ~1280000 states ~7830832 transitions
pnml2lts-mc( 1/ 4): ~249 levels ~2560000 states ~17137728 transitions
pnml2lts-mc( 3/ 4): ~448 levels ~5120000 states ~29324840 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7779921
pnml2lts-mc( 0/ 4): unique states count: 8233303
pnml2lts-mc( 0/ 4): unique transitions count: 52375110
pnml2lts-mc( 0/ 4): - self-loop count: 375
pnml2lts-mc( 0/ 4): - claim dead count: 42842255
pnml2lts-mc( 0/ 4): - claim found count: 272459
pnml2lts-mc( 0/ 4): - claim success count: 8233310
pnml2lts-mc( 0/ 4): - cum. max stack depth: 453441
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8233310 states 52375291 transitions, fanout: 6.361
pnml2lts-mc( 0/ 4): Total exploration time 1237.310 sec (1237.270 sec minimum, 1237.288 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6654, Transitions per second: 42330
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 134.6MB, 15.2 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 27.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2451 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 134.6MB (~256.0MB paged-in)

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-08a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-08a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117900123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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