Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 9.4K Apr 30 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 30 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 70K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652660646353

Running Version 202205111006
[2022-05-16 00:24:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 00:24:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:24:08] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2022-05-16 00:24:08] [INFO ] Transformed 298 places.
[2022-05-16 00:24:08] [INFO ] Transformed 296 transitions.
[2022-05-16 00:24:08] [INFO ] Found NUPN structural information;
[2022-05-16 00:24:08] [INFO ] Parsed PT model containing 298 places and 296 transitions in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutoFlight-PT-03b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 265 transition count 263
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 265 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 265 transition count 259
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 82 place count 253 transition count 247
Iterating global reduction 1 with 12 rules applied. Total rules applied 94 place count 253 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 252 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 252 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 251 transition count 245
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 251 transition count 245
Applied a total of 98 rules in 138 ms. Remains 251 /298 variables (removed 47) and now considering 245/296 (removed 51) transitions.
// Phase 1: matrix 245 rows 251 cols
[2022-05-16 00:24:08] [INFO ] Computed 22 place invariants in 16 ms
[2022-05-16 00:24:08] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 245 rows 251 cols
[2022-05-16 00:24:08] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-16 00:24:09] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 251 cols
[2022-05-16 00:24:09] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-16 00:24:14] [INFO ] Dead Transitions using invariants and state equation in 5010 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 251/298 places, 245/296 transitions.
Finished structural reductions, in 1 iterations. Remains : 251/298 places, 245/296 transitions.
Support contains 26 out of 251 places after structural reductions.
[2022-05-16 00:24:14] [INFO ] Flatten gal took : 69 ms
[2022-05-16 00:24:14] [INFO ] Flatten gal took : 34 ms
[2022-05-16 00:24:14] [INFO ] Input system was already deterministic with 245 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 25) seen :21
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 245 rows 251 cols
[2022-05-16 00:24:15] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 00:24:15] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2022-05-16 00:24:15] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:24:15] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-16 00:24:15] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 4 ms to minimize.
[2022-05-16 00:24:15] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2022-05-16 00:24:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2022-05-16 00:24:15] [INFO ] After 378ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 00:24:15] [INFO ] After 537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 00:24:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2022-05-16 00:24:15] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:24:16] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 00:24:16] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 1 ms to minimize.
[2022-05-16 00:24:16] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2022-05-16 00:24:16] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2022-05-16 00:24:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 410 ms
[2022-05-16 00:24:16] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2022-05-16 00:24:16] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 0 ms to minimize.
[2022-05-16 00:24:16] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2022-05-16 00:24:16] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2022-05-16 00:24:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 307 ms
[2022-05-16 00:24:16] [INFO ] After 917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-16 00:24:16] [INFO ] After 1049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 13 ms.
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 251/251 places, 245/245 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 251 transition count 160
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 96 rules applied. Total rules applied 181 place count 166 transition count 149
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 188 place count 160 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 189 place count 159 transition count 148
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 189 place count 159 transition count 116
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 253 place count 127 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 257 place count 123 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 261 place count 123 transition count 112
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 261 place count 123 transition count 109
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 267 place count 120 transition count 109
Performed 44 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 355 place count 76 transition count 60
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 356 place count 76 transition count 59
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 4 with 2 rules applied. Total rules applied 358 place count 75 transition count 58
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 370 place count 75 transition count 46
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 382 place count 63 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 383 place count 62 transition count 45
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 5 with 25 rules applied. Total rules applied 408 place count 51 transition count 31
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 422 place count 37 transition count 31
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 422 place count 37 transition count 23
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 438 place count 29 transition count 23
Applied a total of 438 rules in 46 ms. Remains 29 /251 variables (removed 222) and now considering 23/245 (removed 222) transitions.
Finished structural reductions, in 1 iterations. Remains : 29/251 places, 23/245 transitions.
Finished random walk after 694 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=173 )
FORMULA AutoFlight-PT-03b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 70 stabilizing places and 70 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((F(p2) U X(p3))&&p1)))'
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 242 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 242 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 242 transition count 234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 236 transition count 228
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 234 transition count 226
Applied a total of 36 rules in 65 ms. Remains 234 /251 variables (removed 17) and now considering 226/245 (removed 19) transitions.
// Phase 1: matrix 226 rows 234 cols
[2022-05-16 00:24:17] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:24:18] [INFO ] Implicit Places using invariants in 694 ms returned []
// Phase 1: matrix 226 rows 234 cols
[2022-05-16 00:24:18] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 00:24:18] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
// Phase 1: matrix 226 rows 234 cols
[2022-05-16 00:24:18] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:24:18] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/251 places, 226/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 234/251 places, 226/245 transitions.
Stuttering acceptance computed with spot in 624 ms :[(OR (NOT p1) (NOT p3)), true, (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s111 1) (EQ s59 1)), p0:(NEQ s111 1), p2:(AND (EQ s111 1) (EQ s37 1)), p3:(NEQ s75 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 4 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-01 finished in 1850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((F(p0) U X(X(p0)))))))))'
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 242 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 242 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 242 transition count 234
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 237 transition count 229
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 235 transition count 227
Applied a total of 34 rules in 69 ms. Remains 235 /251 variables (removed 16) and now considering 227/245 (removed 18) transitions.
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:24:19] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 00:24:19] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:24:19] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:24:19] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
// Phase 1: matrix 227 rows 235 cols
[2022-05-16 00:24:19] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-16 00:24:19] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/251 places, 227/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/251 places, 227/245 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(EQ s118 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 219 steps with 1 reset in 2 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-03 finished in 888 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))||p1)))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 241 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 241 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 241 transition count 233
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 235 transition count 227
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 235 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 233 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 233 transition count 225
Applied a total of 38 rules in 33 ms. Remains 233 /251 variables (removed 18) and now considering 225/245 (removed 20) transitions.
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:24:20] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:24:20] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:24:20] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:24:20] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 233 cols
[2022-05-16 00:24:20] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:24:20] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/251 places, 225/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 233/251 places, 225/245 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s106 1), p0:(EQ s228 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-04 finished in 586 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(!(p0 U X(!G((p1 U p0))))))))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 245/245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 250 transition count 162
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 93 rules applied. Total rules applied 175 place count 168 transition count 151
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 182 place count 162 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 161 transition count 150
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 183 place count 161 transition count 117
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 249 place count 128 transition count 117
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 254 place count 123 transition count 112
Iterating global reduction 4 with 5 rules applied. Total rules applied 259 place count 123 transition count 112
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 259 place count 123 transition count 109
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 265 place count 120 transition count 109
Performed 46 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 357 place count 74 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 73 transition count 56
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 7 rules applied. Total rules applied 365 place count 68 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 367 place count 66 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 367 place count 66 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 373 place count 63 transition count 51
Applied a total of 373 rules in 59 ms. Remains 63 /251 variables (removed 188) and now considering 51/245 (removed 194) transitions.
// Phase 1: matrix 51 rows 63 cols
[2022-05-16 00:24:20] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:24:20] [INFO ] Implicit Places using invariants in 81 ms returned [26, 37, 48, 52, 56, 62]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 84 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/251 places, 51/245 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 52 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 52 transition count 46
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 12 place count 51 transition count 45
Applied a total of 12 rules in 9 ms. Remains 51 /57 variables (removed 6) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 51 cols
[2022-05-16 00:24:20] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 00:24:20] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 45 rows 51 cols
[2022-05-16 00:24:20] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 00:24:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 00:24:20] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/251 places, 45/245 transitions.
Finished structural reductions, in 2 iterations. Remains : 51/251 places, 45/245 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s12 1), p1:(AND (EQ s16 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-06 finished in 385 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 245/245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 250 transition count 161
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 94 rules applied. Total rules applied 177 place count 167 transition count 150
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 183 place count 161 transition count 150
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 183 place count 161 transition count 117
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 249 place count 128 transition count 117
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 123 transition count 112
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 123 transition count 112
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 259 place count 123 transition count 108
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 267 place count 119 transition count 108
Performed 46 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 359 place count 73 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 360 place count 72 transition count 55
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 367 place count 67 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 369 place count 65 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 369 place count 65 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 375 place count 62 transition count 50
Applied a total of 375 rules in 57 ms. Remains 62 /251 variables (removed 189) and now considering 50/245 (removed 195) transitions.
// Phase 1: matrix 50 rows 62 cols
[2022-05-16 00:24:21] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 00:24:21] [INFO ] Implicit Places using invariants in 70 ms returned [25, 36, 47, 51, 55, 61]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 72 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/251 places, 50/245 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 52 transition count 46
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 52 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 51 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 51 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 50 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 50 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 49 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 49 transition count 43
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 16 place count 48 transition count 42
Applied a total of 16 rules in 5 ms. Remains 48 /56 variables (removed 8) and now considering 42/50 (removed 8) transitions.
// Phase 1: matrix 42 rows 48 cols
[2022-05-16 00:24:21] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 00:24:21] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 42 rows 48 cols
[2022-05-16 00:24:21] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 00:24:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 00:24:21] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/251 places, 42/245 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/251 places, 42/245 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s15 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]]
Stuttering criterion allowed to conclude after 204 steps with 22 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-07 finished in 430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 245/245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 250 transition count 159
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 96 rules applied. Total rules applied 181 place count 165 transition count 148
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 187 place count 159 transition count 148
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 187 place count 159 transition count 116
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 251 place count 127 transition count 116
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 256 place count 122 transition count 111
Iterating global reduction 3 with 5 rules applied. Total rules applied 261 place count 122 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 261 place count 122 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 269 place count 118 transition count 107
Performed 44 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 357 place count 74 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 358 place count 74 transition count 57
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 3 with 2 rules applied. Total rules applied 360 place count 73 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 361 place count 72 transition count 55
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 368 place count 67 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 370 place count 65 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 370 place count 65 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 376 place count 62 transition count 50
Applied a total of 376 rules in 38 ms. Remains 62 /251 variables (removed 189) and now considering 50/245 (removed 195) transitions.
// Phase 1: matrix 50 rows 62 cols
[2022-05-16 00:24:21] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:24:21] [INFO ] Implicit Places using invariants in 73 ms returned [25, 36, 47, 51, 55, 61]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 74 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/251 places, 50/245 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 52 transition count 46
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 52 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 51 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 51 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 50 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 50 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 49 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 49 transition count 43
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 16 place count 48 transition count 42
Applied a total of 16 rules in 5 ms. Remains 48 /56 variables (removed 8) and now considering 42/50 (removed 8) transitions.
// Phase 1: matrix 42 rows 48 cols
[2022-05-16 00:24:21] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-16 00:24:21] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 42 rows 48 cols
[2022-05-16 00:24:21] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 00:24:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:24:21] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/251 places, 42/245 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/251 places, 42/245 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-09 finished in 343 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U G(p1)))||X(!p0)))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 241 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 241 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 241 transition count 233
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 235 transition count 227
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 234 transition count 226
Applied a total of 36 rules in 37 ms. Remains 234 /251 variables (removed 17) and now considering 226/245 (removed 19) transitions.
// Phase 1: matrix 226 rows 234 cols
[2022-05-16 00:24:21] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:24:21] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 226 rows 234 cols
[2022-05-16 00:24:21] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:24:22] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
// Phase 1: matrix 226 rows 234 cols
[2022-05-16 00:24:22] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 00:24:22] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/251 places, 226/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 234/251 places, 226/245 transitions.
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) p0), p0, (AND p0 (NOT p1)), (AND (NOT p1) p0), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s217 1), p0:(NEQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-11 finished in 926 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(p0)))))'
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 245/245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 250 transition count 160
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 94 rules applied. Total rules applied 178 place count 166 transition count 150
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 184 place count 160 transition count 150
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 184 place count 160 transition count 118
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 248 place count 128 transition count 118
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 254 place count 122 transition count 112
Iterating global reduction 3 with 6 rules applied. Total rules applied 260 place count 122 transition count 112
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 260 place count 122 transition count 107
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 270 place count 117 transition count 107
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 360 place count 72 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 361 place count 71 transition count 55
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 368 place count 66 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 370 place count 64 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 370 place count 64 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 376 place count 61 transition count 50
Applied a total of 376 rules in 22 ms. Remains 61 /251 variables (removed 190) and now considering 50/245 (removed 195) transitions.
// Phase 1: matrix 50 rows 61 cols
[2022-05-16 00:24:22] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:24:22] [INFO ] Implicit Places using invariants in 66 ms returned [24, 35, 46, 50, 54, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 67 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/251 places, 50/245 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 46
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 50 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 50 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 49 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 49 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 48 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 48 transition count 43
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 16 place count 47 transition count 42
Applied a total of 16 rules in 4 ms. Remains 47 /55 variables (removed 8) and now considering 42/50 (removed 8) transitions.
// Phase 1: matrix 42 rows 47 cols
[2022-05-16 00:24:22] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 00:24:22] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 42 rows 47 cols
[2022-05-16 00:24:22] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 00:24:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:24:22] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/251 places, 42/245 transitions.
Finished structural reductions, in 2 iterations. Remains : 47/251 places, 42/245 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-12 finished in 275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||G(p1)))&&X(G(X(p2)))&&F(p3)))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 245/245 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 244 transition count 238
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 244 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 244 transition count 237
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 239 transition count 232
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 239 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 237 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 237 transition count 230
Applied a total of 29 rules in 30 ms. Remains 237 /251 variables (removed 14) and now considering 230/245 (removed 15) transitions.
// Phase 1: matrix 230 rows 237 cols
[2022-05-16 00:24:22] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:24:23] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 230 rows 237 cols
[2022-05-16 00:24:23] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 00:24:28] [INFO ] Implicit Places using invariants and state equation in 5468 ms returned []
Implicit Place search using SMT with State Equation took 5568 ms to find 0 implicit places.
// Phase 1: matrix 230 rows 237 cols
[2022-05-16 00:24:28] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:24:28] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/251 places, 230/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 237/251 places, 230/245 transitions.
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (NOT p3), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p2), true]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s65 1), p0:(EQ s123 0), p1:(EQ s182 0), p2:(EQ s123 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-13 finished in 6119 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((G(p0)&&X(p1)))||G(F(p2))))))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 245/245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 250 transition count 162
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 89 rules applied. Total rules applied 171 place count 168 transition count 155
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 175 place count 164 transition count 155
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 175 place count 164 transition count 124
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 237 place count 133 transition count 124
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 244 place count 126 transition count 117
Iterating global reduction 3 with 7 rules applied. Total rules applied 251 place count 126 transition count 117
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 251 place count 126 transition count 111
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 263 place count 120 transition count 111
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 353 place count 75 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 74 transition count 60
Applied a total of 355 rules in 21 ms. Remains 74 /251 variables (removed 177) and now considering 60/245 (removed 185) transitions.
// Phase 1: matrix 60 rows 74 cols
[2022-05-16 00:24:29] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:24:29] [INFO ] Implicit Places using invariants in 91 ms returned [23, 24, 25, 26, 30, 31, 42, 53, 59, 65]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 101 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/251 places, 60/245 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 62 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 59 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 55 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 55 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 54 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 54 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 53 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 53 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 52 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 52 transition count 48
Applied a total of 24 rules in 5 ms. Remains 52 /64 variables (removed 12) and now considering 48/60 (removed 12) transitions.
// Phase 1: matrix 48 rows 52 cols
[2022-05-16 00:24:29] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 00:24:29] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 48 rows 52 cols
[2022-05-16 00:24:29] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 00:24:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 00:24:29] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/251 places, 48/245 transitions.
Finished structural reductions, in 2 iterations. Remains : 52/251 places, 48/245 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s23 1), p2:(EQ s9 0), p1:(EQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6268 reset in 352 ms.
Product exploration explored 100000 steps with 6303 reset in 286 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))))]
Knowledge based reduction with 4 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 66 steps, including 3 resets, run visited all 2 properties in 3 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2022-05-16 00:24:30] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 00:24:30] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 48 rows 52 cols
[2022-05-16 00:24:30] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 00:24:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 00:24:31] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2022-05-16 00:24:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 52 cols
[2022-05-16 00:24:31] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 00:24:31] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 48/48 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
Knowledge based reduction with 4 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 121 steps, including 7 resets, run visited all 2 properties in 3 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 6286 reset in 203 ms.
Product exploration explored 100000 steps with 6276 reset in 261 ms.
Built C files in :
/tmp/ltsmin2751550970281599671
[2022-05-16 00:24:32] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2022-05-16 00:24:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:24:32] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2022-05-16 00:24:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:24:32] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2022-05-16 00:24:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:24:32] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2751550970281599671
Running compilation step : cd /tmp/ltsmin2751550970281599671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 304 ms.
Running link step : cd /tmp/ltsmin2751550970281599671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin2751550970281599671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16667953522120064777.hoa' '--buchi-type=spotba'
LTSmin run took 419 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03b-LTLFireability-14 finished in 4284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((F(X(p1)) U p2)))))'
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 242 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 242 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 242 transition count 234
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 237 transition count 229
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 236 transition count 228
Applied a total of 32 rules in 19 ms. Remains 236 /251 variables (removed 15) and now considering 228/245 (removed 17) transitions.
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:24:33] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 00:24:33] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:24:33] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 00:24:33] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
// Phase 1: matrix 228 rows 236 cols
[2022-05-16 00:24:33] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-16 00:24:33] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/251 places, 228/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/251 places, 228/245 transitions.
Stuttering acceptance computed with spot in 375 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s98 1), p2:(AND (EQ s225 1) (EQ s232 1)), p1:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 151 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-15 finished in 819 ms.
All properties solved by simple procedures.
Total runtime 26258 ms.

BK_STOP 1652660674288

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-03b"
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-03b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689300412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-03b.tgz
mv AutoFlight-PT-03b 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 ;