fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037990100466
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for AutoFlight-PT-12a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
786.308 82806.00 67870.00 17950.50 FFFTFFFTFFFTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990100466.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 r007-tall-162037990100466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 01:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 01:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 85K May 5 16:51 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-00
FORMULA_NAME AutoFlight-PT-12a-01
FORMULA_NAME AutoFlight-PT-12a-02
FORMULA_NAME AutoFlight-PT-12a-03
FORMULA_NAME AutoFlight-PT-12a-04
FORMULA_NAME AutoFlight-PT-12a-05
FORMULA_NAME AutoFlight-PT-12a-06
FORMULA_NAME AutoFlight-PT-12a-07
FORMULA_NAME AutoFlight-PT-12a-08
FORMULA_NAME AutoFlight-PT-12a-09
FORMULA_NAME AutoFlight-PT-12a-10
FORMULA_NAME AutoFlight-PT-12a-11
FORMULA_NAME AutoFlight-PT-12a-12
FORMULA_NAME AutoFlight-PT-12a-13
FORMULA_NAME AutoFlight-PT-12a-14
FORMULA_NAME AutoFlight-PT-12a-15

=== Now, execution of the tool begins

BK_START 1620471531233

Running Version 0
[2021-05-08 10:59:08] [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]
[2021-05-08 10:59:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:59:08] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-08 10:59:08] [INFO ] Transformed 307 places.
[2021-05-08 10:59:08] [INFO ] Transformed 305 transitions.
[2021-05-08 10:59:08] [INFO ] Found NUPN structural information;
[2021-05-08 10:59:08] [INFO ] Parsed PT model containing 307 places and 305 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 10:59:08] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
FORMULA AutoFlight-PT-12a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 307 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 307/307 places, 245/245 transitions.
Applied a total of 0 rules in 38 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2021-05-08 10:59:08] [INFO ] Computed 76 place invariants in 26 ms
[2021-05-08 10:59:09] [INFO ] Implicit Places using invariants in 537 ms returned [7, 28, 35, 42, 49, 56, 63, 70, 84, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 182, 232, 238, 244, 250, 256, 262, 268, 274, 280, 286, 292, 298, 304]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 565 ms to find 35 implicit places.
// Phase 1: matrix 245 rows 272 cols
[2021-05-08 10:59:09] [INFO ] Computed 41 place invariants in 7 ms
[2021-05-08 10:59:09] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Starting structural reductions, iteration 1 : 272/307 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 262 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 262 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 261 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 261 transition count 234
Applied a total of 22 rules in 39 ms. Remains 261 /272 variables (removed 11) and now considering 234/245 (removed 11) transitions.
// Phase 1: matrix 234 rows 261 cols
[2021-05-08 10:59:09] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-08 10:59:09] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 234 rows 261 cols
[2021-05-08 10:59:09] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-08 10:59:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-08 10:59:09] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 261/307 places, 234/245 transitions.
[2021-05-08 10:59:09] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-08 10:59:09] [INFO ] Flatten gal took : 45 ms
FORMULA AutoFlight-PT-12a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 10:59:10] [INFO ] Flatten gal took : 19 ms
[2021-05-08 10:59:10] [INFO ] Input system was already deterministic with 234 transitions.
Incomplete random walk after 100000 steps, including 1828 resets, run finished after 421 ms. (steps per millisecond=237 ) properties (out of 27) seen :26
Running SMT prover for 1 properties.
// Phase 1: matrix 234 rows 261 cols
[2021-05-08 10:59:10] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-08 10:59:10] [INFO ] [Real]Absence check using 41 positive place invariants in 8 ms returned sat
[2021-05-08 10:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:59:10] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-08 10:59:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-08 10:59:10] [INFO ] [Real]Added 12 Read/Feed constraints in 3 ms returned sat
[2021-05-08 10:59:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:59:10] [INFO ] [Nat]Absence check using 41 positive place invariants in 10 ms returned sat
[2021-05-08 10:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:59:10] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-08 10:59:10] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2021-05-08 10:59:10] [INFO ] Computed and/alt/rep : 229/466/229 causal constraints (skipped 4 transitions) in 15 ms.
[2021-05-08 10:59:11] [INFO ] Added : 116 causal constraints over 24 iterations in 407 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((G(p0)&&F(p1)))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 257 transition count 230
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 257 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 250 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 250 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 249 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 249 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 248 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 248 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 247 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 247 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 246 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 246 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 245 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 245 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 244 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 244 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 241 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 241 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 237 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 237 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 236 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 236 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 235 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 235 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 234 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 234 transition count 207
Applied a total of 54 rules in 139 ms. Remains 234 /261 variables (removed 27) and now considering 207/234 (removed 27) transitions.
// Phase 1: matrix 207 rows 234 cols
[2021-05-08 10:59:11] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-08 10:59:11] [INFO ] Implicit Places using invariants in 88 ms returned [13, 20, 69, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 90 ms to find 4 implicit places.
// Phase 1: matrix 207 rows 230 cols
[2021-05-08 10:59:11] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:11] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Starting structural reductions, iteration 1 : 230/261 places, 207/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 220 transition count 197
Applied a total of 20 rules in 54 ms. Remains 220 /230 variables (removed 10) and now considering 197/207 (removed 10) transitions.
// Phase 1: matrix 197 rows 220 cols
[2021-05-08 10:59:11] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:11] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 197 rows 220 cols
[2021-05-08 10:59:11] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:11] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 220/261 places, 197/234 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 p0 p1), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 1}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s94 1), p2:(NEQ s133 1), p1:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-12a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-00 finished in 951 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(G((p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 257 transition count 230
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 257 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 250 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 250 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 249 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 249 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 248 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 248 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 247 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 247 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 246 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 246 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 245 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 245 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 244 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 244 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 241 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 241 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 237 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 237 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 236 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 236 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 235 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 235 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 234 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 234 transition count 207
Applied a total of 54 rules in 118 ms. Remains 234 /261 variables (removed 27) and now considering 207/234 (removed 27) transitions.
// Phase 1: matrix 207 rows 234 cols
[2021-05-08 10:59:12] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-08 10:59:12] [INFO ] Implicit Places using invariants in 80 ms returned [20, 69, 233]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 82 ms to find 3 implicit places.
// Phase 1: matrix 207 rows 231 cols
[2021-05-08 10:59:12] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-08 10:59:12] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Starting structural reductions, iteration 1 : 231/261 places, 207/234 transitions.
Applied a total of 0 rules in 4 ms. Remains 231 /231 variables (removed 0) and now considering 207/207 (removed 0) transitions.
// Phase 1: matrix 207 rows 231 cols
[2021-05-08 10:59:12] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-08 10:59:12] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 2 iterations. Remains : 231/261 places, 207/234 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-12a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s15 1), p2:(OR (EQ s134 1) (EQ s125 1)), p1:(AND (EQ s13 1) (EQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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 1 ms.
FORMULA AutoFlight-PT-12a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-01 finished in 554 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U G(!p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 258 transition count 231
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 258 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 257 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 257 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 250 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 250 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 249 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 249 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 248 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 248 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 247 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 247 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 246 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 246 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 245 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 245 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 244 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 244 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 241 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 241 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 237 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 237 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 236 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 236 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 235 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 235 transition count 208
Applied a total of 52 rules in 125 ms. Remains 235 /261 variables (removed 26) and now considering 208/234 (removed 26) transitions.
// Phase 1: matrix 208 rows 235 cols
[2021-05-08 10:59:12] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-08 10:59:12] [INFO ] Implicit Places using invariants in 87 ms returned [13, 20, 69]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 88 ms to find 3 implicit places.
// Phase 1: matrix 208 rows 232 cols
[2021-05-08 10:59:12] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-08 10:59:13] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Starting structural reductions, iteration 1 : 232/261 places, 208/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 231 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 229 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 228 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 228 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 227 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 227 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 226 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 226 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 225 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 225 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 224 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 224 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 223 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 223 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 222 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 222 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 221 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 221 transition count 197
Applied a total of 22 rules in 23 ms. Remains 221 /232 variables (removed 11) and now considering 197/208 (removed 11) transitions.
// Phase 1: matrix 197 rows 221 cols
[2021-05-08 10:59:13] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-08 10:59:13] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 197 rows 221 cols
[2021-05-08 10:59:13] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-08 10:59:13] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 221/261 places, 197/234 transitions.
Stuttering acceptance computed with spot in 74 ms :[p0, p0, p0, true]
Running random walk in product with property : AutoFlight-PT-12a-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s202 1) (EQ s220 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1826 reset in 358 ms.
Entered a terminal (fully accepting) state of product in 83391 steps with 1560 reset in 259 ms.
FORMULA AutoFlight-PT-12a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-02 finished in 1228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 234/234 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 257 transition count 156
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 180 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 179 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 159 place count 179 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 221 place count 142 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 221 place count 142 transition count 118
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 245 place count 130 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 248 place count 127 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 251 place count 127 transition count 115
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 303 place count 101 transition count 89
Applied a total of 303 rules in 29 ms. Remains 101 /261 variables (removed 160) and now considering 89/234 (removed 145) transitions.
// Phase 1: matrix 89 rows 101 cols
[2021-05-08 10:59:14] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-08 10:59:14] [INFO ] Implicit Places using invariants in 37 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
[2021-05-08 10:59:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 89 rows 100 cols
[2021-05-08 10:59:14] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-08 10:59:14] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 100/261 places, 89/234 transitions.
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 2 place count 99 transition count 88
Applied a total of 2 rules in 5 ms. Remains 99 /100 variables (removed 1) and now considering 88/89 (removed 1) transitions.
// Phase 1: matrix 88 rows 99 cols
[2021-05-08 10:59:14] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-08 10:59:14] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 88 rows 99 cols
[2021-05-08 10:59:14] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:59:14] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 99/261 places, 88/234 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-03 automaton TGBA [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:(NEQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3198 reset in 208 ms.
Product exploration explored 100000 steps with 3205 reset in 313 ms.
Knowledge obtained : [p0]
java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, -F, /tmp/comp614067027088201957.hoa, --product-and=/tmp/a217096681620723664474.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.isProductEmpty(SpotRunner.java:619)
at fr.lip6.move.gal.application.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:384)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:174)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3187 reset in 207 ms.
Product exploration explored 100000 steps with 3176 reset in 223 ms.
[2021-05-08 10:59:29] [INFO ] Flatten gal took : 12 ms
[2021-05-08 10:59:29] [INFO ] Flatten gal took : 5 ms
[2021-05-08 10:59:29] [INFO ] Time to serialize gal into /tmp/LTL18403846637215305992.gal : 2 ms
[2021-05-08 10:59:29] [INFO ] Time to serialize properties into /tmp/LTL6492718125148811551.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18403846637215305992.gal, -t, CGAL, -LTL, /tmp/LTL6492718125148811551.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18403846637215305992.gal -t CGAL -LTL /tmp/LTL6492718125148811551.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p154!=1)"))))
Formula 0 simplified : !GF"(p154!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 24 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
15 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.157057,22072,1,0,57,28986,24,30,2297,15572,140
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-12a-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-12a-03 finished in 15919 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((p0 U p1))||G(!p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 234/234 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 257 transition count 158
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 154 place count 182 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 181 transition count 157
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 155 place count 181 transition count 132
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 217 place count 144 transition count 132
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 217 place count 144 transition count 120
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 241 place count 132 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 244 place count 129 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 247 place count 129 transition count 117
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 299 place count 103 transition count 91
Applied a total of 299 rules in 15 ms. Remains 103 /261 variables (removed 158) and now considering 91/234 (removed 143) transitions.
// Phase 1: matrix 91 rows 103 cols
[2021-05-08 10:59:29] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-08 10:59:29] [INFO ] Implicit Places using invariants in 59 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
[2021-05-08 10:59:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 91 rows 102 cols
[2021-05-08 10:59:29] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:59:30] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Starting structural reductions, iteration 1 : 102/261 places, 91/234 transitions.
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 2 place count 101 transition count 90
Applied a total of 2 rules in 9 ms. Remains 101 /102 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 101 cols
[2021-05-08 10:59:30] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:59:30] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 90 rows 101 cols
[2021-05-08 10:59:30] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-08 10:59:30] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 101/261 places, 90/234 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-12a-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s48 1), p0:(EQ s50 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3159 reset in 296 ms.
Stack based approach found an accepted trace after 1752 steps with 53 reset with depth 78 and stack size 78 in 6 ms.
FORMULA AutoFlight-PT-12a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-05 finished in 666 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((F(p0) U p1)&&(p2||X(X(X(p3)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 257 transition count 230
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 257 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 250 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 250 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 249 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 249 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 248 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 248 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 247 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 247 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 246 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 246 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 245 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 245 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 244 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 244 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 241 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 241 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 237 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 237 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 236 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 236 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 235 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 235 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 234 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 234 transition count 207
Applied a total of 54 rules in 76 ms. Remains 234 /261 variables (removed 27) and now considering 207/234 (removed 27) transitions.
// Phase 1: matrix 207 rows 234 cols
[2021-05-08 10:59:30] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-08 10:59:30] [INFO ] Implicit Places using invariants in 252 ms returned [13, 20, 69, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 254 ms to find 4 implicit places.
// Phase 1: matrix 207 rows 230 cols
[2021-05-08 10:59:30] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-08 10:59:30] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Starting structural reductions, iteration 1 : 230/261 places, 207/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 219 transition count 196
Applied a total of 22 rules in 25 ms. Remains 219 /230 variables (removed 11) and now considering 196/207 (removed 11) transitions.
// Phase 1: matrix 196 rows 219 cols
[2021-05-08 10:59:31] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:31] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 196 rows 219 cols
[2021-05-08 10:59:31] [INFO ] Computed 37 place invariants in 6 ms
[2021-05-08 10:59:31] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 219/261 places, 196/234 transitions.
Stuttering acceptance computed with spot in 520 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : AutoFlight-PT-12a-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(NOT p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 10}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 11}], [{ cond=(NOT p1), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 13}, { cond=(NOT p2), acceptance={} source=7 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 13}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=10 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=10 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=11 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=12 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=13 dest: 10}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=13 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=14 dest: 13}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=15 dest: 13}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=15 dest: 15}]], initial=0, aps=[p1:(EQ s38 1), p0:(EQ s2 1), p2:(EQ s38 0), p3:(OR (EQ s38 1) (AND (EQ s34 1) (EQ s163 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, 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, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-09 finished in 1179 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 234/234 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 257 transition count 153
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 163 place count 177 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 163 place count 177 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 225 place count 140 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 225 place count 140 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 249 place count 128 transition count 116
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 253 place count 124 transition count 112
Iterating global reduction 2 with 4 rules applied. Total rules applied 257 place count 124 transition count 112
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 305 place count 100 transition count 88
Applied a total of 305 rules in 14 ms. Remains 100 /261 variables (removed 161) and now considering 88/234 (removed 146) transitions.
// Phase 1: matrix 88 rows 100 cols
[2021-05-08 10:59:31] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-08 10:59:31] [INFO ] Implicit Places using invariants in 43 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
[2021-05-08 10:59:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 88 rows 99 cols
[2021-05-08 10:59:31] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-08 10:59:31] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 99/261 places, 88/234 transitions.
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 2 place count 98 transition count 87
Applied a total of 2 rules in 5 ms. Remains 98 /99 variables (removed 1) and now considering 87/88 (removed 1) transitions.
// Phase 1: matrix 87 rows 98 cols
[2021-05-08 10:59:31] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:59:31] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 87 rows 98 cols
[2021-05-08 10:59:31] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-08 10:59:31] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 98/261 places, 87/234 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3212 reset in 193 ms.
Product exploration explored 100000 steps with 3170 reset in 200 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3178 reset in 182 ms.
Product exploration explored 100000 steps with 3175 reset in 198 ms.
[2021-05-08 10:59:32] [INFO ] Flatten gal took : 5 ms
[2021-05-08 10:59:32] [INFO ] Flatten gal took : 5 ms
[2021-05-08 10:59:32] [INFO ] Time to serialize gal into /tmp/LTL4169404042922477938.gal : 2 ms
[2021-05-08 10:59:32] [INFO ] Time to serialize properties into /tmp/LTL18418271234944788763.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4169404042922477938.gal, -t, CGAL, -LTL, /tmp/LTL18418271234944788763.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4169404042922477938.gal -t CGAL -LTL /tmp/LTL18418271234944788763.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p40!=1)"))))
Formula 0 simplified : !FG"(p40!=1)"
Reverse transition relation is NOT exact ! Due to transitions t37, t144.t108.t107.t106.t105.t104.t103.t102.t101.t100.t99.t98.t97.t203.t202.t201.t200.t199.t198.t197.t196.t195.t194.t193.t192.t191.t190.t189.t188.t187.t186.t185.t184.t183.t182.t181.t180.t96.t95.t94.t93.t92.t91.t90.t89.t88.t87.t86.t85.t217, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/85/2/87
Computing Next relation with stutter on 24 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
83 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.837269,47848,1,0,379,164736,204,318,2701,239123,688
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-12a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-12a-10 finished in 2081 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(F((p0&&X(F((F(!p0)&&p1)))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 261 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 257 transition count 230
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 257 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 250 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 250 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 249 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 249 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 248 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 248 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 247 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 247 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 246 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 246 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 245 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 245 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 244 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 244 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 241 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 241 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 237 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 237 transition count 210
Applied a total of 48 rules in 70 ms. Remains 237 /261 variables (removed 24) and now considering 210/234 (removed 24) transitions.
// Phase 1: matrix 210 rows 237 cols
[2021-05-08 10:59:33] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-08 10:59:33] [INFO ] Implicit Places using invariants in 81 ms returned [13, 20, 69, 236]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 82 ms to find 4 implicit places.
// Phase 1: matrix 210 rows 233 cols
[2021-05-08 10:59:33] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:34] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Starting structural reductions, iteration 1 : 233/261 places, 210/234 transitions.
Applied a total of 0 rules in 9 ms. Remains 233 /233 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 233 cols
[2021-05-08 10:59:34] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:34] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 2 iterations. Remains : 233/261 places, 210/234 transitions.
Stuttering acceptance computed with spot in 437 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s120 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-12 finished in 828 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 257 transition count 230
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 257 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 250 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 250 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 249 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 249 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 248 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 248 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 247 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 247 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 246 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 246 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 245 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 245 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 244 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 244 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 241 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 241 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 237 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 237 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 236 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 236 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 235 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 235 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 234 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 234 transition count 207
Applied a total of 54 rules in 62 ms. Remains 234 /261 variables (removed 27) and now considering 207/234 (removed 27) transitions.
// Phase 1: matrix 207 rows 234 cols
[2021-05-08 10:59:34] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-08 10:59:34] [INFO ] Implicit Places using invariants in 74 ms returned [13, 20, 69, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 75 ms to find 4 implicit places.
// Phase 1: matrix 207 rows 230 cols
[2021-05-08 10:59:34] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:34] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Starting structural reductions, iteration 1 : 230/261 places, 207/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 225 transition count 202
Applied a total of 10 rules in 15 ms. Remains 225 /230 variables (removed 5) and now considering 202/207 (removed 5) transitions.
// Phase 1: matrix 202 rows 225 cols
[2021-05-08 10:59:34] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:34] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 202 rows 225 cols
[2021-05-08 10:59:34] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:35] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 225/261 places, 202/234 transitions.
Stuttering acceptance computed with spot in 15466 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-13 automaton TGBA [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:(AND (EQ s24 1) (OR (EQ s12 0) (EQ s128 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-13 finished in 15905 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U (p1||G(p0))) U (F(G(p2)) U p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 257 transition count 230
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 257 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 250 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 250 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 249 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 249 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 248 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 248 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 247 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 247 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 246 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 246 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 245 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 245 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 244 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 244 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 241 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 241 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 237 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 237 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 236 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 236 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 235 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 235 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 234 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 234 transition count 207
Applied a total of 54 rules in 61 ms. Remains 234 /261 variables (removed 27) and now considering 207/234 (removed 27) transitions.
// Phase 1: matrix 207 rows 234 cols
[2021-05-08 10:59:50] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-08 10:59:50] [INFO ] Implicit Places using invariants in 71 ms returned [13, 20, 69, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 71 ms to find 4 implicit places.
// Phase 1: matrix 207 rows 230 cols
[2021-05-08 10:59:50] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:50] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Starting structural reductions, iteration 1 : 230/261 places, 207/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 219 transition count 196
Applied a total of 22 rules in 35 ms. Remains 219 /230 variables (removed 11) and now considering 196/207 (removed 11) transitions.
// Phase 1: matrix 196 rows 219 cols
[2021-05-08 10:59:50] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:50] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 196 rows 219 cols
[2021-05-08 10:59:50] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:51] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 219/261 places, 196/234 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p3), (NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s44 0), p1:(AND (NEQ s9 1) (OR (NEQ s57 1) (NEQ s206 1))), p0:(OR (NEQ s57 1) (NEQ s206 1)), p2:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 483 ms.
Product exploration explored 100000 steps with 50000 reset in 496 ms.
Knowledge obtained : [p3, p1, p0, (NOT p2)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p3), (NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 430 ms.
Product exploration explored 100000 steps with 50000 reset in 453 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 126 ms :[(NOT p3), (NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 5 out of 219 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 219/219 places, 196/196 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 219 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 58 place count 219 transition count 196
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 219 transition count 196
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 114 place count 175 transition count 152
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 158 place count 175 transition count 152
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 181 place count 175 transition count 152
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 185 place count 171 transition count 148
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 189 place count 171 transition count 148
Deduced a syphon composed of 45 places in 0 ms
Applied a total of 189 rules in 23 ms. Remains 171 /219 variables (removed 48) and now considering 148/196 (removed 48) transitions.
[2021-05-08 10:59:53] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 148 rows 171 cols
[2021-05-08 10:59:53] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-08 10:59:53] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 171/219 places, 148/196 transitions.
Product exploration explored 100000 steps with 50000 reset in 1018 ms.
Product exploration explored 100000 steps with 50000 reset in 975 ms.
[2021-05-08 10:59:55] [INFO ] Flatten gal took : 11 ms
[2021-05-08 10:59:55] [INFO ] Flatten gal took : 11 ms
[2021-05-08 10:59:55] [INFO ] Time to serialize gal into /tmp/LTL16312741618842657086.gal : 4 ms
[2021-05-08 10:59:55] [INFO ] Time to serialize properties into /tmp/LTL18124784175501329167.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16312741618842657086.gal, -t, CGAL, -LTL, /tmp/LTL18124784175501329167.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16312741618842657086.gal -t CGAL -LTL /tmp/LTL18124784175501329167.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("((p66!=1)||(p288!=1))")U((G("((p66!=1)||(p288!=1))"))||("((p10!=1)&&((p66!=1)||(p288!=1)))")))U((F(G("(p3==1)")))U("(p51==0)")))))
Formula 0 simplified : !X(("((p66!=1)||(p288!=1))" U ("((p10!=1)&&((p66!=1)||(p288!=1)))" | G"((p66!=1)||(p288!=1))")) U (FG"(p3==1)" U "(p51==0)"))
Detected timeout of ITS tools.
[2021-05-08 11:00:10] [INFO ] Flatten gal took : 11 ms
[2021-05-08 11:00:10] [INFO ] Applying decomposition
[2021-05-08 11:00:10] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3939018567150435238.txt, -o, /tmp/graph3939018567150435238.bin, -w, /tmp/graph3939018567150435238.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3939018567150435238.bin, -l, -1, -v, -w, /tmp/graph3939018567150435238.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:00:10] [INFO ] Decomposing Gal with order
[2021-05-08 11:00:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:00:10] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-08 11:00:10] [INFO ] Flatten gal took : 42 ms
[2021-05-08 11:00:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-08 11:00:10] [INFO ] Time to serialize gal into /tmp/LTL6707743832912255973.gal : 4 ms
[2021-05-08 11:00:10] [INFO ] Time to serialize properties into /tmp/LTL14078834247557505531.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6707743832912255973.gal, -t, CGAL, -LTL, /tmp/LTL14078834247557505531.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6707743832912255973.gal -t CGAL -LTL /tmp/LTL14078834247557505531.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((("((i15.u18.p66!=1)||(i6.u86.p288!=1))")U((G("((i15.u18.p66!=1)||(i6.u86.p288!=1))"))||("((i13.u2.p10!=1)&&((i15.u18.p66!=1)||(i6.u86.p288!=1)))")))U((F(G("(i13.u0.p3==1)")))U("(i5.u14.p51==0)")))))
Formula 0 simplified : !X(("((i15.u18.p66!=1)||(i6.u86.p288!=1))" U ("((i13.u2.p10!=1)&&((i15.u18.p66!=1)||(i6.u86.p288!=1)))" | G"((i15.u18.p66!=1)||(i6.u86.p288!=1))")) U (FG"(i13.u0.p3==1)" U "(i5.u14.p51==0)"))
Reverse transition relation is NOT exact ! Due to transitions t144, i0.u7.t45, i1.u8.t43, i1.u9.t41, i2.u10.t39, i2.u12.t35, i3.u11.t37, i4.u13.t33, i5.u14.t31, i5.u16.t27, i6.u19.t21, i6.u21.t17, i7.u22.t15, i7.u23.t13, i8.u36.t85, i11.u1.t57, i12.t97, i13.u0.t59, i13.u2.t55, i14.u4.t51, i14.u6.t47, i15.u18.t23, i15.u20.t19, i17.u15.t29, i18.u3.t53, i18.u5.t49, i19.u17.t25, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/169/27/196
Computing Next relation with stutter on 24 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
27 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.307282,27124,1,0,21154,180,2165,26972,116,368,39684
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-12a-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-12a-14 finished in 20698 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((F(p1)&&F(((p3 U p4)&&p2))))&&p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 261 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 261/261 places, 234/234 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 261 transition count 172
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 199 transition count 172
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 124 place count 199 transition count 140
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 188 place count 167 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 166 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 166 transition count 139
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 240 place count 141 transition count 114
Applied a total of 240 rules in 34 ms. Remains 141 /261 variables (removed 120) and now considering 114/234 (removed 120) transitions.
// Phase 1: matrix 114 rows 141 cols
[2021-05-08 11:00:11] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-08 11:00:11] [INFO ] Implicit Places using invariants in 69 ms returned [14, 47, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 69 ms to find 14 implicit places.
[2021-05-08 11:00:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 114 rows 127 cols
[2021-05-08 11:00:11] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-08 11:00:11] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 127/261 places, 114/234 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 111
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 124 transition count 111
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 6 place count 124 transition count 95
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 38 place count 108 transition count 95
Applied a total of 38 rules in 5 ms. Remains 108 /127 variables (removed 19) and now considering 95/114 (removed 19) transitions.
// Phase 1: matrix 95 rows 108 cols
[2021-05-08 11:00:11] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-08 11:00:11] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 95 rows 108 cols
[2021-05-08 11:00:11] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-08 11:00:11] [INFO ] State equation strengthened by 28 read => feed constraints.
[2021-05-08 11:00:11] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 108/261 places, 95/234 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p4) (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p4) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p4)), (NOT p0), (NOT p4)]
Running random walk in product with property : AutoFlight-PT-12a-15 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p4) p3), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p4) p3), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p4) p3), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s88 1) (EQ s107 1)), p2:(AND (EQ s95 1) (EQ s107 1)), p4:(AND (EQ s9 1) (EQ s65 1)), p3:(AND (EQ s7 1) (EQ s69 1)), p0:(AND (NEQ s9 0) (NEQ s65 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-15 finished in 521 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620471614039

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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 r007-tall-162037990100466"
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 ;