About the Execution of LoLa+red for FunctionPointer-PT-b002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 722.392 | 40736.00 | 56021.00 | 539.60 | T?FFFFTFFTFFFFFF | 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.r167-tall-167838853400659.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is FunctionPointer-PT-b002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853400659
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b002-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b002-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678500877051
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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b002
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:14:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:14:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:14:38] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-11 02:14:38] [INFO ] Transformed 306 places.
[2023-03-11 02:14:38] [INFO ] Transformed 840 transitions.
[2023-03-11 02:14:38] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 146 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.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b002-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 214 transition count 648
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 34 place count 188 transition count 490
Iterating global reduction 1 with 26 rules applied. Total rules applied 60 place count 188 transition count 490
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 88 place count 188 transition count 462
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 102 place count 174 transition count 434
Iterating global reduction 2 with 14 rules applied. Total rules applied 116 place count 174 transition count 434
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 120 place count 174 transition count 430
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 125 place count 169 transition count 420
Iterating global reduction 3 with 5 rules applied. Total rules applied 130 place count 169 transition count 420
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 134 place count 165 transition count 404
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 165 transition count 404
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 142 place count 161 transition count 396
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 161 transition count 396
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 158 transition count 384
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 158 transition count 384
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 156 transition count 376
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 156 transition count 376
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 154 transition count 372
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 154 transition count 372
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 162 place count 152 transition count 368
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 152 transition count 368
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 151 transition count 366
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 151 transition count 366
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 150 transition count 364
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 150 transition count 364
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 149 transition count 362
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 149 transition count 362
Applied a total of 170 rules in 82 ms. Remains 149 /222 variables (removed 73) and now considering 362/648 (removed 286) transitions.
[2023-03-11 02:14:38] [INFO ] Flow matrix only has 252 transitions (discarded 110 similar events)
// Phase 1: matrix 252 rows 149 cols
[2023-03-11 02:14:38] [INFO ] Computed 2 place invariants in 19 ms
[2023-03-11 02:14:39] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-11 02:14:39] [INFO ] Flow matrix only has 252 transitions (discarded 110 similar events)
[2023-03-11 02:14:39] [INFO ] Invariant cache hit.
[2023-03-11 02:14:39] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-11 02:14:39] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2023-03-11 02:14:39] [INFO ] Flow matrix only has 252 transitions (discarded 110 similar events)
[2023-03-11 02:14:39] [INFO ] Invariant cache hit.
[2023-03-11 02:14:39] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 149/222 places, 362/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 892 ms. Remains : 149/222 places, 362/648 transitions.
Support contains 26 out of 149 places after structural reductions.
[2023-03-11 02:14:39] [INFO ] Flatten gal took : 51 ms
[2023-03-11 02:14:39] [INFO ] Flatten gal took : 23 ms
[2023-03-11 02:14:39] [INFO ] Input system was already deterministic with 362 transitions.
Support contains 24 out of 149 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 02:14:40] [INFO ] Flow matrix only has 252 transitions (discarded 110 similar events)
[2023-03-11 02:14:40] [INFO ] Invariant cache hit.
[2023-03-11 02:14:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 02:14:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 02:14:40] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 02:14:40] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-11 02:14:40] [INFO ] After 30ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:14:40] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:14:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 02:14:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 02:14:40] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:14:40] [INFO ] After 24ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 02:14:40] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-11 02:14:40] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 362/362 transitions.
Graph (complete) has 598 edges and 149 vertex of which 126 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 0 output transitions
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 126 transition count 319
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 120 transition count 301
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 120 transition count 301
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 114 transition count 287
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 114 transition count 287
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 109 transition count 275
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 109 transition count 275
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 104 transition count 259
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 104 transition count 259
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 99 transition count 249
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 99 transition count 249
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 95 transition count 239
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 95 transition count 239
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 92 transition count 231
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 92 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 90 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 90 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 88 transition count 223
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 88 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 87 transition count 221
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 87 transition count 221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 86 transition count 219
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 86 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 85 transition count 217
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 85 transition count 217
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 130 place count 85 transition count 213
Applied a total of 130 rules in 63 ms. Remains 85 /149 variables (removed 64) and now considering 213/362 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 85/149 places, 213/362 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 530196 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 530196 steps, saw 330791 distinct states, run finished after 3006 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 02:14:43] [INFO ] Flow matrix only has 134 transitions (discarded 79 similar events)
// Phase 1: matrix 134 rows 85 cols
[2023-03-11 02:14:43] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-11 02:14:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 02:14:43] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 02:14:43] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-11 02:14:43] [INFO ] After 19ms SMT Verify possible using 23 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:14:43] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:14:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 02:14:44] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:14:44] [INFO ] After 13ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 02:14:44] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 02:14:44] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 213/213 transitions.
Applied a total of 0 rules in 12 ms. Remains 85 /85 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 85/85 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-11 02:14:44] [INFO ] Flow matrix only has 134 transitions (discarded 79 similar events)
[2023-03-11 02:14:44] [INFO ] Invariant cache hit.
[2023-03-11 02:14:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 02:14:44] [INFO ] Flow matrix only has 134 transitions (discarded 79 similar events)
[2023-03-11 02:14:44] [INFO ] Invariant cache hit.
[2023-03-11 02:14:44] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-11 02:14:44] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-11 02:14:44] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-11 02:14:44] [INFO ] Flow matrix only has 134 transitions (discarded 79 similar events)
[2023-03-11 02:14:44] [INFO ] Invariant cache hit.
[2023-03-11 02:14:44] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 85/85 places, 213/213 transitions.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 85 transition count 129
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 89 place count 80 transition count 129
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 89 place count 80 transition count 113
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 121 place count 64 transition count 113
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 155 place count 47 transition count 96
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 162 place count 40 transition count 82
Iterating global reduction 2 with 7 rules applied. Total rules applied 169 place count 40 transition count 82
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 176 place count 33 transition count 68
Iterating global reduction 2 with 7 rules applied. Total rules applied 183 place count 33 transition count 68
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 190 place count 26 transition count 54
Iterating global reduction 2 with 7 rules applied. Total rules applied 197 place count 26 transition count 54
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 204 place count 26 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 204 place count 26 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 25 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 24 transition count 46
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 211 place count 24 transition count 43
Applied a total of 211 rules in 14 ms. Remains 24 /85 variables (removed 61) and now considering 43/213 (removed 170) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 43 rows 24 cols
[2023-03-11 02:14:44] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 02:14:44] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 02:14:44] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 02:14:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 02:14:44] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:14:44] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:14:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 02:14:44] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:14:44] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 02:14:44] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 02:14:44] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 794 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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((X(G(p0))&&G(p1)))||G(p2))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 140 transition count 342
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 140 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 140 transition count 340
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 134 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 134 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 128 transition count 312
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 128 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 123 transition count 296
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 123 transition count 296
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 118 transition count 286
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 118 transition count 286
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 114 transition count 276
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 111 transition count 268
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 109 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 107 transition count 260
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 106 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 105 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 104 transition count 254
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 104 transition count 254
Applied a total of 90 rules in 23 ms. Remains 104 /149 variables (removed 45) and now considering 254/362 (removed 108) transitions.
[2023-03-11 02:14:44] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2023-03-11 02:14:44] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 02:14:44] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 02:14:44] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 02:14:44] [INFO ] Invariant cache hit.
[2023-03-11 02:14:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 02:14:44] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-11 02:14:44] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 02:14:44] [INFO ] Invariant cache hit.
[2023-03-11 02:14:45] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/149 places, 254/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 104/149 places, 254/362 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}, { cond=p1, acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 1}, { cond=p1, acceptance={1} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p2:(AND (GT s23 0) (GT 3 s83)), p1:(GT 2 s18), p0:(GT 2 s13)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 346 reset in 301 ms.
Product exploration explored 100000 steps with 322 reset in 225 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 725 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:14:46] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 02:14:46] [INFO ] Invariant cache hit.
[2023-03-11 02:14:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 02:14:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 02:14:46] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 14 factoid took 647 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 254/254 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 252
Applied a total of 2 rules in 20 ms. Remains 104 /104 variables (removed 0) and now considering 252/254 (removed 2) transitions.
[2023-03-11 02:14:47] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2023-03-11 02:14:47] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 02:14:47] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 02:14:47] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-11 02:14:47] [INFO ] Invariant cache hit.
[2023-03-11 02:14:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 02:14:48] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-11 02:14:48] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 02:14:48] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-11 02:14:48] [INFO ] Invariant cache hit.
[2023-03-11 02:14:48] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 252/254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 373 ms. Remains : 104/104 places, 252/254 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/252 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 352 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter insensitive) to 4 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 3018 steps, including 9 resets, run visited all 4 properties in 11 ms. (steps per millisecond=274 )
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 423 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter insensitive) to 4 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 562 reset in 168 ms.
Product exploration explored 100000 steps with 494 reset in 188 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 252/252 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 248
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 234
Applied a total of 16 rules in 26 ms. Remains 97 /104 variables (removed 7) and now considering 234/252 (removed 18) transitions.
[2023-03-11 02:14:50] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-11 02:14:50] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 02:14:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 02:14:50] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 02:14:50] [INFO ] Invariant cache hit.
[2023-03-11 02:14:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 02:14:50] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-11 02:14:50] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-11 02:14:50] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 02:14:50] [INFO ] Invariant cache hit.
[2023-03-11 02:14:50] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/104 places, 234/252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 97/104 places, 234/252 transitions.
Treatment of property FunctionPointer-PT-b002-LTLCardinality-01 finished in 5722 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 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Graph (complete) has 794 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 141 transition count 346
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 141 transition count 346
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 141 transition count 344
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 136 transition count 332
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 136 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 131 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 131 transition count 322
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 127 transition count 310
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 127 transition count 310
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 123 transition count 302
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 123 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 119 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 119 transition count 290
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 116 transition count 280
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 116 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 114 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 112 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 112 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 110 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 108 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 108 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 106 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 106 transition count 260
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 106 transition count 256
Applied a total of 89 rules in 46 ms. Remains 106 /149 variables (removed 43) and now considering 256/362 (removed 106) transitions.
[2023-03-11 02:14:50] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2023-03-11 02:14:50] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:14:50] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 02:14:50] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2023-03-11 02:14:50] [INFO ] Invariant cache hit.
[2023-03-11 02:14:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 02:14:50] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-11 02:14:50] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-11 02:14:50] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2023-03-11 02:14:50] [INFO ] Invariant cache hit.
[2023-03-11 02:14:50] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/149 places, 256/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 388 ms. Remains : 106/149 places, 256/362 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s29 s93)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 541 reset in 159 ms.
Stack based approach found an accepted trace after 50054 steps with 280 reset with depth 19 and stack size 19 in 97 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-02 finished in 692 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))))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 141 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 141 transition count 346
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 141 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 137 transition count 334
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 137 transition count 334
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 133 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 133 transition count 324
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 130 transition count 314
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 130 transition count 314
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 127 transition count 308
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 127 transition count 308
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 124 transition count 300
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 124 transition count 300
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 121 transition count 292
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 121 transition count 292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 119 transition count 288
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 119 transition count 288
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 117 transition count 284
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 116 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 115 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 115 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 114 transition count 278
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 114 transition count 278
Applied a total of 70 rules in 19 ms. Remains 114 /149 variables (removed 35) and now considering 278/362 (removed 84) transitions.
[2023-03-11 02:14:51] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
// Phase 1: matrix 190 rows 114 cols
[2023-03-11 02:14:51] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:14:51] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 02:14:51] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2023-03-11 02:14:51] [INFO ] Invariant cache hit.
[2023-03-11 02:14:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-11 02:14:51] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-11 02:14:51] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2023-03-11 02:14:51] [INFO ] Invariant cache hit.
[2023-03-11 02:14:51] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/149 places, 278/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 114/149 places, 278/362 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LEQ s65 s104) (LEQ 2 s86)), p1:(GT 2 s86)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 338 reset in 218 ms.
Stuttering criterion allowed to conclude after 56744 steps with 201 reset in 133 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-03 finished in 856 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(p0))'
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Graph (complete) has 794 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 142 transition count 344
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 142 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 142 transition count 342
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 137 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 137 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 132 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 132 transition count 318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 128 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 128 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 124 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 124 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 120 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 120 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 117 transition count 280
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 117 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 115 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 115 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 113 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 113 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 112 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 111 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 110 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 110 transition count 266
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 110 transition count 262
Applied a total of 83 rules in 41 ms. Remains 110 /149 variables (removed 39) and now considering 262/362 (removed 100) transitions.
[2023-03-11 02:14:51] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 110 cols
[2023-03-11 02:14:51] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:14:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 02:14:52] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 02:14:52] [INFO ] Invariant cache hit.
[2023-03-11 02:14:52] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-11 02:14:52] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-11 02:14:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 02:14:52] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 02:14:52] [INFO ] Invariant cache hit.
[2023-03-11 02:14:52] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/149 places, 262/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 392 ms. Remains : 110/149 places, 262/362 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s101)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 212 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-04 finished in 437 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((p0 U G((p1 U p2))))||G(!p0)))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 140 transition count 342
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 140 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 140 transition count 340
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 134 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 134 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 128 transition count 312
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 128 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 123 transition count 296
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 123 transition count 296
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 118 transition count 286
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 118 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 113 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 113 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 109 transition count 260
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 109 transition count 260
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 106 transition count 254
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 106 transition count 254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 103 transition count 248
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 103 transition count 248
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 101 transition count 244
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 99 transition count 240
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 97 transition count 236
Applied a total of 104 rules in 17 ms. Remains 97 /149 variables (removed 52) and now considering 236/362 (removed 126) transitions.
[2023-03-11 02:14:52] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2023-03-11 02:14:52] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:14:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 02:14:52] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-11 02:14:52] [INFO ] Invariant cache hit.
[2023-03-11 02:14:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 02:14:52] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-11 02:14:52] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-11 02:14:52] [INFO ] Invariant cache hit.
[2023-03-11 02:14:52] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/149 places, 236/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 97/149 places, 236/362 transitions.
Stuttering acceptance computed with spot in 375 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), p0, (AND p0 (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=8 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GT 1 s9), p2:(GT s28 0), p1:(LEQ 2 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-05 finished in 675 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(p0)))'
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 140 transition count 342
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 140 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 140 transition count 340
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 134 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 134 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 128 transition count 312
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 128 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 123 transition count 296
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 123 transition count 296
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 118 transition count 286
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 118 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 113 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 113 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 109 transition count 260
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 109 transition count 260
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 106 transition count 254
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 106 transition count 254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 103 transition count 248
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 103 transition count 248
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 101 transition count 244
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 99 transition count 240
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 97 transition count 236
Applied a total of 104 rules in 19 ms. Remains 97 /149 variables (removed 52) and now considering 236/362 (removed 126) transitions.
[2023-03-11 02:14:53] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-11 02:14:53] [INFO ] Invariant cache hit.
[2023-03-11 02:14:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 02:14:53] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-11 02:14:53] [INFO ] Invariant cache hit.
[2023-03-11 02:14:53] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 02:14:53] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-11 02:14:53] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-11 02:14:53] [INFO ] Invariant cache hit.
[2023-03-11 02:14:53] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/149 places, 236/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 97/149 places, 236/362 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s46)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-08 finished in 394 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((p0||F(p1))))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 141 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 141 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 135 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 135 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 130 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 130 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 125 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 125 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 121 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 121 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 117 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 117 transition count 284
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 114 transition count 276
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 112 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 112 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 110 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 110 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 109 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 107 transition count 262
Applied a total of 82 rules in 19 ms. Remains 107 /149 variables (removed 42) and now considering 262/362 (removed 100) transitions.
[2023-03-11 02:14:53] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2023-03-11 02:14:53] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:14:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 02:14:53] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2023-03-11 02:14:53] [INFO ] Invariant cache hit.
[2023-03-11 02:14:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-11 02:14:53] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-11 02:14:53] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2023-03-11 02:14:53] [INFO ] Invariant cache hit.
[2023-03-11 02:14:53] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/149 places, 262/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 107/149 places, 262/362 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (GT 1 s85) (GT 3 s75)), p0:(LEQ 2 s94)], 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]]
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b002-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b002-LTLCardinality-09 finished in 1132 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(p0)))'
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 140 transition count 342
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 140 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 140 transition count 340
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 134 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 134 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 128 transition count 312
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 128 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 123 transition count 296
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 123 transition count 296
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 118 transition count 286
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 118 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 113 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 113 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 109 transition count 260
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 109 transition count 260
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 106 transition count 254
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 106 transition count 254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 103 transition count 248
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 103 transition count 248
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 101 transition count 244
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 99 transition count 240
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 97 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 97 transition count 236
Applied a total of 104 rules in 25 ms. Remains 97 /149 variables (removed 52) and now considering 236/362 (removed 126) transitions.
[2023-03-11 02:14:54] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2023-03-11 02:14:54] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 02:14:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 02:14:54] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-11 02:14:54] [INFO ] Invariant cache hit.
[2023-03-11 02:14:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 02:14:54] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-11 02:14:54] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-11 02:14:54] [INFO ] Invariant cache hit.
[2023-03-11 02:14:54] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/149 places, 236/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 97/149 places, 236/362 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s82 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-10 finished in 401 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(p0))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Graph (complete) has 794 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 140 transition count 342
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 140 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 140 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 134 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 134 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 128 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 128 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 124 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 124 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 120 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 120 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 116 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 116 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 113 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 113 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 110 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 110 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 107 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 107 transition count 256
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 105 transition count 252
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 105 transition count 252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 103 transition count 248
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 103 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 101 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 101 transition count 244
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 101 transition count 242
Applied a total of 97 rules in 41 ms. Remains 101 /149 variables (removed 48) and now considering 242/362 (removed 120) transitions.
[2023-03-11 02:14:55] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
// Phase 1: matrix 165 rows 101 cols
[2023-03-11 02:14:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:14:55] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 02:14:55] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
[2023-03-11 02:14:55] [INFO ] Invariant cache hit.
[2023-03-11 02:14:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 02:14:55] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-11 02:14:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 02:14:55] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
[2023-03-11 02:14:55] [INFO ] Invariant cache hit.
[2023-03-11 02:14:55] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/149 places, 242/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 101/149 places, 242/362 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s77 s55)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-11 finished in 383 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(X(G(p0)))))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 362
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 142 transition count 348
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 142 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 142 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 138 transition count 338
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 138 transition count 338
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 26 place count 134 transition count 328
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 130 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 130 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 126 transition count 306
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 126 transition count 306
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 122 transition count 294
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 122 transition count 294
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 119 transition count 284
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 119 transition count 284
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 116 transition count 278
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 116 transition count 278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 113 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 113 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 111 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 109 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 107 transition count 260
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 107 transition count 260
Applied a total of 84 rules in 22 ms. Remains 107 /149 variables (removed 42) and now considering 260/362 (removed 102) transitions.
[2023-03-11 02:14:55] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
// Phase 1: matrix 178 rows 107 cols
[2023-03-11 02:14:55] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 02:14:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-11 02:14:55] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2023-03-11 02:14:55] [INFO ] Invariant cache hit.
[2023-03-11 02:14:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-11 02:14:55] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-11 02:14:55] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2023-03-11 02:14:55] [INFO ] Invariant cache hit.
[2023-03-11 02:14:55] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/149 places, 260/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 107/149 places, 260/362 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s86 s78)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 867 steps with 1 reset in 5 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-14 finished in 539 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(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Graph (complete) has 794 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 140 transition count 342
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 140 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 140 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 134 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 134 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 129 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 129 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 124 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 124 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 119 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 119 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 114 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 114 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 110 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 110 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 107 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 107 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 104 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 104 transition count 250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 102 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 102 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 100 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 100 transition count 242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 98 transition count 238
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 98 transition count 238
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 98 transition count 236
Applied a total of 103 rules in 35 ms. Remains 98 /149 variables (removed 51) and now considering 236/362 (removed 126) transitions.
[2023-03-11 02:14:55] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
// Phase 1: matrix 161 rows 98 cols
[2023-03-11 02:14:55] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 02:14:56] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 02:14:56] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2023-03-11 02:14:56] [INFO ] Invariant cache hit.
[2023-03-11 02:14:56] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 02:14:56] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-11 02:14:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 02:14:56] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2023-03-11 02:14:56] [INFO ] Invariant cache hit.
[2023-03-11 02:14:56] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/149 places, 236/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 353 ms. Remains : 98/149 places, 236/362 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s71 s96)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 216 steps with 1 reset in 0 ms.
FORMULA FunctionPointer-PT-b002-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLCardinality-15 finished in 448 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((X(G(p0))&&G(p1)))||G(p2))))'
Found a Lengthening insensitive property : FunctionPointer-PT-b002-LTLCardinality-01
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 149/149 places, 362/362 transitions.
Graph (complete) has 794 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 140 transition count 342
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 140 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 140 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 134 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 134 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 128 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 128 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 123 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 123 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 118 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 118 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 114 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 109 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 104 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 104 transition count 254
Applied a total of 89 rules in 29 ms. Remains 104 /149 variables (removed 45) and now considering 254/362 (removed 108) transitions.
[2023-03-11 02:14:56] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2023-03-11 02:14:56] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:14:56] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 02:14:56] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 02:14:56] [INFO ] Invariant cache hit.
[2023-03-11 02:14:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 02:14:56] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-11 02:14:56] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 02:14:56] [INFO ] Invariant cache hit.
[2023-03-11 02:14:57] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 104/149 places, 254/362 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 323 ms. Remains : 104/149 places, 254/362 transitions.
Running random walk in product with property : FunctionPointer-PT-b002-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}, { cond=p1, acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 1}, { cond=p1, acceptance={1} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p2:(AND (GT s23 0) (GT 3 s83)), p1:(GT 2 s18), p0:(GT 2 s13)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 271 reset in 178 ms.
Product exploration explored 100000 steps with 316 reset in 187 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 623 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:14:58] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 02:14:58] [INFO ] Invariant cache hit.
[2023-03-11 02:14:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 02:14:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 02:14:58] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 14 factoid took 635 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 254/254 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 252
Applied a total of 2 rules in 12 ms. Remains 104 /104 variables (removed 0) and now considering 252/254 (removed 2) transitions.
[2023-03-11 02:14:59] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2023-03-11 02:14:59] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:14:59] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 02:14:59] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-11 02:14:59] [INFO ] Invariant cache hit.
[2023-03-11 02:14:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 02:14:59] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-11 02:14:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 02:14:59] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-11 02:14:59] [INFO ] Invariant cache hit.
[2023-03-11 02:14:59] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 252/254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 104/104 places, 252/254 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/104 stabilizing places and 64/252 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 408 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter insensitive) to 4 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 5055 steps, including 9 resets, run visited all 4 properties in 50 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 398 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter insensitive) to 4 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 550 reset in 161 ms.
Product exploration explored 100000 steps with 529 reset in 165 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 252/252 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 248
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 234
Applied a total of 16 rules in 15 ms. Remains 97 /104 variables (removed 7) and now considering 234/252 (removed 18) transitions.
[2023-03-11 02:15:01] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-11 02:15:01] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 02:15:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 02:15:01] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 02:15:01] [INFO ] Invariant cache hit.
[2023-03-11 02:15:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 02:15:01] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-11 02:15:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 02:15:01] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 02:15:01] [INFO ] Invariant cache hit.
[2023-03-11 02:15:01] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/104 places, 234/252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 97/104 places, 234/252 transitions.
Treatment of property FunctionPointer-PT-b002-LTLCardinality-01 finished in 5440 ms.
[2023-03-11 02:15:01] [INFO ] Flatten gal took : 18 ms
[2023-03-11 02:15:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 02:15:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 149 places, 362 transitions and 1462 arcs took 4 ms.
Total runtime 23407 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-b002
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality
BK_STOP 1678500917787
--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 FunctionPointer-PT-b002-LTLCardinality-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b002-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 16/32 FunctionPointer-PT-b002-LTLCardinality-01 1875520 m, 375104 m/sec, 2424440 t fired, .
Time elapsed: 5 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b002-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 31/32 FunctionPointer-PT-b002-LTLCardinality-01 3739674 m, 372830 m/sec, 4834199 t fired, .
Time elapsed: 10 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for FunctionPointer-PT-b002-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b002-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b002-LTLCardinality-01: LTL unknown AGGR
Time elapsed: 15 secs. Pages in use: 32
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="FunctionPointer-PT-b002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is FunctionPointer-PT-b002, 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 r167-tall-167838853400659"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b002.tgz
mv FunctionPointer-PT-b002 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;