About the Execution of LTSMin+red for ASLink-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2779.287 | 3600000.00 | 12741869.00 | 2177.30 | F?F?TFTFFFFF?FFF | normal |
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-171620117900155.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-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117900155
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.2K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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 920K 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-10a-LTLCardinality-00
FORMULA_NAME ASLink-PT-10a-LTLCardinality-01
FORMULA_NAME ASLink-PT-10a-LTLCardinality-02
FORMULA_NAME ASLink-PT-10a-LTLCardinality-03
FORMULA_NAME ASLink-PT-10a-LTLCardinality-04
FORMULA_NAME ASLink-PT-10a-LTLCardinality-05
FORMULA_NAME ASLink-PT-10a-LTLCardinality-06
FORMULA_NAME ASLink-PT-10a-LTLCardinality-07
FORMULA_NAME ASLink-PT-10a-LTLCardinality-08
FORMULA_NAME ASLink-PT-10a-LTLCardinality-09
FORMULA_NAME ASLink-PT-10a-LTLCardinality-10
FORMULA_NAME ASLink-PT-10a-LTLCardinality-11
FORMULA_NAME ASLink-PT-10a-LTLCardinality-12
FORMULA_NAME ASLink-PT-10a-LTLCardinality-13
FORMULA_NAME ASLink-PT-10a-LTLCardinality-14
FORMULA_NAME ASLink-PT-10a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717238138129
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-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:35:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:35:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:35:40] [INFO ] Load time of PNML (sax parser for PT used): 439 ms
[2024-06-01 10:35:40] [INFO ] Transformed 2186 places.
[2024-06-01 10:35:40] [INFO ] Transformed 3192 transitions.
[2024-06-01 10:35:40] [INFO ] Found NUPN structural information;
[2024-06-01 10:35:40] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 700 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 2186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2126 transition count 3158
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 75 place count 2111 transition count 3085
Ensure Unique test removed 1 places
Iterating global reduction 1 with 16 rules applied. Total rules applied 91 place count 2110 transition count 3085
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 2110 transition count 3083
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 2109 transition count 3075
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 2109 transition count 3075
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 2108 transition count 3067
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 2108 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 2107 transition count 3059
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 2107 transition count 3059
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 2106 transition count 3051
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 2106 transition count 3051
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 2105 transition count 3043
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 2105 transition count 3043
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 2104 transition count 3035
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 2104 transition count 3035
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 2103 transition count 3027
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 2103 transition count 3027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 2102 transition count 3019
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 2102 transition count 3019
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 2101 transition count 3011
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 2101 transition count 3011
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 2100 transition count 3003
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 2100 transition count 3003
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 2099 transition count 2995
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 2099 transition count 2995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 2098 transition count 2987
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 2098 transition count 2987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 2097 transition count 2979
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 2097 transition count 2979
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 2096 transition count 2971
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 2096 transition count 2971
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 2095 transition count 2963
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 2095 transition count 2963
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 2094 transition count 2955
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 2094 transition count 2955
Applied a total of 125 rules in 2714 ms. Remains 2094 /2186 variables (removed 92) and now considering 2955/3158 (removed 203) transitions.
// Phase 1: matrix 2955 rows 2094 cols
[2024-06-01 10:35:43] [INFO ] Computed 361 invariants in 183 ms
[2024-06-01 10:35:47] [INFO ] Implicit Places using invariants in 3424 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 778, 783, 784, 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, 1530, 1535, 1536, 1537, 1555, 1573, 1702, 1718, 1723, 1724, 1725, 1743, 1761, 1890, 1895, 1907, 1912, 1913, 1914, 1932, 1934, 1937, 1955, 1956, 1957, 1958, 1975, 1983, 1991, 1997, 2003, 2009, 2015, 2023, 2029, 2035, 2043]
Discarding 94 places :
Implicit Place search using SMT only with invariants took 3479 ms to find 94 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2000/2186 places, 2955/3158 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1988 transition count 2943
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1988 transition count 2943
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 1978 transition count 2933
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 1978 transition count 2933
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 1973 transition count 2928
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 1973 transition count 2928
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1971 transition count 2926
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1971 transition count 2926
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1969 transition count 2924
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1969 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1968 transition count 2923
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1968 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1967 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1967 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1966 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1966 transition count 2921
Applied a total of 68 rules in 1715 ms. Remains 1966 /2000 variables (removed 34) and now considering 2921/2955 (removed 34) transitions.
// Phase 1: matrix 2921 rows 1966 cols
[2024-06-01 10:35:48] [INFO ] Computed 267 invariants in 85 ms
[2024-06-01 10:35:50] [INFO ] Implicit Places using invariants in 1687 ms returned []
[2024-06-01 10:35:50] [INFO ] Invariant cache hit.
[2024-06-01 10:35:57] [INFO ] Implicit Places using invariants and state equation in 7203 ms returned []
Implicit Place search using SMT with State Equation took 8893 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1966/2186 places, 2921/3158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16831 ms. Remains : 1966/2186 places, 2921/3158 transitions.
Support contains 27 out of 1966 places after structural reductions.
[2024-06-01 10:35:58] [INFO ] Flatten gal took : 326 ms
[2024-06-01 10:35:58] [INFO ] Flatten gal took : 182 ms
[2024-06-01 10:35:58] [INFO ] Input system was already deterministic with 2921 transitions.
RANDOM walk for 40000 steps (166 resets) in 2973 ms. (13 steps per ms) remains 7/18 properties
BEST_FIRST walk for 40004 steps (12 resets) in 287 ms. (138 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 247 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
[2024-06-01 10:36:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 196/204 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 610/814 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/814 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1144/1958 variables, 207/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1958 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/1966 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1966 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2921/4887 variables, 1966/2233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4887 variables, 0/2233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/4887 variables, 0/2233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4887/4887 variables, and 2233 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3882 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 208/208 constraints, State Equation: 1966/1966 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 196/204 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 610/814 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/814 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1144/1958 variables, 207/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1958 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/1966 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1966 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4887/4887 variables, and 2233 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 208/208 constraints, State Equation: 1966/1966 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 8974ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6665 ms.
Support contains 8 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 2921/2921 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 1966 transition count 2532
Reduce places removed 389 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 780 place count 1577 transition count 2530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 782 place count 1575 transition count 2530
Performed 262 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 262 Pre rules applied. Total rules applied 782 place count 1575 transition count 2268
Deduced a syphon composed of 262 places in 4 ms
Ensure Unique test removed 84 places
Reduce places removed 346 places and 0 transitions.
Iterating global reduction 3 with 608 rules applied. Total rules applied 1390 place count 1229 transition count 2268
Discarding 13 places :
Implicit places reduction removed 13 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 22 rules applied. Total rules applied 1412 place count 1216 transition count 2259
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1421 place count 1207 transition count 2259
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 39 Pre rules applied. Total rules applied 1421 place count 1207 transition count 2220
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 1499 place count 1168 transition count 2220
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1504 place count 1163 transition count 2215
Iterating global reduction 5 with 5 rules applied. Total rules applied 1509 place count 1163 transition count 2215
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 1513 place count 1163 transition count 2211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1514 place count 1162 transition count 2211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1514 place count 1162 transition count 2210
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1516 place count 1161 transition count 2210
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 12 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 7 with 206 rules applied. Total rules applied 1722 place count 1058 transition count 2107
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1731 place count 1058 transition count 2098
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1740 place count 1049 transition count 2098
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 8 with 40 rules applied. Total rules applied 1780 place count 1049 transition count 2058
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 8 with 41 rules applied. Total rules applied 1821 place count 1008 transition count 2058
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 1830 place count 1008 transition count 2049
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 9 with 31 rules applied. Total rules applied 1861 place count 1008 transition count 2049
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1862 place count 1007 transition count 2048
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1872 place count 997 transition count 2048
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 20 Pre rules applied. Total rules applied 1872 place count 997 transition count 2028
Deduced a syphon composed of 20 places in 9 ms
Ensure Unique test removed 9 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 10 with 49 rules applied. Total rules applied 1921 place count 968 transition count 2028
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1930 place count 959 transition count 2019
Iterating global reduction 10 with 9 rules applied. Total rules applied 1939 place count 959 transition count 2019
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1948 place count 959 transition count 2010
Applied a total of 1948 rules in 1195 ms. Remains 959 /1966 variables (removed 1007) and now considering 2010/2921 (removed 911) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1195 ms. Remains : 959/1966 places, 2010/2921 transitions.
RANDOM walk for 40000 steps (581 resets) in 739 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (63 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (62 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (64 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (63 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 224000 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :3 out of 4
Probabilistic random walk after 224000 steps, saw 87165 distinct states, run finished after 3006 ms. (steps per millisecond=74 ) properties seen :3
// Phase 1: matrix 2010 rows 959 cols
[2024-06-01 10:36:20] [INFO ] Computed 150 invariants in 29 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) 70/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/95 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 269/364 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/387 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/551 variables, 30/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/554 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/554 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 78/632 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/632 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/635 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/635 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 92/727 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/727 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/730 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/730 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 83/813 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/813 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/817 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/817 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 81/898 variables, 14/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/898 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 6/904 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/904 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/905 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/905 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 54/959 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/959 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2010/2969 variables, 959/1109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2969 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/2969 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2969/2969 variables, and 1109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 132/132 constraints, State Equation: 959/959 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) 70/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/95 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 269/364 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/387 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/551 variables, 30/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/554 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/554 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 78/632 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/632 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/635 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/635 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 92/727 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/727 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/730 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/730 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 83/813 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/813 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/817 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/817 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 81/898 variables, 14/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/898 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 6/904 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/904 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/905 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/905 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 54/959 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/959 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2010/2969 variables, 959/1109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2969 variables, 1/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2969 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/2969 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2969/2969 variables, and 1110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2354 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 132/132 constraints, State Equation: 959/959 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3522ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 218 ms.
Support contains 2 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 2010/2010 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 959 transition count 2007
Deduced a syphon composed of 3 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 955 transition count 2007
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 954 transition count 2007
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 954 transition count 2006
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 953 transition count 2006
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 951 transition count 2004
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 951 transition count 2003
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 950 transition count 2002
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 950 transition count 2001
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 948 transition count 2001
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 947 transition count 2000
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 947 transition count 2000
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 947 transition count 1999
Applied a total of 23 rules in 279 ms. Remains 947 /959 variables (removed 12) and now considering 1999/2010 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 947/959 places, 1999/2010 transitions.
RANDOM walk for 40000 steps (569 resets) in 273 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (70 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 349978 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 349978 steps, saw 215805 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
// Phase 1: matrix 1999 rows 947 cols
[2024-06-01 10:36:27] [INFO ] Computed 147 invariants in 30 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) 70/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/95 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/370 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/400 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 146/546 variables, 28/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/550 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 83/633 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/633 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/637 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/637 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 83/720 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/720 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/724 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/724 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 82/806 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/806 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/812 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 76/888 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/888 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 5/893 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/893 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/894 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/894 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 53/947 variables, 7/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/947 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1999/2946 variables, 947/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2946 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/2946 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2946/2946 variables, and 1094 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1106 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 123/123 constraints, State Equation: 947/947 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) 70/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/95 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/370 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/400 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 146/546 variables, 28/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/550 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 83/633 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/633 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/637 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/637 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 83/720 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/720 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/724 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/724 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 82/806 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/806 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/812 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 76/888 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/888 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 5/893 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/893 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/894 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/894 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 53/947 variables, 7/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/947 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1999/2946 variables, 947/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2946 variables, 1/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2946 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/2946 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2946/2946 variables, and 1095 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2343 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 123/123 constraints, State Equation: 947/947 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3497ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 612 ms.
Support contains 2 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 1999/1999 transitions.
Applied a total of 0 rules in 47 ms. Remains 947 /947 variables (removed 0) and now considering 1999/1999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 947/947 places, 1999/1999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 1999/1999 transitions.
Applied a total of 0 rules in 49 ms. Remains 947 /947 variables (removed 0) and now considering 1999/1999 (removed 0) transitions.
[2024-06-01 10:36:31] [INFO ] Invariant cache hit.
[2024-06-01 10:36:33] [INFO ] Implicit Places using invariants in 1267 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, 611, 617, 620, 622, 623, 628, 629, 681, 698, 704, 707, 709, 710, 715, 716, 768, 785, 791, 794, 796, 797, 802, 803, 855, 872, 878, 881, 883, 884]
[2024-06-01 10:36:33] [INFO ] Actually due to overlaps returned [187, 274, 361, 448, 535, 623, 710, 797, 884, 88, 94, 99, 175, 181, 186, 262, 268, 273, 349, 355, 360, 436, 442, 447, 523, 529, 534, 611, 617, 622, 698, 704, 709, 785, 791, 796, 872, 878, 883, 71, 100, 158, 245, 332, 419, 506, 593, 681, 768, 855]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1273 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 897/947 places, 1999/1999 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 856 transition count 1958
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 856 transition count 1958
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 847 transition count 1949
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 847 transition count 1949
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 140 place count 827 transition count 1929
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 170 place count 827 transition count 1899
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 200 place count 797 transition count 1899
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 210 place count 797 transition count 1889
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 220 place count 787 transition count 1889
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 221 place count 787 transition count 1889
Applied a total of 221 rules in 274 ms. Remains 787 /897 variables (removed 110) and now considering 1889/1999 (removed 110) transitions.
// Phase 1: matrix 1889 rows 787 cols
[2024-06-01 10:36:33] [INFO ] Computed 97 invariants in 28 ms
[2024-06-01 10:36:34] [INFO ] Implicit Places using invariants in 1010 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 372, 373, 443, 444, 516, 517, 587, 588, 658, 659]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1013 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 769/947 places, 1889/1999 transitions.
Applied a total of 0 rules in 37 ms. Remains 769 /769 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2649 ms. Remains : 769/947 places, 1889/1999 transitions.
RANDOM walk for 40000 steps (631 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (89 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 209182 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 209182 steps, saw 131598 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 1889 rows 769 cols
[2024-06-01 10:36:37] [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) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/245 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/272 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 228/500 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/504 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 134/638 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/638 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/642 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/642 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/754 variables, 12/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/754 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/758 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/758 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/769 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/769 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1889/2658 variables, 769/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2658 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2658 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2658/2658 variables, and 848 constraints, problems are : Problem set: 0 solved, 1 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 769/769 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) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/245 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/272 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:36:38] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 228/500 variables, 27/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/504 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 134/638 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/638 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/642 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/642 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 112/754 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/754 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/758 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/758 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 11/769 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/769 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1889/2658 variables, 769/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2658 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2658 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2658 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2658/2658 variables, and 850 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1927 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2919ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 2 out of 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1889/1889 transitions.
Applied a total of 0 rules in 36 ms. Remains 769 /769 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 769/769 places, 1889/1889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1889/1889 transitions.
Applied a total of 0 rules in 36 ms. Remains 769 /769 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2024-06-01 10:36:40] [INFO ] Invariant cache hit.
[2024-06-01 10:36:41] [INFO ] Implicit Places using invariants in 772 ms returned []
[2024-06-01 10:36:41] [INFO ] Invariant cache hit.
[2024-06-01 10:36:44] [INFO ] Implicit Places using invariants and state equation in 2930 ms returned []
Implicit Place search using SMT with State Equation took 3705 ms to find 0 implicit places.
[2024-06-01 10:36:44] [INFO ] Redundant transitions in 150 ms returned []
Running 1843 sub problems to find dead transitions.
[2024-06-01 10:36:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2658 variables, and 73 constraints, problems are : Problem set: 0 solved, 1843 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 61/64 constraints, State Equation: 0/769 constraints, PredecessorRefiner: 1843/1843 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1843 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2658 variables, and 73 constraints, problems are : Problem set: 0 solved, 1843 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 61/64 constraints, State Equation: 0/769 constraints, PredecessorRefiner: 0/1843 constraints, Known Traps: 0/0 constraints]
After SMT, in 61849ms problems are : Problem set: 0 solved, 1843 unsolved
Search for dead transitions found 0 dead transitions in 61886ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65795 ms. Remains : 769/769 places, 1889/1889 transitions.
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' '!(G(F((p0||(X(!p1) U ((!p1&&X(!p1))||X(G(!p1))))))))'
Support contains 3 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1965 transition count 2920
Applied a total of 2 rules in 218 ms. Remains 1965 /1966 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2024-06-01 10:37:47] [INFO ] Computed 267 invariants in 34 ms
[2024-06-01 10:37:48] [INFO ] Implicit Places using invariants in 1838 ms returned []
[2024-06-01 10:37:48] [INFO ] Invariant cache hit.
[2024-06-01 10:37:57] [INFO ] Implicit Places using invariants and state equation in 8621 ms returned []
Implicit Place search using SMT with State Equation took 10461 ms to find 0 implicit places.
Running 2919 sub problems to find dead transitions.
[2024-06-01 10:37:57] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 2919/2919 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 0/2919 constraints, Known Traps: 0/0 constraints]
After SMT, in 61935ms problems are : Problem set: 0 solved, 2919 unsolved
Search for dead transitions found 0 dead transitions in 61975ms
Starting structural reductions in LTL mode, iteration 1 : 1965/1966 places, 2920/2921 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72666 ms. Remains : 1965/1966 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-00
Stuttering criterion allowed to conclude after 850 steps with 3 reset in 16 ms.
FORMULA ASLink-PT-10a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-00 finished in 73085 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((G(F(p0))&&(F(G(p1))||G(p2)))))'
Support contains 3 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1966/1966 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1965 transition count 2528
Reduce places removed 402 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 412 rules applied. Total rules applied 804 place count 1563 transition count 2518
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 814 place count 1553 transition count 2518
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 283 Pre rules applied. Total rules applied 814 place count 1553 transition count 2235
Deduced a syphon composed of 283 places in 3 ms
Ensure Unique test removed 84 places
Reduce places removed 367 places and 0 transitions.
Iterating global reduction 3 with 650 rules applied. Total rules applied 1464 place count 1186 transition count 2235
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 54 rules applied. Total rules applied 1518 place count 1161 transition count 2206
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1547 place count 1132 transition count 2206
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 1547 place count 1132 transition count 2166
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1627 place count 1092 transition count 2166
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1642 place count 1077 transition count 2151
Iterating global reduction 5 with 15 rules applied. Total rules applied 1657 place count 1077 transition count 2151
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 14 rules applied. Total rules applied 1671 place count 1077 transition count 2137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1672 place count 1076 transition count 2137
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1672 place count 1076 transition count 2136
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1674 place count 1075 transition count 2136
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 7 with 190 rules applied. Total rules applied 1864 place count 980 transition count 2041
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1865 place count 980 transition count 2041
Applied a total of 1865 rules in 386 ms. Remains 980 /1966 variables (removed 986) and now considering 2041/2921 (removed 880) transitions.
// Phase 1: matrix 2041 rows 980 cols
[2024-06-01 10:39:00] [INFO ] Computed 148 invariants in 25 ms
[2024-06-01 10:39:01] [INFO ] Implicit Places using invariants in 1440 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 459, 519, 538, 544, 549, 551, 611, 628, 634, 639, 641, 701, 718, 724, 729, 731, 791, 808, 814, 819, 821, 881, 898, 907, 912, 914, 977]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1444 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 930/1966 places, 2041/2921 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 930 transition count 2040
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 929 transition count 2040
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 21 place count 910 transition count 2021
Iterating global reduction 2 with 19 rules applied. Total rules applied 40 place count 910 transition count 2021
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 59 place count 891 transition count 2002
Iterating global reduction 2 with 19 rules applied. Total rules applied 78 place count 891 transition count 2002
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 882 transition count 1993
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 882 transition count 1993
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 136 place count 862 transition count 1973
Applied a total of 136 rules in 243 ms. Remains 862 /930 variables (removed 68) and now considering 1973/2041 (removed 68) transitions.
// Phase 1: matrix 1973 rows 862 cols
[2024-06-01 10:39:01] [INFO ] Computed 98 invariants in 34 ms
[2024-06-01 10:39:03] [INFO ] Implicit Places using invariants in 1472 ms returned []
[2024-06-01 10:39:03] [INFO ] Invariant cache hit.
[2024-06-01 10:39:06] [INFO ] Implicit Places using invariants and state equation in 3297 ms returned []
Implicit Place search using SMT with State Equation took 4773 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 862/1966 places, 1973/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6846 ms. Remains : 862/1966 places, 1973/2921 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-01
Product exploration explored 100000 steps with 1207 reset in 525 ms.
Product exploration explored 100000 steps with 1164 reset in 519 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 : [(AND p0 p1 (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 369 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (501 resets) in 332 ms. (120 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (56 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
[2024-06-01 10:39:08] [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) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/55 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 199/254 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/290 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 350/640 variables, 43/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/647 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/647 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 151/798 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/804 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 58/862 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/862 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2835/2835 variables, and 960 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 862/862 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) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/55 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 199/254 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/290 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 10:39:10] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 350/640 variables, 43/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/640 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/647 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/647 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 151/798 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/804 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/804 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 58/862 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/862 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
Problem apf6 is UNSAT
After SMT solving in domain Int declared 2835/2835 variables, and 961 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 862/862 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2904ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 750 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Support contains 3 out of 862 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 862/862 places, 1973/1973 transitions.
Applied a total of 0 rules in 39 ms. Remains 862 /862 variables (removed 0) and now considering 1973/1973 (removed 0) transitions.
[2024-06-01 10:39:12] [INFO ] Invariant cache hit.
[2024-06-01 10:39:13] [INFO ] Implicit Places using invariants in 1288 ms returned []
[2024-06-01 10:39:13] [INFO ] Invariant cache hit.
[2024-06-01 10:39:16] [INFO ] Implicit Places using invariants and state equation in 2952 ms returned []
Implicit Place search using SMT with State Equation took 4250 ms to find 0 implicit places.
[2024-06-01 10:39:17] [INFO ] Redundant transitions in 258 ms returned []
Running 1917 sub problems to find dead transitions.
[2024-06-01 10:39:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/861 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
SMT process timed out in 31260ms, After SMT, problems are : Problem set: 0 solved, 1917 unsolved
Search for dead transitions found 0 dead transitions in 31287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35857 ms. Remains : 862/862 places, 1973/1973 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 : [(AND p0 (NOT p2) p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
RANDOM walk for 21952 steps (259 resets) in 169 ms. (129 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p2), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1206 reset in 551 ms.
Product exploration explored 100000 steps with 1234 reset in 492 ms.
Support contains 3 out of 862 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 862/862 places, 1973/1973 transitions.
Applied a total of 0 rules in 40 ms. Remains 862 /862 variables (removed 0) and now considering 1973/1973 (removed 0) transitions.
[2024-06-01 10:39:50] [INFO ] Invariant cache hit.
[2024-06-01 10:39:51] [INFO ] Implicit Places using invariants in 1082 ms returned []
[2024-06-01 10:39:51] [INFO ] Invariant cache hit.
[2024-06-01 10:39:54] [INFO ] Implicit Places using invariants and state equation in 3224 ms returned []
Implicit Place search using SMT with State Equation took 4309 ms to find 0 implicit places.
[2024-06-01 10:39:54] [INFO ] Redundant transitions in 51 ms returned []
Running 1917 sub problems to find dead transitions.
[2024-06-01 10:39:54] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/861 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1917 unsolved
SMT process timed out in 31262ms, After SMT, problems are : Problem set: 0 solved, 1917 unsolved
Search for dead transitions found 0 dead transitions in 31286ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35696 ms. Remains : 862/862 places, 1973/1973 transitions.
Treatment of property ASLink-PT-10a-LTLCardinality-01 finished in 86466 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(G(p0)))'
Support contains 2 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1966/1966 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 1965 transition count 2535
Reduce places removed 395 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 405 rules applied. Total rules applied 790 place count 1570 transition count 2525
Reduce places removed 10 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 18 rules applied. Total rules applied 808 place count 1560 transition count 2517
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 816 place count 1552 transition count 2517
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 284 Pre rules applied. Total rules applied 816 place count 1552 transition count 2233
Deduced a syphon composed of 284 places in 4 ms
Ensure Unique test removed 85 places
Reduce places removed 369 places and 0 transitions.
Iterating global reduction 4 with 653 rules applied. Total rules applied 1469 place count 1183 transition count 2233
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 4 with 54 rules applied. Total rules applied 1523 place count 1158 transition count 2204
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1552 place count 1129 transition count 2204
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 1552 place count 1129 transition count 2163
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 1634 place count 1088 transition count 2163
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1649 place count 1073 transition count 2148
Iterating global reduction 6 with 15 rules applied. Total rules applied 1664 place count 1073 transition count 2148
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 14 rules applied. Total rules applied 1678 place count 1073 transition count 2134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1679 place count 1072 transition count 2134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1679 place count 1072 transition count 2133
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1681 place count 1071 transition count 2133
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 8 with 190 rules applied. Total rules applied 1871 place count 976 transition count 2038
Applied a total of 1871 rules in 264 ms. Remains 976 /1966 variables (removed 990) and now considering 2038/2921 (removed 883) transitions.
// Phase 1: matrix 2038 rows 976 cols
[2024-06-01 10:40:26] [INFO ] Computed 147 invariants in 26 ms
[2024-06-01 10:40:27] [INFO ] Implicit Places using invariants in 1078 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 459, 519, 537, 543, 548, 550, 610, 627, 633, 638, 640, 700, 717, 723, 728, 730, 790, 807, 813, 818, 820, 880, 897, 903, 908, 910, 973]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1086 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 926/1966 places, 2038/2921 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 926 transition count 2037
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 925 transition count 2037
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 905 transition count 2017
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 905 transition count 2017
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 885 transition count 1997
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 885 transition count 1997
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 875 transition count 1987
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 875 transition count 1987
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 142 place count 855 transition count 1967
Applied a total of 142 rules in 178 ms. Remains 855 /926 variables (removed 71) and now considering 1967/2038 (removed 71) transitions.
// Phase 1: matrix 1967 rows 855 cols
[2024-06-01 10:40:27] [INFO ] Computed 97 invariants in 28 ms
[2024-06-01 10:40:29] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2024-06-01 10:40:29] [INFO ] Invariant cache hit.
[2024-06-01 10:40:32] [INFO ] Implicit Places using invariants and state equation in 3192 ms returned []
Implicit Place search using SMT with State Equation took 4455 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 855/1966 places, 1967/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5985 ms. Remains : 855/1966 places, 1967/2921 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-03
Product exploration explored 100000 steps with 1247 reset in 342 ms.
Product exploration explored 100000 steps with 1222 reset in 374 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 based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0)]
RANDOM walk for 13951 steps (175 resets) in 70 ms. (196 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 855 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 855/855 places, 1967/1967 transitions.
Applied a total of 0 rules in 39 ms. Remains 855 /855 variables (removed 0) and now considering 1967/1967 (removed 0) transitions.
[2024-06-01 10:40:33] [INFO ] Invariant cache hit.
[2024-06-01 10:40:34] [INFO ] Implicit Places using invariants in 1176 ms returned []
[2024-06-01 10:40:34] [INFO ] Invariant cache hit.
[2024-06-01 10:40:38] [INFO ] Implicit Places using invariants and state equation in 3413 ms returned []
Implicit Place search using SMT with State Equation took 4592 ms to find 0 implicit places.
[2024-06-01 10:40:38] [INFO ] Redundant transitions in 74 ms returned []
Running 1911 sub problems to find dead transitions.
[2024-06-01 10:40:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/854 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1911 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/854 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 1911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 854/2822 variables, and 91 constraints, problems are : Problem set: 0 solved, 1911 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 79/82 constraints, State Equation: 0/855 constraints, PredecessorRefiner: 1911/1911 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1911 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/854 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1911 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/854 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 1911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 854/2822 variables, and 91 constraints, problems are : Problem set: 0 solved, 1911 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 79/82 constraints, State Equation: 0/855 constraints, PredecessorRefiner: 0/1911 constraints, Known Traps: 0/0 constraints]
After SMT, in 61318ms problems are : Problem set: 0 solved, 1911 unsolved
Search for dead transitions found 0 dead transitions in 61339ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66056 ms. Remains : 855/855 places, 1967/1967 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 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 3934 steps (36 resets) in 18 ms. (207 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1195 reset in 340 ms.
Product exploration explored 100000 steps with 1192 reset in 374 ms.
Support contains 2 out of 855 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 855/855 places, 1967/1967 transitions.
Applied a total of 0 rules in 39 ms. Remains 855 /855 variables (removed 0) and now considering 1967/1967 (removed 0) transitions.
[2024-06-01 10:41:40] [INFO ] Invariant cache hit.
[2024-06-01 10:41:41] [INFO ] Implicit Places using invariants in 1111 ms returned []
[2024-06-01 10:41:41] [INFO ] Invariant cache hit.
[2024-06-01 10:41:44] [INFO ] Implicit Places using invariants and state equation in 2907 ms returned []
Implicit Place search using SMT with State Equation took 4021 ms to find 0 implicit places.
[2024-06-01 10:41:44] [INFO ] Redundant transitions in 73 ms returned []
Running 1911 sub problems to find dead transitions.
[2024-06-01 10:41:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/854 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1911 unsolved
SMT process timed out in 31172ms, After SMT, problems are : Problem set: 0 solved, 1911 unsolved
Search for dead transitions found 0 dead transitions in 31192ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35334 ms. Remains : 855/855 places, 1967/1967 transitions.
Treatment of property ASLink-PT-10a-LTLCardinality-03 finished in 109794 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(p0))'
Support contains 2 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1965 transition count 2920
Applied a total of 2 rules in 191 ms. Remains 1965 /1966 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2024-06-01 10:42:16] [INFO ] Computed 267 invariants in 41 ms
[2024-06-01 10:42:18] [INFO ] Implicit Places using invariants in 1968 ms returned []
[2024-06-01 10:42:18] [INFO ] Invariant cache hit.
[2024-06-01 10:42:26] [INFO ] Implicit Places using invariants and state equation in 7841 ms returned []
Implicit Place search using SMT with State Equation took 9811 ms to find 0 implicit places.
Running 2919 sub problems to find dead transitions.
[2024-06-01 10:42:26] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 2919/2919 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 0/2919 constraints, Known Traps: 0/0 constraints]
After SMT, in 61761ms problems are : Problem set: 0 solved, 2919 unsolved
Search for dead transitions found 0 dead transitions in 61792ms
Starting structural reductions in LTL mode, iteration 1 : 1965/1966 places, 2920/2921 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71801 ms. Remains : 1965/1966 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 2001 ms.
Product exploration explored 100000 steps with 50000 reset in 2009 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)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-10a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10a-LTLCardinality-06 finished in 75952 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((F(G(p0)) U !p1))))'
Support contains 4 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1965 transition count 2920
Applied a total of 2 rules in 193 ms. Remains 1965 /1966 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
[2024-06-01 10:43:32] [INFO ] Invariant cache hit.
[2024-06-01 10:43:34] [INFO ] Implicit Places using invariants in 2052 ms returned []
[2024-06-01 10:43:34] [INFO ] Invariant cache hit.
[2024-06-01 10:43:43] [INFO ] Implicit Places using invariants and state equation in 9276 ms returned []
Implicit Place search using SMT with State Equation took 11329 ms to find 0 implicit places.
Running 2919 sub problems to find dead transitions.
[2024-06-01 10:43:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 2919/2919 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 0/2919 constraints, Known Traps: 0/0 constraints]
After SMT, in 61760ms problems are : Problem set: 0 solved, 2919 unsolved
Search for dead transitions found 0 dead transitions in 61791ms
Starting structural reductions in LTL mode, iteration 1 : 1965/1966 places, 2920/2921 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73321 ms. Remains : 1965/1966 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 153 ms :[p1, p1, (NOT p0), p1]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-08
Product exploration explored 100000 steps with 414 reset in 498 ms.
Product exploration explored 100000 steps with 440 reset in 563 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), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[p1, (NOT p0), p1]
RANDOM walk for 35263 steps (150 resets) in 220 ms. (159 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 106 ms :[p1, (NOT p0), p1]
[2024-06-01 10:44:47] [INFO ] Invariant cache hit.
Proved EG p1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0)), (G p1)]
Property proved to be false thanks to negative knowledge :(G p1)
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-10a-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10a-LTLCardinality-08 finished in 78856 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(G(p0)))'
Support contains 2 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1966/1966 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 1965 transition count 2526
Reduce places removed 404 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 414 rules applied. Total rules applied 808 place count 1561 transition count 2516
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 818 place count 1551 transition count 2516
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 283 Pre rules applied. Total rules applied 818 place count 1551 transition count 2233
Deduced a syphon composed of 283 places in 3 ms
Ensure Unique test removed 85 places
Reduce places removed 368 places and 0 transitions.
Iterating global reduction 3 with 651 rules applied. Total rules applied 1469 place count 1183 transition count 2233
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 54 rules applied. Total rules applied 1523 place count 1158 transition count 2204
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1552 place count 1129 transition count 2204
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 1552 place count 1129 transition count 2163
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1634 place count 1088 transition count 2163
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1649 place count 1073 transition count 2148
Iterating global reduction 5 with 15 rules applied. Total rules applied 1664 place count 1073 transition count 2148
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 14 rules applied. Total rules applied 1678 place count 1073 transition count 2134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1679 place count 1072 transition count 2134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1679 place count 1072 transition count 2133
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1681 place count 1071 transition count 2133
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 7 with 188 rules applied. Total rules applied 1869 place count 977 transition count 2039
Applied a total of 1869 rules in 268 ms. Remains 977 /1966 variables (removed 989) and now considering 2039/2921 (removed 882) transitions.
// Phase 1: matrix 2039 rows 977 cols
[2024-06-01 10:44:51] [INFO ] Computed 147 invariants in 24 ms
[2024-06-01 10:44:52] [INFO ] Implicit Places using invariants in 1365 ms returned [72, 89, 95, 100, 159, 176, 182, 188, 190, 250, 267, 273, 278, 280, 340, 357, 363, 368, 370, 430, 447, 453, 458, 460, 520, 537, 543, 548, 550, 610, 627, 633, 638, 640, 700, 717, 723, 728, 730, 791, 808, 814, 819, 821, 881, 898, 904, 909, 911, 974]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1367 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 927/1966 places, 2039/2921 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 927 transition count 2038
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 926 transition count 2038
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 21 place count 907 transition count 2019
Iterating global reduction 2 with 19 rules applied. Total rules applied 40 place count 907 transition count 2019
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 59 place count 888 transition count 2000
Iterating global reduction 2 with 19 rules applied. Total rules applied 78 place count 888 transition count 2000
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 878 transition count 1990
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 878 transition count 1990
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 138 place count 858 transition count 1970
Applied a total of 138 rules in 174 ms. Remains 858 /927 variables (removed 69) and now considering 1970/2039 (removed 69) transitions.
// Phase 1: matrix 1970 rows 858 cols
[2024-06-01 10:44:52] [INFO ] Computed 97 invariants in 22 ms
[2024-06-01 10:44:53] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2024-06-01 10:44:53] [INFO ] Invariant cache hit.
[2024-06-01 10:44:56] [INFO ] Implicit Places using invariants and state equation in 3102 ms returned []
Implicit Place search using SMT with State Equation took 4224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 858/1966 places, 1970/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6034 ms. Remains : 858/1966 places, 1970/2921 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-10
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-10 finished in 6088 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(p0))'
Support contains 1 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1966/1966 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 1965 transition count 2526
Reduce places removed 404 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 414 rules applied. Total rules applied 808 place count 1561 transition count 2516
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 818 place count 1551 transition count 2516
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 284 Pre rules applied. Total rules applied 818 place count 1551 transition count 2232
Deduced a syphon composed of 284 places in 3 ms
Ensure Unique test removed 85 places
Reduce places removed 369 places and 0 transitions.
Iterating global reduction 3 with 653 rules applied. Total rules applied 1471 place count 1182 transition count 2232
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 54 rules applied. Total rules applied 1525 place count 1157 transition count 2203
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1554 place count 1128 transition count 2203
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 1554 place count 1128 transition count 2162
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1636 place count 1087 transition count 2162
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1651 place count 1072 transition count 2147
Iterating global reduction 5 with 15 rules applied. Total rules applied 1666 place count 1072 transition count 2147
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 14 rules applied. Total rules applied 1680 place count 1072 transition count 2133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1681 place count 1071 transition count 2133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1681 place count 1071 transition count 2132
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1683 place count 1070 transition count 2132
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 7 with 190 rules applied. Total rules applied 1873 place count 975 transition count 2037
Applied a total of 1873 rules in 225 ms. Remains 975 /1966 variables (removed 991) and now considering 2037/2921 (removed 884) transitions.
// Phase 1: matrix 2037 rows 975 cols
[2024-06-01 10:44:57] [INFO ] Computed 147 invariants in 24 ms
[2024-06-01 10:44:58] [INFO ] Implicit Places using invariants in 1230 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 459, 519, 536, 542, 547, 549, 609, 626, 632, 637, 639, 699, 716, 722, 727, 729, 789, 806, 812, 817, 819, 879, 896, 902, 907, 909, 972]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1232 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 925/1966 places, 2037/2921 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 925 transition count 2036
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 924 transition count 2036
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 904 transition count 2016
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 904 transition count 2016
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 884 transition count 1996
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 884 transition count 1996
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 874 transition count 1986
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 874 transition count 1986
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 142 place count 854 transition count 1966
Applied a total of 142 rules in 173 ms. Remains 854 /925 variables (removed 71) and now considering 1966/2037 (removed 71) transitions.
// Phase 1: matrix 1966 rows 854 cols
[2024-06-01 10:44:58] [INFO ] Computed 97 invariants in 22 ms
[2024-06-01 10:44:59] [INFO ] Implicit Places using invariants in 1103 ms returned []
[2024-06-01 10:44:59] [INFO ] Invariant cache hit.
[2024-06-01 10:45:02] [INFO ] Implicit Places using invariants and state equation in 2959 ms returned []
Implicit Place search using SMT with State Equation took 4067 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 854/1966 places, 1966/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5699 ms. Remains : 854/1966 places, 1966/2921 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-11
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-11 finished in 5751 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' '!(G(F(((p1 U p2)||p0))))'
Support contains 4 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1966/1966 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 1965 transition count 2530
Reduce places removed 400 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 410 rules applied. Total rules applied 800 place count 1565 transition count 2520
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 810 place count 1555 transition count 2520
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 282 Pre rules applied. Total rules applied 810 place count 1555 transition count 2238
Deduced a syphon composed of 282 places in 3 ms
Ensure Unique test removed 84 places
Reduce places removed 366 places and 0 transitions.
Iterating global reduction 3 with 648 rules applied. Total rules applied 1458 place count 1189 transition count 2238
Discarding 26 places :
Implicit places reduction removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 55 rules applied. Total rules applied 1513 place count 1163 transition count 2209
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1542 place count 1134 transition count 2209
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 1542 place count 1134 transition count 2168
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1624 place count 1093 transition count 2168
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1638 place count 1079 transition count 2154
Iterating global reduction 5 with 14 rules applied. Total rules applied 1652 place count 1079 transition count 2154
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 14 rules applied. Total rules applied 1666 place count 1079 transition count 2140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1667 place count 1078 transition count 2140
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 2 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 7 with 186 rules applied. Total rules applied 1853 place count 985 transition count 2047
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1854 place count 985 transition count 2047
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1855 place count 984 transition count 2046
Iterating global reduction 7 with 1 rules applied. Total rules applied 1856 place count 984 transition count 2046
Applied a total of 1856 rules in 310 ms. Remains 984 /1966 variables (removed 982) and now considering 2046/2921 (removed 875) transitions.
// Phase 1: matrix 2046 rows 984 cols
[2024-06-01 10:45:03] [INFO ] Computed 147 invariants in 24 ms
[2024-06-01 10:45:04] [INFO ] Implicit Places using invariants in 1351 ms returned [72, 89, 95, 100, 160, 177, 183, 188, 190, 250, 267, 273, 278, 280, 340, 357, 363, 368, 370, 430, 447, 453, 458, 460, 520, 537, 543, 548, 550, 610, 635, 640, 642, 702, 719, 725, 732, 734, 794, 811, 817, 822, 824, 884, 901, 907, 912, 914, 981]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1353 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 935/1966 places, 2046/2921 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 935 transition count 2045
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 934 transition count 2044
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 933 transition count 2044
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 22 place count 915 transition count 2026
Iterating global reduction 3 with 18 rules applied. Total rules applied 40 place count 915 transition count 2026
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 58 place count 897 transition count 2008
Iterating global reduction 3 with 18 rules applied. Total rules applied 76 place count 897 transition count 2008
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 85 place count 888 transition count 1999
Iterating global reduction 3 with 9 rules applied. Total rules applied 94 place count 888 transition count 1999
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 134 place count 868 transition count 1979
Applied a total of 134 rules in 181 ms. Remains 868 /935 variables (removed 67) and now considering 1979/2046 (removed 67) transitions.
// Phase 1: matrix 1979 rows 868 cols
[2024-06-01 10:45:04] [INFO ] Computed 98 invariants in 21 ms
[2024-06-01 10:45:05] [INFO ] Implicit Places using invariants in 1142 ms returned []
[2024-06-01 10:45:05] [INFO ] Invariant cache hit.
[2024-06-01 10:45:08] [INFO ] Implicit Places using invariants and state equation in 3148 ms returned []
Implicit Place search using SMT with State Equation took 4294 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 868/1966 places, 1979/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6139 ms. Remains : 868/1966 places, 1979/2921 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-12
Product exploration explored 100000 steps with 1152 reset in 370 ms.
Product exploration explored 100000 steps with 1182 reset in 427 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 : [(AND (NOT p2) p0), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 19347 steps (228 resets) in 144 ms. (133 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F p2), (F (NOT (OR p2 p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Applied a total of 0 rules in 39 ms. Remains 868 /868 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
[2024-06-01 10:45:10] [INFO ] Invariant cache hit.
[2024-06-01 10:45:11] [INFO ] Implicit Places using invariants in 1181 ms returned []
[2024-06-01 10:45:11] [INFO ] Invariant cache hit.
[2024-06-01 10:45:14] [INFO ] Implicit Places using invariants and state equation in 3311 ms returned []
Implicit Place search using SMT with State Equation took 4494 ms to find 0 implicit places.
[2024-06-01 10:45:14] [INFO ] Redundant transitions in 75 ms returned []
Running 1923 sub problems to find dead transitions.
[2024-06-01 10:45:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1923 unsolved
SMT process timed out in 31261ms, After SMT, problems are : Problem set: 0 solved, 1923 unsolved
Search for dead transitions found 0 dead transitions in 31282ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35899 ms. Remains : 868/868 places, 1979/1979 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 : [(AND (NOT p2) p0), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 31475 steps (343 resets) in 629 ms. (49 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F p2), (F (NOT (OR p2 p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 1183 reset in 372 ms.
Product exploration explored 100000 steps with 1223 reset in 437 ms.
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Applied a total of 0 rules in 39 ms. Remains 868 /868 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
[2024-06-01 10:45:47] [INFO ] Invariant cache hit.
[2024-06-01 10:45:48] [INFO ] Implicit Places using invariants in 895 ms returned []
[2024-06-01 10:45:48] [INFO ] Invariant cache hit.
[2024-06-01 10:45:51] [INFO ] Implicit Places using invariants and state equation in 2943 ms returned []
Implicit Place search using SMT with State Equation took 3840 ms to find 0 implicit places.
[2024-06-01 10:45:51] [INFO ] Redundant transitions in 73 ms returned []
Running 1923 sub problems to find dead transitions.
[2024-06-01 10:45:51] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(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 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.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 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.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 1.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 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.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 1.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 1.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 1.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 1.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.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 1.0)
(s201 1.0)
(s202 1.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 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.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 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.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 1.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 1.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 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.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 1.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 1.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 1.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 1.0)
(s382 1.0)
(s383 1.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 1.0)
(s400 1.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 0.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 1.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 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.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 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.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 1.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.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 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.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 1.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 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 1.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 1.0)
(s668 0.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 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.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 1.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 1.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 1.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.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 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1923 unsolved
SMT process timed out in 31248ms, After SMT, problems are : Problem set: 0 solved, 1923 unsolved
Search for dead transitions found 0 dead transitions in 31269ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35235 ms. Remains : 868/868 places, 1979/1979 transitions.
Treatment of property ASLink-PT-10a-LTLCardinality-12 finished in 80547 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(p1)&&p0)))'
Support contains 4 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1965 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1965 transition count 2920
Applied a total of 2 rules in 194 ms. Remains 1965 /1966 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
// Phase 1: matrix 2920 rows 1965 cols
[2024-06-01 10:46:23] [INFO ] Computed 267 invariants in 33 ms
[2024-06-01 10:46:25] [INFO ] Implicit Places using invariants in 1844 ms returned []
[2024-06-01 10:46:25] [INFO ] Invariant cache hit.
[2024-06-01 10:46:32] [INFO ] Implicit Places using invariants and state equation in 7285 ms returned []
Implicit Place search using SMT with State Equation took 9131 ms to find 0 implicit places.
Running 2919 sub problems to find dead transitions.
[2024-06-01 10:46:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 2919/2919 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1964 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1964/4885 variables, and 195 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/58 constraints, Generalized P Invariants (flows): 195/209 constraints, State Equation: 0/1965 constraints, PredecessorRefiner: 0/2919 constraints, Known Traps: 0/0 constraints]
After SMT, in 61748ms problems are : Problem set: 0 solved, 2919 unsolved
Search for dead transitions found 0 dead transitions in 61780ms
Starting structural reductions in LTL mode, iteration 1 : 1965/1966 places, 2920/2921 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71112 ms. Remains : 1965/1966 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-13 finished in 71267 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' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1966/1966 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 393 rules applied. Total rules applied 393 place count 1965 transition count 2527
Reduce places removed 403 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 413 rules applied. Total rules applied 806 place count 1562 transition count 2517
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 816 place count 1552 transition count 2517
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 283 Pre rules applied. Total rules applied 816 place count 1552 transition count 2234
Deduced a syphon composed of 283 places in 3 ms
Ensure Unique test removed 84 places
Reduce places removed 367 places and 0 transitions.
Iterating global reduction 3 with 650 rules applied. Total rules applied 1466 place count 1185 transition count 2234
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 54 rules applied. Total rules applied 1520 place count 1160 transition count 2205
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1549 place count 1131 transition count 2205
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 1549 place count 1131 transition count 2165
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1629 place count 1091 transition count 2165
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1644 place count 1076 transition count 2150
Iterating global reduction 5 with 15 rules applied. Total rules applied 1659 place count 1076 transition count 2150
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 14 rules applied. Total rules applied 1673 place count 1076 transition count 2136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1674 place count 1075 transition count 2136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1674 place count 1075 transition count 2135
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1676 place count 1074 transition count 2135
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 7 with 192 rules applied. Total rules applied 1868 place count 978 transition count 2039
Applied a total of 1868 rules in 292 ms. Remains 978 /1966 variables (removed 988) and now considering 2039/2921 (removed 882) transitions.
// Phase 1: matrix 2039 rows 978 cols
[2024-06-01 10:47:34] [INFO ] Computed 148 invariants in 24 ms
[2024-06-01 10:47:36] [INFO ] Implicit Places using invariants in 1318 ms returned [72, 89, 95, 100, 159, 179, 185, 190, 192, 252, 269, 275, 280, 282, 342, 359, 365, 370, 372, 432, 449, 455, 460, 462, 522, 539, 545, 550, 552, 612, 629, 635, 640, 642, 702, 719, 725, 730, 732, 792, 809, 815, 820, 822, 882, 899, 905, 910, 912, 975]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1323 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 928/1966 places, 2039/2921 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 928 transition count 2038
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 927 transition count 2038
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 21 place count 908 transition count 2019
Iterating global reduction 2 with 19 rules applied. Total rules applied 40 place count 908 transition count 2019
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 59 place count 889 transition count 2000
Iterating global reduction 2 with 19 rules applied. Total rules applied 78 place count 889 transition count 2000
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 880 transition count 1991
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 880 transition count 1991
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 136 place count 860 transition count 1971
Applied a total of 136 rules in 172 ms. Remains 860 /928 variables (removed 68) and now considering 1971/2039 (removed 68) transitions.
// Phase 1: matrix 1971 rows 860 cols
[2024-06-01 10:47:36] [INFO ] Computed 98 invariants in 22 ms
[2024-06-01 10:47:37] [INFO ] Implicit Places using invariants in 1081 ms returned []
[2024-06-01 10:47:37] [INFO ] Invariant cache hit.
[2024-06-01 10:47:40] [INFO ] Implicit Places using invariants and state equation in 2883 ms returned []
Implicit Place search using SMT with State Equation took 3975 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 860/1966 places, 1971/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5762 ms. Remains : 860/1966 places, 1971/2921 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-15
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-15 finished in 5883 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((G(F(p0))&&(F(G(p1))||G(p2)))))'
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(G(p0)))'
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' '!(G(F(((p1 U p2)||p0))))'
[2024-06-01 10:47:41] [INFO ] Flatten gal took : 134 ms
[2024-06-01 10:47:41] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 10:47:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1966 places, 2921 transitions and 10132 arcs took 29 ms.
Total runtime 721255 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
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-10a"
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-10a, 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-171620117900155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10a.tgz
mv ASLink-PT-10a 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 '
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 ;