fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813597500155
Last Updated
May 14, 2023

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
1241.436 183803.00 234784.00 40.30 TFFFFFFFTFTF?FTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597500155.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
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 r009-oct2-167813597500155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 920K Mar 5 18:22 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 1678617901979

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:45:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 10:45:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:45:04] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2023-03-12 10:45:04] [INFO ] Transformed 2186 places.
[2023-03-12 10:45:04] [INFO ] Transformed 3192 transitions.
[2023-03-12 10:45:04] [INFO ] Found NUPN structural information;
[2023-03-12 10:45:04] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 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-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 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 2122 ms. Remains 2094 /2186 variables (removed 92) and now considering 2955/3158 (removed 203) transitions.
// Phase 1: matrix 2955 rows 2094 cols
[2023-03-12 10:45:06] [INFO ] Computed 361 place invariants in 168 ms
[2023-03-12 10:45:09] [INFO ] Implicit Places using invariants in 2534 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, 779, 783, 784, 785, 803, 821, 950, 966, 971, 972, 973, 991, 1009, 1138, 1154, 1159, 1160, 1161, 1179, 1197, 1326, 1347, 1348, 1349, 1367, 1385, 1514, 1530, 1535, 1536, 1537, 1555, 1573, 1702, 1718, 1723, 1724, 1725, 1743, 1761, 1895, 1907, 1912, 1913, 1914, 1932, 1934, 1937, 1955, 1956, 1957, 1958, 1975, 1983, 1991, 1997, 2003, 2009, 2015, 2023, 2029, 2035, 2043]
Discarding 92 places :
Implicit Place search using SMT only with invariants took 2593 ms to find 92 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2002/2186 places, 2955/3158 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1990 transition count 2943
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1990 transition count 2943
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 1980 transition count 2933
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 1980 transition count 2933
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 1975 transition count 2928
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 1975 transition count 2928
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1973 transition count 2926
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1973 transition count 2926
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1971 transition count 2924
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1971 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1970 transition count 2923
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1970 transition count 2923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1969 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1969 transition count 2922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1968 transition count 2921
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1968 transition count 2921
Applied a total of 68 rules in 754 ms. Remains 1968 /2002 variables (removed 34) and now considering 2921/2955 (removed 34) transitions.
// Phase 1: matrix 2921 rows 1968 cols
[2023-03-12 10:45:09] [INFO ] Computed 269 place invariants in 46 ms
[2023-03-12 10:45:11] [INFO ] Implicit Places using invariants in 1303 ms returned []
[2023-03-12 10:45:11] [INFO ] Invariant cache hit.
[2023-03-12 10:45:15] [INFO ] Implicit Places using invariants and state equation in 4495 ms returned []
Implicit Place search using SMT with State Equation took 5814 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1968/2186 places, 2921/3158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11286 ms. Remains : 1968/2186 places, 2921/3158 transitions.
Support contains 33 out of 1968 places after structural reductions.
[2023-03-12 10:45:16] [INFO ] Flatten gal took : 203 ms
[2023-03-12 10:45:16] [INFO ] Flatten gal took : 142 ms
[2023-03-12 10:45:16] [INFO ] Input system was already deterministic with 2921 transitions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 10:45:17] [INFO ] Invariant cache hit.
[2023-03-12 10:45:17] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 10:45:18] [INFO ] [Nat]Absence check using 61 positive place invariants in 35 ms returned sat
[2023-03-12 10:45:18] [INFO ] [Nat]Absence check using 61 positive and 208 generalized place invariants in 55 ms returned sat
[2023-03-12 10:45:42] [INFO ] After 24205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 10:45:42] [INFO ] After 24212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 10:45:42] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 554 ms.
Support contains 16 out of 1968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Drop transitions removed 384 transitions
Trivial Post-agglo rules discarded 384 transitions
Performed 384 trivial Post agglomeration. Transition count delta: 384
Iterating post reduction 0 with 384 rules applied. Total rules applied 384 place count 1968 transition count 2537
Reduce places removed 384 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 385 rules applied. Total rules applied 769 place count 1584 transition count 2536
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 770 place count 1583 transition count 2536
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 259 Pre rules applied. Total rules applied 770 place count 1583 transition count 2277
Deduced a syphon composed of 259 places in 3 ms
Ensure Unique test removed 82 places
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 600 rules applied. Total rules applied 1370 place count 1242 transition count 2277
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 23 rules applied. Total rules applied 1393 place count 1228 transition count 2268
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1402 place count 1219 transition count 2268
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 39 Pre rules applied. Total rules applied 1402 place count 1219 transition count 2229
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 1480 place count 1180 transition count 2229
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1484 place count 1176 transition count 2225
Iterating global reduction 5 with 4 rules applied. Total rules applied 1488 place count 1176 transition count 2225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions 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 1492 place count 1176 transition count 2221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1493 place count 1175 transition count 2221
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 9 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 7 with 200 rules applied. Total rules applied 1693 place count 1075 transition count 2121
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1702 place count 1075 transition count 2112
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1711 place count 1066 transition count 2112
Free-agglomeration rule (complex) applied 41 times.
Iterating global reduction 8 with 41 rules applied. Total rules applied 1752 place count 1066 transition count 2071
Ensure Unique test removed 1 places
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 8 with 42 rules applied. Total rules applied 1794 place count 1024 transition count 2071
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 1803 place count 1024 transition count 2062
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 1833 place count 1024 transition count 2062
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1834 place count 1024 transition count 2062
Applied a total of 1834 rules in 706 ms. Remains 1024 /1968 variables (removed 944) and now considering 2062/2921 (removed 859) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 706 ms. Remains : 1024/1968 places, 2062/2921 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2062 rows 1024 cols
[2023-03-12 10:45:44] [INFO ] Computed 172 place invariants in 18 ms
[2023-03-12 10:45:44] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 10:45:44] [INFO ] [Nat]Absence check using 29 positive place invariants in 72 ms returned sat
[2023-03-12 10:45:45] [INFO ] [Nat]Absence check using 29 positive and 143 generalized place invariants in 49 ms returned sat
[2023-03-12 10:46:04] [INFO ] After 19363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:46:04] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-12 10:46:04] [INFO ] After 480ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 10:46:05] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 18 ms to minimize.
[2023-03-12 10:46:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2023-03-12 10:46:05] [INFO ] After 1386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 311 ms.
[2023-03-12 10:46:06] [INFO ] After 21458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 2062/2062 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1024 transition count 2060
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1022 transition count 2060
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1022 transition count 2059
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 1020 transition count 2059
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 1019 transition count 2058
Applied a total of 9 rules in 79 ms. Remains 1019 /1024 variables (removed 5) and now considering 2058/2062 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 1019/1024 places, 2058/2062 transitions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 256825 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{4=1}
Probabilistic random walk after 256825 steps, saw 97150 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 2058 rows 1019 cols
[2023-03-12 10:46:09] [INFO ] Computed 171 place invariants in 43 ms
[2023-03-12 10:46:10] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 10:46:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-12 10:46:10] [INFO ] [Nat]Absence check using 31 positive and 140 generalized place invariants in 42 ms returned sat
[2023-03-12 10:46:20] [INFO ] After 9880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:46:20] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-12 10:46:20] [INFO ] After 505ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 10:46:21] [INFO ] After 1101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 253 ms.
[2023-03-12 10:46:21] [INFO ] After 11595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 73 ms.
Support contains 10 out of 1019 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1019/1019 places, 2058/2058 transitions.
Applied a total of 0 rules in 34 ms. Remains 1019 /1019 variables (removed 0) and now considering 2058/2058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1019/1019 places, 2058/2058 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-03-12 10:46:22] [INFO ] Invariant cache hit.
[2023-03-12 10:46:22] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:46:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-12 10:46:22] [INFO ] [Nat]Absence check using 31 positive and 140 generalized place invariants in 48 ms returned sat
[2023-03-12 10:46:32] [INFO ] After 9662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:46:32] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-12 10:46:32] [INFO ] After 388ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:46:32] [INFO ] After 593ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-12 10:46:32] [INFO ] After 10668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 1019 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1019/1019 places, 2058/2058 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1019 transition count 2056
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1017 transition count 2056
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 1017 transition count 2054
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 1015 transition count 2054
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 1014 transition count 2053
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 1014 transition count 2053
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 1014 transition count 2052
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1013 transition count 2052
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 1011 transition count 2050
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 1011 transition count 2050
Applied a total of 17 rules in 146 ms. Remains 1011 /1019 variables (removed 8) and now considering 2050/2058 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 1011/1019 places, 2050/2058 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 304902 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 304902 steps, saw 105422 distinct states, run finished after 3002 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2050 rows 1011 cols
[2023-03-12 10:46:36] [INFO ] Computed 171 place invariants in 21 ms
[2023-03-12 10:46:36] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:46:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2023-03-12 10:46:36] [INFO ] [Nat]Absence check using 35 positive and 136 generalized place invariants in 55 ms returned sat
[2023-03-12 10:46:43] [INFO ] After 6366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:46:43] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-12 10:46:52] [INFO ] After 9330ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:46:52] [INFO ] After 9570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-12 10:46:52] [INFO ] After 16374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 77 ms.
Support contains 6 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 2050/2050 transitions.
Applied a total of 0 rules in 29 ms. Remains 1011 /1011 variables (removed 0) and now considering 2050/2050 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1011/1011 places, 2050/2050 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 2050/2050 transitions.
Applied a total of 0 rules in 28 ms. Remains 1011 /1011 variables (removed 0) and now considering 2050/2050 (removed 0) transitions.
[2023-03-12 10:46:52] [INFO ] Invariant cache hit.
[2023-03-12 10:46:53] [INFO ] Implicit Places using invariants in 914 ms returned [89, 95, 98, 100, 103, 110, 111, 112, 181, 187, 190, 192, 195, 202, 203, 204, 273, 279, 282, 284, 287, 294, 295, 296, 365, 371, 374, 376, 379, 386, 387, 388, 457, 463, 466, 468, 471, 478, 479, 480, 549, 555, 558, 560, 563, 570, 571, 572, 637, 645, 651, 654, 656, 663, 670, 671, 672, 673, 742, 748, 751, 753, 756, 763, 764, 765, 834, 840, 843, 845, 848, 861, 930, 936, 939, 941, 944, 958]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 918 ms to find 78 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 933/1011 places, 2050/2050 transitions.
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 0 place count 933 transition count 2029
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 912 transition count 2029
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 911 transition count 2029
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 84 place count 870 transition count 1988
Iterating global reduction 1 with 41 rules applied. Total rules applied 125 place count 870 transition count 1988
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 135 place count 870 transition count 1978
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 145 place count 860 transition count 1968
Iterating global reduction 2 with 10 rules applied. Total rules applied 155 place count 860 transition count 1968
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 177 place count 849 transition count 1957
Free-agglomeration rule applied 31 times.
Iterating global reduction 2 with 31 rules applied. Total rules applied 208 place count 849 transition count 1926
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 240 place count 818 transition count 1925
Applied a total of 240 rules in 127 ms. Remains 818 /933 variables (removed 115) and now considering 1925/2050 (removed 125) transitions.
// Phase 1: matrix 1925 rows 818 cols
[2023-03-12 10:46:54] [INFO ] Computed 92 place invariants in 40 ms
[2023-03-12 10:46:54] [INFO ] Implicit Places using invariants in 592 ms returned [72, 89, 145, 162, 218, 235, 291, 308, 364, 381, 437, 454, 510, 529, 585, 602, 658, 675, 737, 755]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 593 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 798/1011 places, 1925/2050 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 797 transition count 1924
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 797 transition count 1924
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 787 transition count 1914
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 32 place count 787 transition count 1904
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 42 place count 777 transition count 1904
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 777 transition count 1904
Applied a total of 43 rules in 152 ms. Remains 777 /798 variables (removed 21) and now considering 1904/1925 (removed 21) transitions.
// Phase 1: matrix 1904 rows 777 cols
[2023-03-12 10:46:54] [INFO ] Computed 72 place invariants in 37 ms
[2023-03-12 10:46:55] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-12 10:46:55] [INFO ] Invariant cache hit.
[2023-03-12 10:46:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 10:46:58] [INFO ] Implicit Places using invariants and state equation in 2927 ms returned []
Implicit Place search using SMT with State Equation took 3443 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 777/1011 places, 1904/2050 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5262 ms. Remains : 777/1011 places, 1904/2050 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 129 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
// Phase 1: matrix 2920 rows 1967 cols
[2023-03-12 10:46:58] [INFO ] Computed 269 place invariants in 54 ms
[2023-03-12 10:46:59] [INFO ] Implicit Places using invariants in 1287 ms returned [1292, 1821]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1295 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 94 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1518 ms. Remains : 1965/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 341 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s497 0) (NEQ s1140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 9 ms.
FORMULA ASLink-PT-10a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-01 finished in 1973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 179 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
[2023-03-12 10:47:00] [INFO ] Invariant cache hit.
[2023-03-12 10:47:01] [INFO ] Implicit Places using invariants in 1156 ms returned [1292, 1821]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1159 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 71 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1410 ms. Remains : 1965/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1241 0) (EQ s1747 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 5 ms.
FORMULA ASLink-PT-10a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-03 finished in 1646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 3 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 152 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
[2023-03-12 10:47:02] [INFO ] Invariant cache hit.
[2023-03-12 10:47:03] [INFO ] Implicit Places using invariants in 1169 ms returned []
[2023-03-12 10:47:03] [INFO ] Invariant cache hit.
[2023-03-12 10:47:08] [INFO ] Implicit Places using invariants and state equation in 4868 ms returned [1821]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6059 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1966/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 99 ms. Remains 1966 /1966 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6310 ms. Remains : 1966/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1559 1), p1:(OR (EQ s1292 0) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 284 steps with 0 reset in 8 ms.
FORMULA ASLink-PT-10a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-04 finished in 6630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 1967 transition count 2529
Reduce places removed 402 places and 0 transitions.
Drop transitions 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 803 place count 1565 transition count 2519
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 813 place count 1555 transition count 2519
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 283 Pre rules applied. Total rules applied 813 place count 1555 transition count 2236
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 1463 place count 1188 transition count 2236
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions 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 1517 place count 1163 transition count 2207
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1546 place count 1134 transition count 2207
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 1546 place count 1134 transition count 2167
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 1626 place count 1094 transition count 2167
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1641 place count 1079 transition count 2152
Iterating global reduction 5 with 15 rules applied. Total rules applied 1656 place count 1079 transition count 2152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions 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 1670 place count 1079 transition count 2138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1671 place count 1078 transition count 2138
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1671 place count 1078 transition count 2137
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 1673 place count 1077 transition count 2137
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 1863 place count 982 transition count 2042
Applied a total of 1863 rules in 270 ms. Remains 982 /1968 variables (removed 986) and now considering 2042/2921 (removed 879) transitions.
// Phase 1: matrix 2042 rows 982 cols
[2023-03-12 10:47:08] [INFO ] Computed 149 place invariants in 14 ms
[2023-03-12 10:47:09] [INFO ] Implicit Places using invariants in 541 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, 621, 629, 635, 640, 642, 702, 719, 725, 730, 732, 792, 809, 815, 820, 822, 885, 902, 908, 913, 915, 916, 979]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 543 ms to find 52 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 930/1968 places, 2042/2921 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 930 transition count 2040
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 928 transition count 2040
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 24 place count 908 transition count 2020
Iterating global reduction 2 with 20 rules applied. Total rules applied 44 place count 908 transition count 2020
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 64 place count 888 transition count 2000
Iterating global reduction 2 with 20 rules applied. Total rules applied 84 place count 888 transition count 2000
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 878 transition count 1990
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 878 transition count 1990
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 148 place count 856 transition count 1968
Applied a total of 148 rules in 116 ms. Remains 856 /930 variables (removed 74) and now considering 1968/2042 (removed 74) transitions.
// Phase 1: matrix 1968 rows 856 cols
[2023-03-12 10:47:09] [INFO ] Computed 97 place invariants in 33 ms
[2023-03-12 10:47:10] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-03-12 10:47:10] [INFO ] Invariant cache hit.
[2023-03-12 10:47:12] [INFO ] Implicit Places using invariants and state equation in 2215 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 856/1968 places, 1968/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3742 ms. Remains : 856/1968 places, 1968/2921 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s547 0) (NEQ s198 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-10a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-07 finished in 3837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G((p1||X(p2)))))))'
Support contains 8 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 181 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
// Phase 1: matrix 2920 rows 1967 cols
[2023-03-12 10:47:12] [INFO ] Computed 269 place invariants in 55 ms
[2023-03-12 10:47:13] [INFO ] Implicit Places using invariants in 995 ms returned [1292]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 999 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1966/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 72 ms. Remains 1966 /1966 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1252 ms. Remains : 1966/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s1745 0) (EQ s434 1)), p1:(AND (EQ s716 0) (EQ s709 1)), p2:(OR (EQ s1695 0) (EQ s1820 1) (EQ s1119 0) (EQ s594 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1345 ms.
Product exploration explored 100000 steps with 33333 reset in 1292 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 p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1) p2)
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-10a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10a-LTLCardinality-08 finished in 4406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 147 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
[2023-03-12 10:47:17] [INFO ] Invariant cache hit.
[2023-03-12 10:47:18] [INFO ] Implicit Places using invariants in 1421 ms returned [1292, 1821]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1429 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 72 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1649 ms. Remains : 1965/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1835 0) (EQ s1192 1)), p1:(AND (EQ s1295 0) (EQ s1773 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 134 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-09 finished in 1880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 177 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
[2023-03-12 10:47:19] [INFO ] Invariant cache hit.
[2023-03-12 10:47:20] [INFO ] Implicit Places using invariants in 1560 ms returned [1292, 1821]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1562 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 64 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1816 ms. Remains : 1965/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s1647 0) (EQ s919 1)), p0:(OR (EQ s919 0) (EQ s1647 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-11 finished in 2020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U p2)||p0))))'
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 1967 transition count 2532
Reduce places removed 399 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 409 rules applied. Total rules applied 797 place count 1568 transition count 2522
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 807 place count 1558 transition count 2522
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 282 Pre rules applied. Total rules applied 807 place count 1558 transition count 2240
Deduced a syphon composed of 282 places in 2 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 1455 place count 1192 transition count 2240
Discarding 26 places :
Implicit places reduction removed 26 places
Drop transitions 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 1510 place count 1166 transition count 2211
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1539 place count 1137 transition count 2211
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 1539 place count 1137 transition count 2170
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1621 place count 1096 transition count 2170
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1635 place count 1082 transition count 2156
Iterating global reduction 5 with 14 rules applied. Total rules applied 1649 place count 1082 transition count 2156
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions 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 1663 place count 1082 transition count 2142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1664 place count 1081 transition count 2142
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 2 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 7 with 184 rules applied. Total rules applied 1848 place count 989 transition count 2050
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1849 place count 989 transition count 2050
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1850 place count 988 transition count 2049
Iterating global reduction 7 with 1 rules applied. Total rules applied 1851 place count 988 transition count 2049
Applied a total of 1851 rules in 242 ms. Remains 988 /1968 variables (removed 980) and now considering 2049/2921 (removed 872) transitions.
// Phase 1: matrix 2049 rows 988 cols
[2023-03-12 10:47:21] [INFO ] Computed 148 place invariants in 59 ms
[2023-03-12 10:47:21] [INFO ] Implicit Places using invariants in 919 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, 887, 904, 910, 915, 917, 918, 985]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 935 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 938/1968 places, 2049/2921 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 938 transition count 2047
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 936 transition count 2046
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 935 transition count 2046
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 24 place count 917 transition count 2028
Iterating global reduction 3 with 18 rules applied. Total rules applied 42 place count 917 transition count 2028
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 60 place count 899 transition count 2010
Iterating global reduction 3 with 18 rules applied. Total rules applied 78 place count 899 transition count 2010
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 87 place count 890 transition count 2001
Iterating global reduction 3 with 9 rules applied. Total rules applied 96 place count 890 transition count 2001
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 140 place count 868 transition count 1979
Applied a total of 140 rules in 137 ms. Remains 868 /938 variables (removed 70) and now considering 1979/2049 (removed 70) transitions.
// Phase 1: matrix 1979 rows 868 cols
[2023-03-12 10:47:22] [INFO ] Computed 98 place invariants in 38 ms
[2023-03-12 10:47:22] [INFO ] Implicit Places using invariants in 677 ms returned []
[2023-03-12 10:47:22] [INFO ] Invariant cache hit.
[2023-03-12 10:47:24] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 2847 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 868/1968 places, 1979/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4161 ms. Remains : 868/1968 places, 1979/2921 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (OR (EQ s95 0) (EQ s556 1)) (NOT (OR (EQ s640 0) (EQ s855 1)))), p0:(OR (EQ s95 0) (EQ s556 1) (AND (NEQ s640 0) (NEQ s855 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1182 reset in 369 ms.
Product exploration explored 100000 steps with 1195 reset in 412 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 (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 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 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 121 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267971 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267971 steps, saw 168924 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:47:29] [INFO ] Invariant cache hit.
[2023-03-12 10:47:29] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:47:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-12 10:47:29] [INFO ] [Nat]Absence check using 17 positive and 81 generalized place invariants in 119 ms returned sat
[2023-03-12 10:47:30] [INFO ] After 633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:47:30] [INFO ] After 813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-12 10:47:30] [INFO ] After 1195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 868 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 1979/1979 transitions.
Free-agglomeration rule applied 39 times.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 868 transition count 1940
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 88 place count 829 transition count 1930
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 118 place count 829 transition count 1900
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 148 place count 799 transition count 1900
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 799 transition count 1900
Applied a total of 151 rules in 144 ms. Remains 799 /868 variables (removed 69) and now considering 1900/1979 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 799/868 places, 1900/1979 transitions.
Incomplete random walk after 10000 steps, including 154 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 238703 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238703 steps, saw 144248 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1900 rows 799 cols
[2023-03-12 10:47:33] [INFO ] Computed 98 place invariants in 36 ms
[2023-03-12 10:47:34] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:47:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 10:47:34] [INFO ] [Nat]Absence check using 16 positive and 82 generalized place invariants in 35 ms returned sat
[2023-03-12 10:47:35] [INFO ] After 805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:47:35] [INFO ] After 972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-12 10:47:35] [INFO ] After 1253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 799/799 places, 1900/1900 transitions.
Applied a total of 0 rules in 48 ms. Remains 799 /799 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 799/799 places, 1900/1900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 799/799 places, 1900/1900 transitions.
Applied a total of 0 rules in 27 ms. Remains 799 /799 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2023-03-12 10:47:35] [INFO ] Invariant cache hit.
[2023-03-12 10:47:35] [INFO ] Implicit Places using invariants in 528 ms returned [88, 90, 160, 161, 231, 232, 302, 303, 373, 374, 444, 445, 522, 523, 596, 597, 667, 668]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 531 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 781/799 places, 1900/1900 transitions.
Applied a total of 0 rules in 43 ms. Remains 781 /781 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 602 ms. Remains : 781/799 places, 1900/1900 transitions.
Incomplete random walk after 10000 steps, including 156 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 256487 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256487 steps, saw 150075 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1900 rows 781 cols
[2023-03-12 10:47:39] [INFO ] Computed 80 place invariants in 74 ms
[2023-03-12 10:47:39] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:47:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-12 10:47:39] [INFO ] [Nat]Absence check using 15 positive and 65 generalized place invariants in 43 ms returned sat
[2023-03-12 10:47:40] [INFO ] After 833ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:47:40] [INFO ] After 972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-12 10:47:40] [INFO ] After 1241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1900/1900 transitions.
Applied a total of 0 rules in 38 ms. Remains 781 /781 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 781/781 places, 1900/1900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1900/1900 transitions.
Applied a total of 0 rules in 26 ms. Remains 781 /781 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2023-03-12 10:47:40] [INFO ] Invariant cache hit.
[2023-03-12 10:47:41] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-12 10:47:41] [INFO ] Invariant cache hit.
[2023-03-12 10:47:42] [INFO ] Implicit Places using invariants and state equation in 1805 ms returned []
Implicit Place search using SMT with State Equation took 2348 ms to find 0 implicit places.
[2023-03-12 10:47:43] [INFO ] Redundant transitions in 179 ms returned []
[2023-03-12 10:47:43] [INFO ] Invariant cache hit.
[2023-03-12 10:47:43] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3201 ms. Remains : 781/781 places, 1900/1900 transitions.
Applied a total of 0 rules in 22 ms. Remains 781 /781 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 10:47:43] [INFO ] Invariant cache hit.
[2023-03-12 10:47:43] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:47:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-12 10:47:44] [INFO ] [Nat]Absence check using 15 positive and 65 generalized place invariants in 27 ms returned sat
[2023-03-12 10:47:44] [INFO ] After 822ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:47:45] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 1 ms to minimize.
[2023-03-12 10:47:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2023-03-12 10:47:45] [INFO ] After 1270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-12 10:47:45] [INFO ] After 1478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 187 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 87 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
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 34 ms. Remains 868 /868 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
// Phase 1: matrix 1979 rows 868 cols
[2023-03-12 10:47:45] [INFO ] Computed 98 place invariants in 28 ms
[2023-03-12 10:47:46] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-12 10:47:46] [INFO ] Invariant cache hit.
[2023-03-12 10:47:48] [INFO ] Implicit Places using invariants and state equation in 1966 ms returned []
Implicit Place search using SMT with State Equation took 2557 ms to find 0 implicit places.
[2023-03-12 10:47:48] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-12 10:47:48] [INFO ] Invariant cache hit.
[2023-03-12 10:47:49] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3383 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 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 178 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 133 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1061 steps, including 4 resets, run visited all 1 properties in 8 ms. (steps per millisecond=132 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 235 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 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1196 reset in 319 ms.
Product exploration explored 100000 steps with 1193 reset in 337 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 25 ms. Remains 868 /868 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
[2023-03-12 10:47:50] [INFO ] Invariant cache hit.
[2023-03-12 10:47:51] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-12 10:47:51] [INFO ] Invariant cache hit.
[2023-03-12 10:47:53] [INFO ] Implicit Places using invariants and state equation in 2149 ms returned []
Implicit Place search using SMT with State Equation took 2678 ms to find 0 implicit places.
[2023-03-12 10:47:53] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-12 10:47:53] [INFO ] Invariant cache hit.
[2023-03-12 10:47:54] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3570 ms. Remains : 868/868 places, 1979/1979 transitions.
Treatment of property ASLink-PT-10a-LTLCardinality-12 finished in 33756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions 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 1967 transition count 2530
Reduce places removed 400 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 409 rules applied. Total rules applied 799 place count 1567 transition count 2521
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 809 place count 1558 transition count 2520
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 1557 transition count 2520
Performed 281 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 281 Pre rules applied. Total rules applied 810 place count 1557 transition count 2239
Deduced a syphon composed of 281 places in 3 ms
Ensure Unique test removed 84 places
Reduce places removed 365 places and 0 transitions.
Iterating global reduction 4 with 646 rules applied. Total rules applied 1456 place count 1192 transition count 2239
Discarding 24 places :
Implicit places reduction removed 24 places
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 4 with 51 rules applied. Total rules applied 1507 place count 1168 transition count 2212
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 1534 place count 1141 transition count 2212
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 1534 place count 1141 transition count 2172
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 1614 place count 1101 transition count 2172
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1628 place count 1087 transition count 2158
Iterating global reduction 6 with 14 rules applied. Total rules applied 1642 place count 1087 transition count 2158
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 13 rules applied. Total rules applied 1655 place count 1087 transition count 2145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1656 place count 1086 transition count 2145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1656 place count 1086 transition count 2144
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1658 place count 1085 transition count 2144
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 8 with 190 rules applied. Total rules applied 1848 place count 990 transition count 2049
Applied a total of 1848 rules in 201 ms. Remains 990 /1968 variables (removed 978) and now considering 2049/2921 (removed 872) transitions.
// Phase 1: matrix 2049 rows 990 cols
[2023-03-12 10:47:54] [INFO ] Computed 151 place invariants in 15 ms
[2023-03-12 10:47:55] [INFO ] Implicit Places using invariants in 650 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 267, 275, 280, 282, 360, 366, 371, 440, 457, 463, 468, 470, 530, 547, 553, 558, 560, 620, 637, 643, 648, 650, 710, 727, 733, 738, 740, 800, 817, 823, 828, 830, 893, 910, 916, 921, 923, 924, 987]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 657 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 941/1968 places, 2049/2921 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 941 transition count 2047
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 939 transition count 2047
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 23 place count 920 transition count 2028
Iterating global reduction 2 with 19 rules applied. Total rules applied 42 place count 920 transition count 2028
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 61 place count 901 transition count 2009
Iterating global reduction 2 with 19 rules applied. Total rules applied 80 place count 901 transition count 2009
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 89 place count 892 transition count 2000
Iterating global reduction 2 with 9 rules applied. Total rules applied 98 place count 892 transition count 2000
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 140 place count 871 transition count 1979
Applied a total of 140 rules in 156 ms. Remains 871 /941 variables (removed 70) and now considering 1979/2049 (removed 70) transitions.
// Phase 1: matrix 1979 rows 871 cols
[2023-03-12 10:47:55] [INFO ] Computed 102 place invariants in 40 ms
[2023-03-12 10:47:56] [INFO ] Implicit Places using invariants in 662 ms returned []
[2023-03-12 10:47:56] [INFO ] Invariant cache hit.
[2023-03-12 10:47:58] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 2770 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 871/1968 places, 1979/2921 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3784 ms. Remains : 871/1968 places, 1979/2921 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s357 0) (EQ s134 1)), p1:(AND (EQ s242 0) (EQ s338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 374 steps with 14 reset in 2 ms.
FORMULA ASLink-PT-10a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLCardinality-13 finished in 3899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 2921/2921 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1967 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1967 transition count 2920
Applied a total of 2 rules in 132 ms. Remains 1967 /1968 variables (removed 1) and now considering 2920/2921 (removed 1) transitions.
// Phase 1: matrix 2920 rows 1967 cols
[2023-03-12 10:47:58] [INFO ] Computed 269 place invariants in 54 ms
[2023-03-12 10:47:59] [INFO ] Implicit Places using invariants in 1210 ms returned [1292, 1821]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1227 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1968 places, 2920/2921 transitions.
Applied a total of 0 rules in 102 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1461 ms. Remains : 1965/1968 places, 2920/2921 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1865 0) (EQ s1591 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1614 ms.
Product exploration explored 100000 steps with 50000 reset in 1623 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-10a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10a-LTLCardinality-14 finished in 4994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U p2)||p0))))'
[2023-03-12 10:48:03] [INFO ] Flatten gal took : 184 ms
[2023-03-12 10:48:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 10:48:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1968 places, 2921 transitions and 10144 arcs took 22 ms.
Total runtime 180138 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/931/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ASLink-PT-10a-LTLCardinality-12

BK_STOP 1678618085782

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ASLink-PT-10a-LTLCardinality-12
ltl formula formula --ltl=/tmp/931/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1968 places, 2921 transitions and 10144 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/931/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/931/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.170 user 0.420 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/931/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/931/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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-5348"
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 r009-oct2-167813597500155"
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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;