Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689400468.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689400468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 7.5K Apr 30 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 01:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 30 01:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 85K May 10 09:33 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 AutoFlight-PT-12a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652663010700

Running Version 202205111006
[2022-05-16 01:03:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 01:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:03:32] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2022-05-16 01:03:32] [INFO ] Transformed 307 places.
[2022-05-16 01:03:32] [INFO ] Transformed 305 transitions.
[2022-05-16 01:03:32] [INFO ] Found NUPN structural information;
[2022-05-16 01:03:32] [INFO ] Parsed PT model containing 307 places and 305 transitions in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
FORMULA AutoFlight-PT-12a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 245/245 transitions.
Applied a total of 0 rules in 36 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2022-05-16 01:03:32] [INFO ] Computed 76 place invariants in 19 ms
[2022-05-16 01:03:32] [INFO ] Implicit Places using invariants in 474 ms returned [7, 14, 21, 28, 42, 49, 56, 63, 87, 90, 93, 96, 99, 102, 108, 111, 114, 117, 120, 232, 238, 244, 250, 262, 268, 274, 280, 286, 298, 304]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 503 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 277/307 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 236
Applied a total of 18 rules in 19 ms. Remains 268 /277 variables (removed 9) and now considering 236/245 (removed 9) transitions.
// Phase 1: matrix 236 rows 268 cols
[2022-05-16 01:03:32] [INFO ] Computed 46 place invariants in 7 ms
[2022-05-16 01:03:33] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 236 rows 268 cols
[2022-05-16 01:03:33] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-16 01:03:33] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 01:03:33] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 268/307 places, 236/245 transitions.
Finished structural reductions, in 2 iterations. Remains : 268/307 places, 236/245 transitions.
Support contains 47 out of 268 places after structural reductions.
[2022-05-16 01:03:33] [INFO ] Flatten gal took : 51 ms
[2022-05-16 01:03:33] [INFO ] Flatten gal took : 22 ms
[2022-05-16 01:03:33] [INFO ] Input system was already deterministic with 236 transitions.
Support contains 46 out of 268 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 199 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 31) seen :25
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 236 rows 268 cols
[2022-05-16 01:03:34] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-16 01:03:34] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2022-05-16 01:03:34] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-16 01:03:34] [INFO ] [Nat]Absence check using 46 positive place invariants in 13 ms returned sat
[2022-05-16 01:03:34] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-16 01:03:34] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 01:03:34] [INFO ] After 72ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-16 01:03:34] [INFO ] Deduced a trap composed of 119 places in 62 ms of which 4 ms to minimize.
[2022-05-16 01:03:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-16 01:03:34] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-05-16 01:03:34] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 35 ms.
Support contains 5 out of 268 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 268/268 places, 236/236 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 268 transition count 176
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 208 transition count 176
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 120 place count 208 transition count 146
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 180 place count 178 transition count 146
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 226 place count 155 transition count 123
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 250 place count 155 transition count 99
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 274 place count 131 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 130 transition count 98
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 3 with 95 rules applied. Total rules applied 370 place count 91 transition count 42
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 426 place count 35 transition count 42
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 426 place count 35 transition count 35
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 440 place count 28 transition count 35
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 448 place count 20 transition count 27
Iterating global reduction 5 with 8 rules applied. Total rules applied 456 place count 20 transition count 27
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 464 place count 20 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 466 place count 19 transition count 18
Applied a total of 466 rules in 51 ms. Remains 19 /268 variables (removed 249) and now considering 18/236 (removed 218) transitions.
Finished structural reductions, in 1 iterations. Remains : 19/268 places, 18/236 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=18 )
Computed a total of 6 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||p1))))'
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 267 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 267 transition count 235
Applied a total of 2 rules in 7 ms. Remains 267 /268 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 267 cols
[2022-05-16 01:03:35] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-16 01:03:35] [INFO ] Implicit Places using invariants in 110 ms returned [31, 62, 76, 91, 163, 230, 256, 266]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 111 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/268 places, 235/236 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 256 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 256 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 255 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 255 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 254 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 254 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 253 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 253 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 252 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 252 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 251 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 251 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 250 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 250 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 249 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 249 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 248 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 248 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 247 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 247 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 246 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 246 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 245 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 245 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 244 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 243 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 243 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 242 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 242 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 241 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 241 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 240 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 240 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 239 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 239 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 238 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 238 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 237 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 237 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 236 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 236 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 235 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 235 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 234 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 234 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 233 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 233 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 232 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 232 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 231 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 230 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 230 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 229 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 228 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 228 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 227 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 227 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 226 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 226 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 225 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 225 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 224 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 224 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 223 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 223 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 222 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 222 transition count 198
Applied a total of 74 rules in 122 ms. Remains 222 /259 variables (removed 37) and now considering 198/235 (removed 37) transitions.
// Phase 1: matrix 198 rows 222 cols
[2022-05-16 01:03:35] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-16 01:03:35] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 198 rows 222 cols
[2022-05-16 01:03:35] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-16 01:03:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:03:35] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/268 places, 198/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 222/268 places, 198/236 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (OR (EQ s96 0) (EQ s219 0)) (OR (EQ s67 0) (EQ s159 0))), p0:(OR (EQ s67 0) (EQ s159 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1862 reset in 407 ms.
Stack based approach found an accepted trace after 4751 steps with 90 reset with depth 127 and stack size 118 in 15 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-00 finished in 1074 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U X(G(p0)))||!(p1 U !p2)||X(X(p3))))'
Support contains 5 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 267 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 267 transition count 235
Applied a total of 2 rules in 13 ms. Remains 267 /268 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 267 cols
[2022-05-16 01:03:36] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-16 01:03:36] [INFO ] Implicit Places using invariants in 134 ms returned [62, 69, 76, 91, 163, 256, 266]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 135 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/268 places, 235/236 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 258 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 258 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 257 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 257 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 256 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 256 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 255 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 255 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 254 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 254 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 253 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 253 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 252 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 252 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 251 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 251 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 250 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 250 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 249 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 249 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 248 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 248 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 247 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 247 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 246 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 246 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 245 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 245 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 244 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 244 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 243 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 243 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 242 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 242 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 241 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 241 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 240 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 240 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 239 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 239 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 238 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 238 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 237 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 237 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 236 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 236 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 235 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 235 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 234 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 234 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 233 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 233 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 232 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 232 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 231 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 231 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 230 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 230 transition count 205
Applied a total of 60 rules in 94 ms. Remains 230 /260 variables (removed 30) and now considering 205/235 (removed 30) transitions.
// Phase 1: matrix 205 rows 230 cols
[2022-05-16 01:03:36] [INFO ] Computed 39 place invariants in 2 ms
[2022-05-16 01:03:36] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 205 rows 230 cols
[2022-05-16 01:03:36] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 01:03:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:03:36] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 230/268 places, 205/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 230/268 places, 205/236 transitions.
Stuttering acceptance computed with spot in 640 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p3)), p0, (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 8}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 10}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 10}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 10}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=5 dest: 12}], [{ cond=(AND p0 p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=p0, acceptance={} source=7 dest: 0}, { cond=(NOT p0), acceptance={} source=7 dest: 1}], [{ cond=p0, acceptance={0} source=8 dest: 8}, { cond=(NOT p0), acceptance={0} source=8 dest: 10}], [{ cond=p0, acceptance={} source=9 dest: 1}], [{ cond=p0, acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=11 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=11 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 9}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=12 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 10}, { cond=(AND p0 p1 p2), acceptance={} source=12 dest: 12}]], initial=11, aps=[p0:(EQ s45 1), p3:(OR (EQ s31 0) (EQ s159 0)), p2:(AND (EQ s196 1) (EQ s229 1)), p1:(AND (EQ s31 1) (EQ s159 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 611 ms.
Product exploration explored 100000 steps with 50000 reset in 390 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 12 factoid took 283 ms. Reduced automaton from 13 states, 31 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-12a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLFireability-01 finished in 2454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 267 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 267 transition count 235
Applied a total of 2 rules in 6 ms. Remains 267 /268 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 267 cols
[2022-05-16 01:03:38] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-16 01:03:38] [INFO ] Implicit Places using invariants in 120 ms returned [31, 62, 69, 76, 91, 163, 230, 256, 266]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 122 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/268 places, 235/236 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 255 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 237 transition count 214
Applied a total of 42 rules in 59 ms. Remains 237 /258 variables (removed 21) and now considering 214/235 (removed 21) transitions.
// Phase 1: matrix 214 rows 237 cols
[2022-05-16 01:03:39] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:03:39] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 214 rows 237 cols
[2022-05-16 01:03:39] [INFO ] Computed 37 place invariants in 6 ms
[2022-05-16 01:03:39] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 237/268 places, 214/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 237/268 places, 214/236 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-02 finished in 599 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U p1))||F(p2)))'
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 267 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 267 transition count 235
Applied a total of 2 rules in 15 ms. Remains 267 /268 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 267 cols
[2022-05-16 01:03:39] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-16 01:03:39] [INFO ] Implicit Places using invariants in 131 ms returned [31, 62, 69, 76, 91, 163, 230, 256, 266]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 132 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/268 places, 235/236 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 255 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 219 transition count 196
Applied a total of 78 rules in 154 ms. Remains 219 /258 variables (removed 39) and now considering 196/235 (removed 39) transitions.
// Phase 1: matrix 196 rows 219 cols
[2022-05-16 01:03:39] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 01:03:39] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 196 rows 219 cols
[2022-05-16 01:03:39] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 01:03:39] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/268 places, 196/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 219/268 places, 196/236 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s45 1), p1:(AND (EQ s85 1) (EQ s196 1)), p0:(EQ s60 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 502 ms.
Product exploration explored 100000 steps with 50000 reset in 348 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1))))
Knowledge based reduction with 5 factoid took 322 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-12a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLFireability-03 finished in 1855 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((G(!p1)&&G(!p0)))))'
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 268 transition count 176
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 208 transition count 176
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 120 place count 208 transition count 146
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 180 place count 178 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 177 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 177 transition count 145
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 230 place count 153 transition count 121
Applied a total of 230 rules in 16 ms. Remains 153 /268 variables (removed 115) and now considering 121/236 (removed 115) transitions.
// Phase 1: matrix 121 rows 153 cols
[2022-05-16 01:03:41] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-16 01:03:41] [INFO ] Implicit Places using invariants in 127 ms returned [22, 43, 48, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 88, 123, 144]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 128 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/268 places, 121/236 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 133 transition count 106
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 118 transition count 106
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 30 place count 118 transition count 93
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 56 place count 105 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 103 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 103 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 102 transition count 90
Applied a total of 62 rules in 9 ms. Remains 102 /133 variables (removed 31) and now considering 90/121 (removed 31) transitions.
// Phase 1: matrix 90 rows 102 cols
[2022-05-16 01:03:41] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:03:41] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 90 rows 102 cols
[2022-05-16 01:03:41] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-16 01:03:41] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-16 01:03:41] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/268 places, 90/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 102/268 places, 90/236 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR p1 p0), true, (OR p0 p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(NEQ s7 1), p1:(AND (EQ s81 1) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-04 finished in 436 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 267 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 267 transition count 235
Applied a total of 2 rules in 5 ms. Remains 267 /268 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 267 cols
[2022-05-16 01:03:41] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-16 01:03:41] [INFO ] Implicit Places using invariants in 123 ms returned [31, 62, 69, 76, 163, 230, 256, 266]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 124 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/268 places, 235/236 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 256 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 256 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 255 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 255 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 254 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 254 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 253 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 253 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 252 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 252 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 251 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 251 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 250 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 250 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 249 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 249 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 248 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 248 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 247 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 247 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 246 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 246 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 245 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 245 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 244 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 243 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 243 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 242 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 242 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 241 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 241 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 240 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 240 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 239 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 239 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 238 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 238 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 237 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 237 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 236 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 236 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 235 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 235 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 234 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 234 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 233 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 233 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 232 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 232 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 231 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 230 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 230 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 229 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 228 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 228 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 227 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 227 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 226 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 226 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 225 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 225 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 224 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 224 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 223 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 223 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 222 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 222 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 221 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 221 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 220 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 220 transition count 196
Applied a total of 78 rules in 85 ms. Remains 220 /259 variables (removed 39) and now considering 196/235 (removed 39) transitions.
// Phase 1: matrix 196 rows 220 cols
[2022-05-16 01:03:41] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-16 01:03:42] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 196 rows 220 cols
[2022-05-16 01:03:42] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-16 01:03:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:03:42] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 220/268 places, 196/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 220/268 places, 196/236 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s87 1) (NEQ s198 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 352 steps with 6 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-05 finished in 543 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(p1) U (p2 U (p1 U p3))))||p0))))'
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 268 transition count 180
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 212 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 211 transition count 179
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 114 place count 211 transition count 149
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 174 place count 181 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 180 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 180 transition count 148
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 224 place count 156 transition count 124
Applied a total of 224 rules in 16 ms. Remains 156 /268 variables (removed 112) and now considering 124/236 (removed 112) transitions.
// Phase 1: matrix 124 rows 156 cols
[2022-05-16 01:03:42] [INFO ] Computed 46 place invariants in 1 ms
[2022-05-16 01:03:42] [INFO ] Implicit Places using invariants in 98 ms returned [42, 48, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 91, 126, 155]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 99 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/268 places, 124/236 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 137 transition count 115
Reduce places removed 9 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 22 rules applied. Total rules applied 31 place count 128 transition count 102
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 44 place count 115 transition count 102
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 44 place count 115 transition count 99
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 112 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 110 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 110 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 109 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 109 transition count 96
Applied a total of 56 rules in 8 ms. Remains 109 /137 variables (removed 28) and now considering 96/124 (removed 28) transitions.
// Phase 1: matrix 96 rows 109 cols
[2022-05-16 01:03:42] [INFO ] Computed 27 place invariants in 0 ms
[2022-05-16 01:03:42] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 96 rows 109 cols
[2022-05-16 01:03:42] [INFO ] Computed 27 place invariants in 0 ms
[2022-05-16 01:03:42] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-16 01:03:42] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/268 places, 96/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 109/268 places, 96/236 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) (NOT p1) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s43 1) (EQ s53 1)), p3:(AND (EQ s103 1) (EQ s108 1)), p1:(AND (EQ s21 1) (EQ s55 1)), p2:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-07 finished in 509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(X(X(G(F(p0)))) U X(p1)))))'
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 267 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 267 transition count 235
Applied a total of 2 rules in 5 ms. Remains 267 /268 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 267 cols
[2022-05-16 01:03:42] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-16 01:03:42] [INFO ] Implicit Places using invariants in 113 ms returned [31, 62, 69, 76, 91, 163, 230, 256, 266]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 114 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/268 places, 235/236 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 255 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 219 transition count 196
Applied a total of 78 rules in 82 ms. Remains 219 /258 variables (removed 39) and now considering 196/235 (removed 39) transitions.
// Phase 1: matrix 196 rows 219 cols
[2022-05-16 01:03:43] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 01:03:43] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 196 rows 219 cols
[2022-05-16 01:03:43] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 01:03:43] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/268 places, 196/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 219/268 places, 196/236 transitions.
Stuttering acceptance computed with spot in 141 ms :[p1, p1, p1, (AND p1 p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s60 1), p0:(AND (EQ s7 1) (EQ s147 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1844 reset in 228 ms.
Stack based approach found an accepted trace after 12652 steps with 237 reset with depth 179 and stack size 141 in 33 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-08 finished in 855 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(p1)||X(X(p2))))))'
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 267 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 267 transition count 235
Applied a total of 2 rules in 8 ms. Remains 267 /268 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 267 cols
[2022-05-16 01:03:43] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-16 01:03:43] [INFO ] Implicit Places using invariants in 146 ms returned [31, 62, 69, 76, 91, 230, 256, 266]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 148 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/268 places, 235/236 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 257 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 257 transition count 233
Applied a total of 4 rules in 6 ms. Remains 257 /259 variables (removed 2) and now considering 233/235 (removed 2) transitions.
// Phase 1: matrix 233 rows 257 cols
[2022-05-16 01:03:43] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-16 01:03:43] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 233 rows 257 cols
[2022-05-16 01:03:43] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-16 01:03:44] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 257/268 places, 233/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 257/268 places, 233/236 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p0:(EQ s30 0), p1:(EQ s27 1), p2:(AND (EQ s158 1) (EQ s256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 392 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1) (NOT p2))
Knowledge based reduction with 7 factoid took 343 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-12a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLFireability-10 finished in 1766 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 262 transition count 153
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 169 place count 180 transition count 153
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 169 place count 180 transition count 128
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 231 place count 143 transition count 128
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 231 place count 143 transition count 116
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 255 place count 131 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 256 place count 130 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 130 transition count 115
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 307 place count 105 transition count 90
Applied a total of 307 rules in 12 ms. Remains 105 /268 variables (removed 163) and now considering 90/236 (removed 146) transitions.
// Phase 1: matrix 90 rows 105 cols
[2022-05-16 01:03:45] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 01:03:45] [INFO ] Implicit Places using invariants in 66 ms returned [61, 84, 98, 104]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 68 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/268 places, 90/236 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 98 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 98 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 97 transition count 86
Applied a total of 8 rules in 5 ms. Remains 97 /101 variables (removed 4) and now considering 86/90 (removed 4) transitions.
// Phase 1: matrix 86 rows 97 cols
[2022-05-16 01:03:45] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 01:03:45] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 86 rows 97 cols
[2022-05-16 01:03:45] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 01:03:45] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/268 places, 86/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 97/268 places, 86/236 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s42 1) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-11 finished in 283 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(p1))))'
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 267 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 267 transition count 235
Applied a total of 2 rules in 5 ms. Remains 267 /268 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 267 cols
[2022-05-16 01:03:45] [INFO ] Computed 46 place invariants in 9 ms
[2022-05-16 01:03:45] [INFO ] Implicit Places using invariants in 144 ms returned [31, 62, 69, 91, 163, 230, 256, 266]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 145 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/268 places, 235/236 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 256 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 256 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 255 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 255 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 254 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 254 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 253 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 253 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 252 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 252 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 251 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 251 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 250 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 250 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 249 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 249 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 248 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 248 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 247 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 247 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 246 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 246 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 245 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 245 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 244 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 243 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 243 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 242 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 242 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 241 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 241 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 240 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 240 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 239 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 239 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 238 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 238 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 237 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 237 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 236 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 236 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 235 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 235 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 234 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 234 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 233 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 233 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 232 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 232 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 231 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 230 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 230 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 229 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 228 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 228 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 227 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 227 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 226 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 226 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 225 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 225 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 224 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 224 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 223 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 223 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 222 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 222 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 221 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 221 transition count 197
Applied a total of 76 rules in 81 ms. Remains 221 /259 variables (removed 38) and now considering 197/235 (removed 38) transitions.
// Phase 1: matrix 197 rows 221 cols
[2022-05-16 01:03:45] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-16 01:03:46] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 197 rows 221 cols
[2022-05-16 01:03:46] [INFO ] Computed 38 place invariants in 4 ms
[2022-05-16 01:03:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:03:46] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 221/268 places, 197/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 221/268 places, 197/236 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s79 1), p0:(AND (EQ s73 1) (EQ s146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-12 finished in 602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(X(p0))&&p1))&&p2)))'
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 267 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 267 transition count 235
Applied a total of 2 rules in 11 ms. Remains 267 /268 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 267 cols
[2022-05-16 01:03:46] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-16 01:03:46] [INFO ] Implicit Places using invariants in 125 ms returned [31, 62, 69, 76, 91, 163, 230, 256, 266]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 126 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/268 places, 235/236 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 255 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 219 transition count 196
Applied a total of 78 rules in 100 ms. Remains 219 /258 variables (removed 39) and now considering 196/235 (removed 39) transitions.
// Phase 1: matrix 196 rows 219 cols
[2022-05-16 01:03:46] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:03:46] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 196 rows 219 cols
[2022-05-16 01:03:46] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:03:46] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/268 places, 196/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 219/268 places, 196/236 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (EQ s53 1) (AND (EQ s33 1) (EQ s190 1))), p2:(EQ s26 0), p0:(OR (EQ s79 0) (EQ s184 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-13 finished in 665 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(G(F(p0)))))))'
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 262 transition count 156
Reduce places removed 79 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 164 place count 183 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 165 place count 182 transition count 155
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 165 place count 182 transition count 130
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 227 place count 145 transition count 130
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 227 place count 145 transition count 118
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 251 place count 133 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 252 place count 132 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 253 place count 132 transition count 117
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 301 place count 108 transition count 93
Applied a total of 301 rules in 23 ms. Remains 108 /268 variables (removed 160) and now considering 93/236 (removed 143) transitions.
// Phase 1: matrix 93 rows 108 cols
[2022-05-16 01:03:46] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 01:03:47] [INFO ] Implicit Places using invariants in 67 ms returned [64, 87, 101, 107]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 68 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/268 places, 93/236 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 101 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 101 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 100 transition count 89
Applied a total of 8 rules in 6 ms. Remains 100 /104 variables (removed 4) and now considering 89/93 (removed 4) transitions.
// Phase 1: matrix 89 rows 100 cols
[2022-05-16 01:03:47] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 01:03:47] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 89 rows 100 cols
[2022-05-16 01:03:47] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-16 01:03:47] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/268 places, 89/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 100/268 places, 89/236 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s49 0) (EQ s15 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3218 reset in 218 ms.
Product exploration explored 100000 steps with 3216 reset in 198 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 100 cols
[2022-05-16 01:03:48] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 01:03:48] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 89 rows 100 cols
[2022-05-16 01:03:48] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-16 01:03:48] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2022-05-16 01:03:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 89 rows 100 cols
[2022-05-16 01:03:48] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 01:03:48] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 89/89 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 64 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3203 reset in 204 ms.
Product exploration explored 100000 steps with 3217 reset in 220 ms.
Built C files in :
/tmp/ltsmin1785632341309092329
[2022-05-16 01:03:49] [INFO ] Computing symmetric may disable matrix : 89 transitions.
[2022-05-16 01:03:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:03:49] [INFO ] Computing symmetric may enable matrix : 89 transitions.
[2022-05-16 01:03:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:03:49] [INFO ] Computing Do-Not-Accords matrix : 89 transitions.
[2022-05-16 01:03:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:03:49] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1785632341309092329
Running compilation step : cd /tmp/ltsmin1785632341309092329;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 353 ms.
Running link step : cd /tmp/ltsmin1785632341309092329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin1785632341309092329;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12107187852250157264.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 100 cols
[2022-05-16 01:04:04] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 01:04:04] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 89 rows 100 cols
[2022-05-16 01:04:04] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 01:04:04] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2022-05-16 01:04:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 89 rows 100 cols
[2022-05-16 01:04:04] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 01:04:04] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 89/89 transitions.
Built C files in :
/tmp/ltsmin13040660886472021890
[2022-05-16 01:04:04] [INFO ] Computing symmetric may disable matrix : 89 transitions.
[2022-05-16 01:04:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:04:04] [INFO ] Computing symmetric may enable matrix : 89 transitions.
[2022-05-16 01:04:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:04:04] [INFO ] Computing Do-Not-Accords matrix : 89 transitions.
[2022-05-16 01:04:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:04:04] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13040660886472021890
Running compilation step : cd /tmp/ltsmin13040660886472021890;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 197 ms.
Running link step : cd /tmp/ltsmin13040660886472021890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13040660886472021890;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6960792219385123708.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:04:19] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:04:19] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:04:19] [INFO ] Time to serialize gal into /tmp/LTL6113501852222410338.gal : 1 ms
[2022-05-16 01:04:19] [INFO ] Time to serialize properties into /tmp/LTL10471378012380595606.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6113501852222410338.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10471378012380595606.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6113501...267
Read 1 LTL properties
Checking formula 0 : !((G(X(G(X(G(F("((p139==0)&&(p26==0))"))))))))
Formula 0 simplified : !GXGXGF"((p139==0)&&(p26==0))"
Reverse transition relation is NOT exact ! Due to transitions t45, t145.t144.t143.t142.t141.t140.t139.t138.t137.t136.t135.t134.t133.t216.t215.t214.t213.t21...355
Computing Next relation with stutter on 24 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
24 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.274589,28336,1,0,226,58366,208,108,2913,58334,326
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-12a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-12a-LTLFireability-14 finished in 33302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(F(p1))||G(p2))&&p0))))'
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 236/236 transitions.
Applied a total of 0 rules in 6 ms. Remains 268 /268 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 268 cols
[2022-05-16 01:04:20] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-16 01:04:20] [INFO ] Implicit Places using invariants in 141 ms returned [31, 69, 76, 91, 163, 230, 256]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 142 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/268 places, 236/236 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 258 transition count 233
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 258 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 257 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 257 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 250 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 250 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 249 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 249 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 248 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 248 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 247 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 247 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 246 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 246 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 245 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 245 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 244 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 244 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 241 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 241 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 237 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 237 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 236 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 236 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 235 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 235 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 234 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 234 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 233 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 233 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 232 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 232 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 231 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 231 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 230 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 230 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 229 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 229 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 228 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 228 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 227 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 227 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 226 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 226 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 225 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 225 transition count 200
Applied a total of 72 rules in 95 ms. Remains 225 /261 variables (removed 36) and now considering 200/236 (removed 36) transitions.
// Phase 1: matrix 200 rows 225 cols
[2022-05-16 01:04:20] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-16 01:04:20] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 200 rows 225 cols
[2022-05-16 01:04:20] [INFO ] Computed 39 place invariants in 2 ms
[2022-05-16 01:04:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:04:20] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 225/268 places, 200/236 transitions.
Finished structural reductions, in 2 iterations. Remains : 225/268 places, 200/236 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s64 1) (EQ s61 1) (EQ s159 1)), p1:(EQ s11 1), p2:(AND (EQ s214 1) (EQ s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-15 finished in 703 ms.
All properties solved by simple procedures.
Total runtime 48899 ms.

BK_STOP 1652663061042

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="AutoFlight-PT-12a"
export BK_EXAMINATION="LTLFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-12a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689400468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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