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.r165-tall-167838850800683.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 itstools
Input is FunctionPointer-PT-b016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850800683
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 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-b016-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679550112680

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b016
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-23 05:41:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 05:41:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:41:54] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-23 05:41:54] [INFO ] Transformed 306 places.
[2023-03-23 05:41:54] [INFO ] Transformed 840 transitions.
[2023-03-23 05:41:54] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 149 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 2 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b016-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 31 place count 191 transition count 526
Iterating global reduction 1 with 22 rules applied. Total rules applied 53 place count 191 transition count 526
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 95 place count 191 transition count 484
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 102 place count 184 transition count 470
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 184 transition count 470
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 121 place count 184 transition count 458
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 182 transition count 454
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 182 transition count 454
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 180 transition count 446
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 180 transition count 446
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 179 transition count 444
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 179 transition count 444
Applied a total of 131 rules in 65 ms. Remains 179 /222 variables (removed 43) and now considering 444/648 (removed 204) transitions.
[2023-03-23 05:41:54] [INFO ] Flow matrix only has 304 transitions (discarded 140 similar events)
// Phase 1: matrix 304 rows 179 cols
[2023-03-23 05:41:54] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-23 05:41:54] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-23 05:41:54] [INFO ] Flow matrix only has 304 transitions (discarded 140 similar events)
[2023-03-23 05:41:54] [INFO ] Invariant cache hit.
[2023-03-23 05:41:54] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-23 05:41:55] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-03-23 05:41:55] [INFO ] Flow matrix only has 304 transitions (discarded 140 similar events)
[2023-03-23 05:41:55] [INFO ] Invariant cache hit.
[2023-03-23 05:41:55] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/222 places, 444/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 799 ms. Remains : 179/222 places, 444/648 transitions.
Support contains 24 out of 179 places after structural reductions.
[2023-03-23 05:41:55] [INFO ] Flatten gal took : 53 ms
[2023-03-23 05:41:55] [INFO ] Flatten gal took : 30 ms
[2023-03-23 05:41:55] [INFO ] Input system was already deterministic with 444 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 05:41:55] [INFO ] Flow matrix only has 304 transitions (discarded 140 similar events)
[2023-03-23 05:41:55] [INFO ] Invariant cache hit.
[2023-03-23 05:41:56] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 05:41:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 05:41:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 05:41:56] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-23 05:41:56] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-23 05:41:56] [INFO ] After 21ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-23 05:41:56] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-23 05:41:56] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 444/444 transitions.
Graph (complete) has 713 edges and 179 vertex of which 154 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.3 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 154 transition count 396
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 143 transition count 372
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 143 transition count 372
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 143 transition count 366
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 83 place count 137 transition count 354
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 137 transition count 354
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 131 transition count 336
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 131 transition count 336
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 107 place count 125 transition count 316
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 125 transition count 316
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 119 place count 119 transition count 300
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 119 transition count 300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 131 place count 113 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 137 place count 113 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 107 transition count 260
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 107 transition count 260
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 155 place count 101 transition count 248
Iterating global reduction 2 with 6 rules applied. Total rules applied 161 place count 101 transition count 248
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 167 place count 95 transition count 236
Iterating global reduction 2 with 6 rules applied. Total rules applied 173 place count 95 transition count 236
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 178 place count 90 transition count 226
Iterating global reduction 2 with 5 rules applied. Total rules applied 183 place count 90 transition count 226
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 188 place count 85 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 193 place count 85 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 196 place count 82 transition count 210
Iterating global reduction 2 with 3 rules applied. Total rules applied 199 place count 82 transition count 210
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 82 transition count 206
Applied a total of 203 rules in 79 ms. Remains 82 /179 variables (removed 97) and now considering 206/444 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 82/179 places, 206/444 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1992908 steps, run timeout after 3001 ms. (steps per millisecond=664 ) properties seen :{}
Probabilistic random walk after 1992908 steps, saw 1240502 distinct states, run finished after 3007 ms. (steps per millisecond=662 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 05:41:59] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
// Phase 1: matrix 126 rows 82 cols
[2023-03-23 05:41:59] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-23 05:41:59] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 05:41:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 05:41:59] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 05:41:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 05:41:59] [INFO ] After 11ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 05:41:59] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 05:41:59] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 82/82 places, 206/206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-23 05:41:59] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2023-03-23 05:41:59] [INFO ] Invariant cache hit.
[2023-03-23 05:41:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-23 05:41:59] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2023-03-23 05:41:59] [INFO ] Invariant cache hit.
[2023-03-23 05:41:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 05:41:59] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-23 05:41:59] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-23 05:41:59] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2023-03-23 05:41:59] [INFO ] Invariant cache hit.
[2023-03-23 05:41:59] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 82/82 places, 206/206 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 82 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 92 place count 76 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 92 place count 76 transition count 103
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 126 place count 59 transition count 103
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 156 place count 44 transition count 88
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 163 place count 37 transition count 74
Iterating global reduction 2 with 7 rules applied. Total rules applied 170 place count 37 transition count 74
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 177 place count 30 transition count 60
Iterating global reduction 2 with 7 rules applied. Total rules applied 184 place count 30 transition count 60
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 23 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 23 transition count 46
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 205 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 205 place count 23 transition count 38
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 207 place count 22 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 20 transition count 38
Applied a total of 211 rules in 13 ms. Remains 20 /82 variables (removed 62) and now considering 38/206 (removed 168) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 20 cols
[2023-03-23 05:41:59] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 05:41:59] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 05:41:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 05:42:00] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 05:42:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 05:42:00] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 05:42:00] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 05:42:00] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA FunctionPointer-PT-b016-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 953 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Graph (complete) has 953 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 167 transition count 418
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 167 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 27 place count 167 transition count 414
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 161 transition count 402
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 161 transition count 402
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 155 transition count 384
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 155 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 149 transition count 362
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 149 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 143 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 143 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 81 place count 137 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 93 place count 131 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 131 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 125 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 119 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 119 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 127 place count 115 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 131 place count 115 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 135 place count 111 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 111 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 108 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 108 transition count 264
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 149 place count 108 transition count 260
Applied a total of 149 rules in 85 ms. Remains 108 /179 variables (removed 71) and now considering 260/444 (removed 184) transitions.
[2023-03-23 05:42:00] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 108 cols
[2023-03-23 05:42:00] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 05:42:00] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-23 05:42:00] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-23 05:42:00] [INFO ] Invariant cache hit.
[2023-03-23 05:42:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 05:42:00] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-23 05:42:00] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-23 05:42:00] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-23 05:42:00] [INFO ] Invariant cache hit.
[2023-03-23 05:42:00] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/179 places, 260/444 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 421 ms. Remains : 108/179 places, 260/444 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-00 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 s97 0)], 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 521 reset in 406 ms.
Product exploration explored 100000 steps with 570 reset in 373 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 3544 steps, including 6 resets, run visited all 1 properties in 12 ms. (steps per millisecond=295 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 260/260 transitions.
Applied a total of 0 rules in 12 ms. Remains 108 /108 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-23 05:42:02] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-23 05:42:02] [INFO ] Invariant cache hit.
[2023-03-23 05:42:02] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-23 05:42:02] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-23 05:42:02] [INFO ] Invariant cache hit.
[2023-03-23 05:42:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 05:42:02] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-23 05:42:02] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-23 05:42:02] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-23 05:42:02] [INFO ] Invariant cache hit.
[2023-03-23 05:42:02] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 108/108 places, 260/260 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 5393 steps, including 7 resets, run visited all 1 properties in 11 ms. (steps per millisecond=490 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 601 reset in 254 ms.
Product exploration explored 100000 steps with 571 reset in 265 ms.
Built C files in :
/tmp/ltsmin17632922312617617808
[2023-03-23 05:42:03] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2023-03-23 05:42:03] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:42:03] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2023-03-23 05:42:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:42:03] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2023-03-23 05:42:03] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:42:03] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17632922312617617808
Running compilation step : cd /tmp/ltsmin17632922312617617808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 579 ms.
Running link step : cd /tmp/ltsmin17632922312617617808;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17632922312617617808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12278206511603964978.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 260/260 transitions.
Applied a total of 0 rules in 17 ms. Remains 108 /108 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-23 05:42:18] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-23 05:42:18] [INFO ] Invariant cache hit.
[2023-03-23 05:42:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-23 05:42:18] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-23 05:42:18] [INFO ] Invariant cache hit.
[2023-03-23 05:42:18] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 05:42:18] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-23 05:42:18] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-23 05:42:18] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-23 05:42:18] [INFO ] Invariant cache hit.
[2023-03-23 05:42:18] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 108/108 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin13647135509525665482
[2023-03-23 05:42:18] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2023-03-23 05:42:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:42:18] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2023-03-23 05:42:18] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:42:18] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2023-03-23 05:42:18] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:42:18] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13647135509525665482
Running compilation step : cd /tmp/ltsmin13647135509525665482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 481 ms.
Running link step : cd /tmp/ltsmin13647135509525665482;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13647135509525665482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7872297734352124819.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 05:42:33] [INFO ] Flatten gal took : 12 ms
[2023-03-23 05:42:33] [INFO ] Flatten gal took : 12 ms
[2023-03-23 05:42:33] [INFO ] Time to serialize gal into /tmp/LTL17320475420194463034.gal : 3 ms
[2023-03-23 05:42:34] [INFO ] Time to serialize properties into /tmp/LTL12563747963549512858.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17320475420194463034.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7725666620894452554.hoa' '-atoms' '/tmp/LTL12563747963549512858.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12563747963549512858.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7725666620894452554.hoa
Detected timeout of ITS tools.
[2023-03-23 05:42:49] [INFO ] Flatten gal took : 12 ms
[2023-03-23 05:42:49] [INFO ] Flatten gal took : 12 ms
[2023-03-23 05:42:49] [INFO ] Time to serialize gal into /tmp/LTL10393259073571114567.gal : 2 ms
[2023-03-23 05:42:49] [INFO ] Time to serialize properties into /tmp/LTL4306962747570292827.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10393259073571114567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4306962747570292827.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(l248<=0)"))))
Formula 0 simplified : GF!"(l248<=0)"
Detected timeout of ITS tools.
[2023-03-23 05:43:04] [INFO ] Flatten gal took : 14 ms
[2023-03-23 05:43:04] [INFO ] Applying decomposition
[2023-03-23 05:43:04] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3623248210134521072.txt' '-o' '/tmp/graph3623248210134521072.bin' '-w' '/tmp/graph3623248210134521072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3623248210134521072.bin' '-l' '-1' '-v' '-w' '/tmp/graph3623248210134521072.weights' '-q' '0' '-e' '0.001'
[2023-03-23 05:43:04] [INFO ] Decomposing Gal with order
[2023-03-23 05:43:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 05:43:04] [INFO ] Removed a total of 434 redundant transitions.
[2023-03-23 05:43:04] [INFO ] Flatten gal took : 47 ms
[2023-03-23 05:43:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 14 ms.
[2023-03-23 05:43:04] [INFO ] Time to serialize gal into /tmp/LTL15343759000533571889.gal : 4 ms
[2023-03-23 05:43:04] [INFO ] Time to serialize properties into /tmp/LTL14767656196541728958.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15343759000533571889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14767656196541728958.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(i9.u32.l248<=0)"))))
Formula 0 simplified : GF!"(i9.u32.l248<=0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2784900489817527971
[2023-03-23 05:43:19] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2784900489817527971
Running compilation step : cd /tmp/ltsmin2784900489817527971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 350 ms.
Running link step : cd /tmp/ltsmin2784900489817527971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2784900489817527971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b016-LTLCardinality-00 finished in 94306 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((p0||(p1 U p2))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 171 transition count 428
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 171 transition count 428
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 171 transition count 420
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 168 transition count 414
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 168 transition count 414
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 165 transition count 406
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 165 transition count 406
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 162 transition count 396
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 162 transition count 396
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 159 transition count 388
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 159 transition count 388
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 156 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 156 transition count 376
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 153 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 153 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 150 transition count 360
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 150 transition count 360
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 147 transition count 354
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 147 transition count 354
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 144 transition count 348
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 144 transition count 348
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 141 transition count 342
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 141 transition count 342
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 139 transition count 338
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 139 transition count 338
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 98 place count 139 transition count 328
Applied a total of 98 rules in 57 ms. Remains 139 /179 variables (removed 40) and now considering 328/444 (removed 116) transitions.
[2023-03-23 05:43:34] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
// Phase 1: matrix 226 rows 139 cols
[2023-03-23 05:43:34] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 05:43:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-23 05:43:34] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-23 05:43:34] [INFO ] Invariant cache hit.
[2023-03-23 05:43:34] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-23 05:43:34] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-23 05:43:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 05:43:34] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-23 05:43:34] [INFO ] Invariant cache hit.
[2023-03-23 05:43:35] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/179 places, 328/444 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 490 ms. Remains : 139/179 places, 328/444 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s109), p2:(LEQ s110 0), p1:(LEQ s130 s126)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 549 reset in 358 ms.
Product exploration explored 100000 steps with 606 reset in 334 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 740 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 541 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 05:43:36] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-23 05:43:36] [INFO ] Invariant cache hit.
[2023-03-23 05:43:36] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 05:43:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 05:43:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 05:43:36] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 05:43:36] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-23 05:43:36] [INFO ] After 42ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 05:43:37] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-23 05:43:37] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 328/328 transitions.
Graph (complete) has 552 edges and 139 vertex of which 115 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 115 transition count 280
Applied a total of 49 rules in 10 ms. Remains 115 /139 variables (removed 24) and now considering 280/328 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 115/139 places, 280/328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-23 05:43:37] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
// Phase 1: matrix 180 rows 115 cols
[2023-03-23 05:43:37] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 05:43:37] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:43:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 05:43:37] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:43:37] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-23 05:43:37] [INFO ] After 25ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 05:43:37] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-23 05:43:37] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 280/280 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 115/115 places, 280/280 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 399120 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 399120 steps, saw 261584 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 05:43:40] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-23 05:43:40] [INFO ] Invariant cache hit.
[2023-03-23 05:43:40] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:43:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 05:43:40] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:43:40] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-23 05:43:40] [INFO ] After 26ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 05:43:40] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-23 05:43:40] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 280/280 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 115/115 places, 280/280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 280/280 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2023-03-23 05:43:40] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-23 05:43:40] [INFO ] Invariant cache hit.
[2023-03-23 05:43:40] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-23 05:43:40] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-23 05:43:40] [INFO ] Invariant cache hit.
[2023-03-23 05:43:40] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-23 05:43:41] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-23 05:43:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 05:43:41] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-23 05:43:41] [INFO ] Invariant cache hit.
[2023-03-23 05:43:41] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 115/115 places, 280/280 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 115 transition count 170
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 120 place count 105 transition count 170
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 120 place count 105 transition count 144
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 172 place count 79 transition count 144
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 206 place count 62 transition count 127
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 213 place count 55 transition count 113
Iterating global reduction 2 with 7 rules applied. Total rules applied 220 place count 55 transition count 113
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 227 place count 48 transition count 99
Iterating global reduction 2 with 7 rules applied. Total rules applied 234 place count 48 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 241 place count 41 transition count 85
Iterating global reduction 2 with 7 rules applied. Total rules applied 248 place count 41 transition count 85
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 255 place count 41 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 255 place count 41 transition count 77
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 257 place count 40 transition count 77
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 267 place count 35 transition count 77
Applied a total of 267 rules in 11 ms. Remains 35 /115 variables (removed 80) and now considering 77/280 (removed 203) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 77 rows 35 cols
[2023-03-23 05:43:41] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 05:43:41] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:43:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 05:43:41] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:43:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 05:43:41] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 05:43:41] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 05:43:41] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p2 p1), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 12 factoid took 661 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 328/328 transitions.
Applied a total of 0 rules in 11 ms. Remains 139 /139 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2023-03-23 05:43:42] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
// Phase 1: matrix 226 rows 139 cols
[2023-03-23 05:43:42] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-23 05:43:42] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-23 05:43:42] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-23 05:43:42] [INFO ] Invariant cache hit.
[2023-03-23 05:43:42] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-23 05:43:42] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-23 05:43:42] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 05:43:42] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-23 05:43:42] [INFO ] Invariant cache hit.
[2023-03-23 05:43:42] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 399 ms. Remains : 139/139 places, 328/328 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 740 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR p0 p1 p2)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p0 p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 498 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 05:43:43] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-23 05:43:43] [INFO ] Invariant cache hit.
[2023-03-23 05:43:43] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 05:43:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 05:43:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 05:43:43] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 05:43:43] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-23 05:43:43] [INFO ] After 38ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 05:43:43] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-23 05:43:43] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 328/328 transitions.
Graph (complete) has 552 edges and 139 vertex of which 115 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 115 transition count 280
Applied a total of 49 rules in 6 ms. Remains 115 /139 variables (removed 24) and now considering 280/328 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 115/139 places, 280/328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 324849 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324849 steps, saw 215352 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 05:43:46] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
// Phase 1: matrix 180 rows 115 cols
[2023-03-23 05:43:46] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 05:43:46] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 05:43:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 05:43:46] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 05:43:46] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-23 05:43:46] [INFO ] After 30ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 05:43:47] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-23 05:43:47] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 280/280 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 115/115 places, 280/280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 280/280 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2023-03-23 05:43:47] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-23 05:43:47] [INFO ] Invariant cache hit.
[2023-03-23 05:43:47] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-23 05:43:47] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-23 05:43:47] [INFO ] Invariant cache hit.
[2023-03-23 05:43:47] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-23 05:43:47] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-23 05:43:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 05:43:47] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-23 05:43:47] [INFO ] Invariant cache hit.
[2023-03-23 05:43:47] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 115/115 places, 280/280 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 115 transition count 170
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 120 place count 105 transition count 170
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 120 place count 105 transition count 144
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 172 place count 79 transition count 144
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 206 place count 62 transition count 127
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 213 place count 55 transition count 113
Iterating global reduction 2 with 7 rules applied. Total rules applied 220 place count 55 transition count 113
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 227 place count 48 transition count 99
Iterating global reduction 2 with 7 rules applied. Total rules applied 234 place count 48 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 241 place count 41 transition count 85
Iterating global reduction 2 with 7 rules applied. Total rules applied 248 place count 41 transition count 85
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 255 place count 41 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 255 place count 41 transition count 77
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 257 place count 40 transition count 77
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 267 place count 35 transition count 77
Applied a total of 267 rules in 8 ms. Remains 35 /115 variables (removed 80) and now considering 77/280 (removed 203) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 77 rows 35 cols
[2023-03-23 05:43:47] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 05:43:47] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 05:43:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 05:43:47] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 05:43:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 05:43:47] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 05:43:47] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 05:43:47] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR p0 p1 p2)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p0 p1 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2)))]
Knowledge based reduction with 12 factoid took 486 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Entered a terminal (fully accepting) state of product in 95926 steps with 581 reset in 278 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-01 finished in 14084 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 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Graph (complete) has 953 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 167 transition count 418
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 167 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 27 place count 167 transition count 414
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 160 transition count 400
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 160 transition count 400
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 154 transition count 382
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 154 transition count 382
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 148 transition count 362
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 148 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 71 place count 142 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 142 transition count 346
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 136 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 136 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 130 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 130 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 124 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 119 place count 118 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 125 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 130 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 135 place count 113 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 140 place count 108 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 145 place count 108 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 105 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 105 transition count 256
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 155 place count 105 transition count 252
Applied a total of 155 rules in 45 ms. Remains 105 /179 variables (removed 74) and now considering 252/444 (removed 192) transitions.
[2023-03-23 05:43:48] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2023-03-23 05:43:48] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 05:43:48] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-23 05:43:48] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-23 05:43:48] [INFO ] Invariant cache hit.
[2023-03-23 05:43:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 05:43:48] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-23 05:43:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 05:43:48] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-23 05:43:48] [INFO ] Invariant cache hit.
[2023-03-23 05:43:49] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/179 places, 252/444 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 531 ms. Remains : 105/179 places, 252/444 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s85 s103)], 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 418 steps with 1 reset in 2 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-02 finished in 705 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((p0||X((G(p1)||X(p0))))) U (p0&&X((p0||X((G(p1)||X(p0)))))))))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 178 transition count 444
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 167 transition count 418
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 167 transition count 418
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 167 transition count 416
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 160 transition count 402
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 160 transition count 402
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 153 transition count 380
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 153 transition count 380
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 146 transition count 356
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 146 transition count 356
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 139 transition count 338
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 139 transition count 338
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 132 transition count 314
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 132 transition count 314
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 102 place count 125 transition count 294
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 125 transition count 294
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 116 place count 118 transition count 280
Iterating global reduction 2 with 7 rules applied. Total rules applied 123 place count 118 transition count 280
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 130 place count 111 transition count 266
Iterating global reduction 2 with 7 rules applied. Total rules applied 137 place count 111 transition count 266
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 106 transition count 256
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 106 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 152 place count 101 transition count 246
Iterating global reduction 2 with 5 rules applied. Total rules applied 157 place count 101 transition count 246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 98 transition count 240
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 98 transition count 240
Applied a total of 163 rules in 27 ms. Remains 98 /179 variables (removed 81) and now considering 240/444 (removed 204) transitions.
[2023-03-23 05:43:49] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2023-03-23 05:43:49] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 05:43:49] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-23 05:43:49] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2023-03-23 05:43:49] [INFO ] Invariant cache hit.
[2023-03-23 05:43:49] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 05:43:49] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-23 05:43:49] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2023-03-23 05:43:49] [INFO ] Invariant cache hit.
[2023-03-23 05:43:49] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/179 places, 240/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 98/179 places, 240/444 transitions.
Stuttering acceptance computed with spot in 384 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 2 s23), p1:(LEQ s80 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 262 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-09 finished in 869 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(G(p0))||G((p1 U p2)))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 178 transition count 444
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 168 transition count 420
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 168 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 168 transition count 418
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 30 place count 161 transition count 404
Iterating global reduction 2 with 7 rules applied. Total rules applied 37 place count 161 transition count 404
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 43 place count 155 transition count 386
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 155 transition count 386
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 149 transition count 366
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 149 transition count 366
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 143 transition count 350
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 143 transition count 350
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 137 transition count 328
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 131 transition count 310
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 131 transition count 310
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 125 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 115 place count 119 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 121 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 126 place count 114 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 131 place count 114 transition count 276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 136 place count 109 transition count 266
Iterating global reduction 2 with 5 rules applied. Total rules applied 141 place count 109 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 107 transition count 262
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 107 transition count 262
Applied a total of 145 rules in 25 ms. Remains 107 /179 variables (removed 72) and now considering 262/444 (removed 182) transitions.
[2023-03-23 05:43:50] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2023-03-23 05:43:50] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-23 05:43:50] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-23 05:43:50] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2023-03-23 05:43:50] [INFO ] Invariant cache hit.
[2023-03-23 05:43:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-23 05:43:50] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-23 05:43:50] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2023-03-23 05:43:50] [INFO ] Invariant cache hit.
[2023-03-23 05:43:50] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/179 places, 262/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 107/179 places, 262/444 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(LEQ 3 s74), p1:(GT s57 s94), p0:(LEQ 1 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 632 steps with 0 reset in 6 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-12 finished in 668 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(F(p0))||(p1&&F(p0)))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Graph (complete) has 953 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 167 transition count 418
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 167 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 27 place count 167 transition count 414
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 161 transition count 402
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 161 transition count 402
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 156 transition count 386
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 156 transition count 386
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 151 transition count 368
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 151 transition count 368
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 146 transition count 356
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 146 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 141 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 141 transition count 340
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 137 transition count 330
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 137 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 133 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 133 transition count 322
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 99 place count 129 transition count 314
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 129 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 127 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 127 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 125 transition count 306
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 125 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 124 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 124 transition count 304
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 121 place count 124 transition count 296
Applied a total of 121 rules in 52 ms. Remains 124 /179 variables (removed 55) and now considering 296/444 (removed 148) transitions.
[2023-03-23 05:43:50] [INFO ] Flow matrix only has 205 transitions (discarded 91 similar events)
// Phase 1: matrix 205 rows 124 cols
[2023-03-23 05:43:50] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 05:43:50] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-23 05:43:50] [INFO ] Flow matrix only has 205 transitions (discarded 91 similar events)
[2023-03-23 05:43:50] [INFO ] Invariant cache hit.
[2023-03-23 05:43:51] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 05:43:51] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-23 05:43:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 05:43:51] [INFO ] Flow matrix only has 205 transitions (discarded 91 similar events)
[2023-03-23 05:43:51] [INFO ] Invariant cache hit.
[2023-03-23 05:43:51] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/179 places, 296/444 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 405 ms. Remains : 124/179 places, 296/444 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), 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=[p1:(GT s47 s93), p0:(LEQ s107 s115)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 733 steps with 2 reset in 7 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-13 finished in 505 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 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Graph (complete) has 953 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 166 transition count 416
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 166 transition count 416
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 29 place count 166 transition count 412
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 159 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 159 transition count 398
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 152 transition count 376
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 152 transition count 376
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 145 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 145 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 78 place count 138 transition count 334
Iterating global reduction 1 with 7 rules applied. Total rules applied 85 place count 138 transition count 334
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 92 place count 131 transition count 310
Iterating global reduction 1 with 7 rules applied. Total rules applied 99 place count 131 transition count 310
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 106 place count 124 transition count 290
Iterating global reduction 1 with 7 rules applied. Total rules applied 113 place count 124 transition count 290
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 120 place count 117 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 127 place count 117 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 134 place count 110 transition count 262
Iterating global reduction 1 with 7 rules applied. Total rules applied 141 place count 110 transition count 262
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 146 place count 105 transition count 252
Iterating global reduction 1 with 5 rules applied. Total rules applied 151 place count 105 transition count 252
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 156 place count 100 transition count 242
Iterating global reduction 1 with 5 rules applied. Total rules applied 161 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 164 place count 97 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 167 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 169 place count 97 transition count 234
Applied a total of 169 rules in 37 ms. Remains 97 /179 variables (removed 82) and now considering 234/444 (removed 210) transitions.
[2023-03-23 05:43:51] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-23 05:43:51] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 05:43:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-23 05:43:51] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 05:43:51] [INFO ] Invariant cache hit.
[2023-03-23 05:43:51] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 05:43:51] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-23 05:43:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 05:43:51] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 05:43:51] [INFO ] Invariant cache hit.
[2023-03-23 05:43:51] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/179 places, 234/444 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 334 ms. Remains : 97/179 places, 234/444 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-14 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 1 s37)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 530 steps with 0 reset in 12 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-14 finished in 635 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((X(p0)||(p0 U (G(p0)||(p0&&(G(p1)||(p1&&F(p2)))))))))))'
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 178 transition count 444
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 167 transition count 418
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 167 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 167 transition count 414
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 160 transition count 400
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 160 transition count 400
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 48 place count 153 transition count 378
Iterating global reduction 2 with 7 rules applied. Total rules applied 55 place count 153 transition count 378
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 146 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 146 transition count 354
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 139 transition count 336
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 139 transition count 336
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 133 transition count 316
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 133 transition count 316
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 127 transition count 300
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 127 transition count 300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 113 place count 121 transition count 288
Iterating global reduction 2 with 6 rules applied. Total rules applied 119 place count 121 transition count 288
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 124 place count 116 transition count 278
Iterating global reduction 2 with 5 rules applied. Total rules applied 129 place count 116 transition count 278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 113 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 110 transition count 266
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 108 transition count 262
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 108 transition count 262
Applied a total of 145 rules in 21 ms. Remains 108 /179 variables (removed 71) and now considering 262/444 (removed 182) transitions.
[2023-03-23 05:43:52] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 108 cols
[2023-03-23 05:43:52] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 05:43:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-23 05:43:52] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-23 05:43:52] [INFO ] Invariant cache hit.
[2023-03-23 05:43:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-23 05:43:52] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-23 05:43:52] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-23 05:43:52] [INFO ] Invariant cache hit.
[2023-03-23 05:43:52] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/179 places, 262/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 108/179 places, 262/444 transitions.
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p0), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p0:(GT 3 s88), p2:(GT s77 s21), p1:(GT s22 s25)], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 181 ms.
Product exploration explored 100000 steps with 20000 reset in 179 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/108 stabilizing places and 64/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10006 steps, including 8 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 05:43:53] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-23 05:43:53] [INFO ] Invariant cache hit.
[2023-03-23 05:43:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 05:43:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 05:43:53] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:43:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 05:43:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 05:43:53] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:43:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-23 05:43:53] [INFO ] After 21ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 05:43:53] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-23 05:43:53] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 262/262 transitions.
Graph (complete) has 439 edges and 108 vertex of which 84 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 84 transition count 214
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 84 transition count 210
Applied a total of 53 rules in 6 ms. Remains 84 /108 variables (removed 24) and now considering 210/262 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 84/108 places, 210/262 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 05:43:53] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
// Phase 1: matrix 131 rows 84 cols
[2023-03-23 05:43:53] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 05:43:53] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 05:43:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 05:43:53] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 05:43:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-23 05:43:53] [INFO ] After 14ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 05:43:53] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-23 05:43:53] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 210/210 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1885095 steps, run timeout after 3001 ms. (steps per millisecond=628 ) properties seen :{}
Probabilistic random walk after 1885095 steps, saw 1173393 distinct states, run finished after 3001 ms. (steps per millisecond=628 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 05:43:57] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-23 05:43:57] [INFO ] Invariant cache hit.
[2023-03-23 05:43:57] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 05:43:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 05:43:57] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 05:43:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-23 05:43:57] [INFO ] After 7ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 05:43:57] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-23 05:43:57] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-23 05:43:57] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-23 05:43:57] [INFO ] Invariant cache hit.
[2023-03-23 05:43:57] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-23 05:43:57] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-23 05:43:57] [INFO ] Invariant cache hit.
[2023-03-23 05:43:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-23 05:43:57] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-23 05:43:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 05:43:57] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-23 05:43:57] [INFO ] Invariant cache hit.
[2023-03-23 05:43:57] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 84/84 places, 210/210 transitions.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 84 transition count 125
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 91 place count 78 transition count 125
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 91 place count 78 transition count 107
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 127 place count 60 transition count 107
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 155 place count 46 transition count 93
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 162 place count 39 transition count 79
Iterating global reduction 2 with 7 rules applied. Total rules applied 169 place count 39 transition count 79
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 34 transition count 69
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 34 transition count 69
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 30 transition count 61
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 30 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 190 place count 30 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 194 place count 28 transition count 63
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 28 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 28 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 27 transition count 59
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 27 transition count 58
Applied a total of 200 rules in 12 ms. Remains 27 /84 variables (removed 57) and now considering 58/210 (removed 152) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 58 rows 27 cols
[2023-03-23 05:43:57] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 05:43:57] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 05:43:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 05:43:57] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 05:43:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 05:43:57] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 05:43:57] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-23 05:43:57] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 238 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 294 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 262/262 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-23 05:43:58] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 108 cols
[2023-03-23 05:43:58] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-23 05:43:58] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-23 05:43:58] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-23 05:43:58] [INFO ] Invariant cache hit.
[2023-03-23 05:43:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-23 05:43:58] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-23 05:43:58] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-23 05:43:58] [INFO ] Invariant cache hit.
[2023-03-23 05:43:58] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 108/108 places, 262/262 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/108 stabilizing places and 64/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10005 steps, including 13 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 05:43:59] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-23 05:43:59] [INFO ] Invariant cache hit.
[2023-03-23 05:43:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 05:43:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 05:43:59] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:43:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 05:43:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 05:43:59] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:43:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-23 05:43:59] [INFO ] After 20ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 05:43:59] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-23 05:43:59] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 262/262 transitions.
Graph (complete) has 439 edges and 108 vertex of which 84 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 84 transition count 214
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 84 transition count 210
Applied a total of 53 rules in 6 ms. Remains 84 /108 variables (removed 24) and now considering 210/262 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 84/108 places, 210/262 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 549831 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 549831 steps, saw 342262 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 05:44:02] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
// Phase 1: matrix 131 rows 84 cols
[2023-03-23 05:44:02] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 05:44:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 05:44:02] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:44:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 05:44:02] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:44:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-23 05:44:02] [INFO ] After 23ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 05:44:02] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-23 05:44:02] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-23 05:44:02] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-23 05:44:02] [INFO ] Invariant cache hit.
[2023-03-23 05:44:02] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-23 05:44:02] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-23 05:44:02] [INFO ] Invariant cache hit.
[2023-03-23 05:44:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-23 05:44:02] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-23 05:44:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 05:44:02] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-23 05:44:02] [INFO ] Invariant cache hit.
[2023-03-23 05:44:03] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 84/84 places, 210/210 transitions.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 84 transition count 125
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 91 place count 78 transition count 125
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 91 place count 78 transition count 107
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 127 place count 60 transition count 107
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 155 place count 46 transition count 93
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 162 place count 39 transition count 79
Iterating global reduction 2 with 7 rules applied. Total rules applied 169 place count 39 transition count 79
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 34 transition count 69
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 34 transition count 69
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 30 transition count 61
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 30 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 190 place count 30 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 194 place count 28 transition count 63
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 28 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 28 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 27 transition count 59
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 27 transition count 58
Applied a total of 200 rules in 8 ms. Remains 27 /84 variables (removed 57) and now considering 58/210 (removed 152) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 58 rows 27 cols
[2023-03-23 05:44:03] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-23 05:44:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 05:44:03] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-23 05:44:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 05:44:03] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:44:03] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:44:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 05:44:03] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:44:03] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 05:44:03] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 05:44:03] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 141 ms.
Product exploration explored 100000 steps with 20000 reset in 151 ms.
Applying partial POR strategy [true, true, true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 262/262 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 258
Applied a total of 4 rules in 20 ms. Remains 108 /108 variables (removed 0) and now considering 258/262 (removed 4) transitions.
[2023-03-23 05:44:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 05:44:05] [INFO ] Flow matrix only has 177 transitions (discarded 81 similar events)
// Phase 1: matrix 177 rows 108 cols
[2023-03-23 05:44:05] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 05:44:05] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/108 places, 258/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 108/108 places, 258/262 transitions.
Built C files in :
/tmp/ltsmin15134210082227962085
[2023-03-23 05:44:05] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15134210082227962085
Running compilation step : cd /tmp/ltsmin15134210082227962085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 370 ms.
Running link step : cd /tmp/ltsmin15134210082227962085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15134210082227962085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1552411732287298115.hoa' '--buchi-type=spotba'
LTSmin run took 146 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b016-LTLCardinality-15 finished in 13765 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)))'
[2023-03-23 05:44:05] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7754158184859879750
[2023-03-23 05:44:05] [INFO ] Computing symmetric may disable matrix : 444 transitions.
[2023-03-23 05:44:05] [INFO ] Applying decomposition
[2023-03-23 05:44:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:44:05] [INFO ] Computing symmetric may enable matrix : 444 transitions.
[2023-03-23 05:44:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:44:05] [INFO ] Flatten gal took : 17 ms
[2023-03-23 05:44:05] [INFO ] Computing Do-Not-Accords matrix : 444 transitions.
[2023-03-23 05:44:05] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 05:44:05] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7754158184859879750
Running compilation step : cd /tmp/ltsmin7754158184859879750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10720273000548277482.txt' '-o' '/tmp/graph10720273000548277482.bin' '-w' '/tmp/graph10720273000548277482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10720273000548277482.bin' '-l' '-1' '-v' '-w' '/tmp/graph10720273000548277482.weights' '-q' '0' '-e' '0.001'
[2023-03-23 05:44:05] [INFO ] Decomposing Gal with order
[2023-03-23 05:44:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 05:44:05] [INFO ] Removed a total of 755 redundant transitions.
[2023-03-23 05:44:06] [INFO ] Flatten gal took : 33 ms
[2023-03-23 05:44:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 261 labels/synchronizations in 13 ms.
[2023-03-23 05:44:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality11963541943410541221.gal : 4 ms
[2023-03-23 05:44:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality17774958301650001517.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11963541943410541221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17774958301650001517.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(G("(i11.i0.u2.l248<=0)"))))
Formula 0 simplified : GF!"(i11.i0.u2.l248<=0)"
Compilation finished in 969 ms.
Running link step : cd /tmp/ltsmin7754158184859879750;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7754158184859879750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.061: Initializing POR dependencies: labels 445, guards 444
pins2lts-mc-linux64( 2/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 1.081: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 1.081: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 1.082: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.179: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 1.183: There are 446 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.183: State length is 180, there are 448 groups
pins2lts-mc-linux64( 0/ 8), 1.183: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.183: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.183: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.183: Visible groups: 0 / 448, labels: 1 / 446
pins2lts-mc-linux64( 0/ 8), 1.183: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 1.183: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 1.275: [Blue] ~120 levels ~960 states ~4424 transitions
pins2lts-mc-linux64( 5/ 8), 1.354: [Blue] ~240 levels ~1920 states ~8840 transitions
pins2lts-mc-linux64( 3/ 8), 1.542: [Blue] ~480 levels ~3840 states ~16784 transitions
pins2lts-mc-linux64( 0/ 8), 1.867: [Blue] ~960 levels ~7680 states ~27616 transitions
pins2lts-mc-linux64( 0/ 8), 2.435: [Blue] ~1920 levels ~15360 states ~54208 transitions
pins2lts-mc-linux64( 2/ 8), 3.437: [Blue] ~3840 levels ~30720 states ~284056 transitions
pins2lts-mc-linux64( 6/ 8), 5.140: [Blue] ~7627 levels ~61440 states ~552376 transitions
pins2lts-mc-linux64( 6/ 8), 8.177: [Blue] ~15063 levels ~122880 states ~1126136 transitions
pins2lts-mc-linux64( 6/ 8), 13.454: [Blue] ~30106 levels ~245760 states ~2316360 transitions
pins2lts-mc-linux64( 6/ 8), 23.455: [Blue] ~59617 levels ~491520 states ~4732280 transitions
pins2lts-mc-linux64( 6/ 8), 43.257: [Blue] ~118935 levels ~983040 states ~9610624 transitions
pins2lts-mc-linux64( 6/ 8), 83.597: [Blue] ~236662 levels ~1966080 states ~19386520 transitions
pins2lts-mc-linux64( 6/ 8), 163.062: [Blue] ~470227 levels ~3932160 states ~38710472 transitions
pins2lts-mc-linux64( 6/ 8), 325.099: [Blue] ~934107 levels ~7864320 states ~78465360 transitions
pins2lts-mc-linux64( 5/ 8), 486.147: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 486.309:
pins2lts-mc-linux64( 0/ 8), 486.309: Explored 10012623 states 56411491 transitions, fanout: 5.634
pins2lts-mc-linux64( 0/ 8), 486.309: Total exploration time 485.090 sec (484.960 sec minimum, 485.031 sec on average)
pins2lts-mc-linux64( 0/ 8), 486.309: States per second: 20641, Transitions per second: 116291
pins2lts-mc-linux64( 0/ 8), 486.309:
pins2lts-mc-linux64( 0/ 8), 486.309: State space has 48089241 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 486.309: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 486.309: blue states: 10012623 (20.82%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 486.309: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 486.309: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 486.309:
pins2lts-mc-linux64( 0/ 8), 486.309: Total memory used for local state coloring: 149.9MB
pins2lts-mc-linux64( 0/ 8), 486.309:
pins2lts-mc-linux64( 0/ 8), 486.309: Queue width: 8B, total height: 9826042, memory: 74.97MB
pins2lts-mc-linux64( 0/ 8), 486.309: Tree memory: 622.9MB, 13.6 B/state, compr.: 1.9%
pins2lts-mc-linux64( 0/ 8), 486.309: Tree fill ratio (roots/leafs): 35.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 486.309: Stored 462 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 486.309: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 486.309: Est. total memory use: 697.9MB (~1099.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7754158184859879750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7754158184859879750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-23 06:04:49] [INFO ] Flatten gal took : 23 ms
[2023-03-23 06:04:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality16220514620085044528.gal : 3 ms
[2023-03-23 06:04:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality16241759835234450006.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16220514620085044528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16241759835234450006.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((F(G("(l248<=0)"))))
Formula 0 simplified : GF!"(l248<=0)"
Detected timeout of ITS tools.
[2023-03-23 06:25:47] [INFO ] Flatten gal took : 324 ms
[2023-03-23 06:25:48] [INFO ] Input system was already deterministic with 444 transitions.
[2023-03-23 06:25:48] [INFO ] Transformed 179 places.
[2023-03-23 06:25:48] [INFO ] Transformed 444 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 06:25:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality9277096913134586838.gal : 7 ms
[2023-03-23 06:25:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality6787901156700838073.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9277096913134586838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6787901156700838073.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(l248<=0)"))))
Formula 0 simplified : GF!"(l248<=0)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 138244 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15428916 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-b016"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FunctionPointer-PT-b016, 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 r165-tall-167838850800683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b016.tgz
mv FunctionPointer-PT-b016 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;