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-165245689200396.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-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689200396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 8.6K Apr 30 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 01:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 01:48 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.5K May 9 07:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:03 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 48K 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-02b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652660385138

Running Version 202205111006
[2022-05-16 00:19:46] [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:19:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:19:46] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2022-05-16 00:19:46] [INFO ] Transformed 206 places.
[2022-05-16 00:19:46] [INFO ] Transformed 204 transitions.
[2022-05-16 00:19:46] [INFO ] Found NUPN structural information;
[2022-05-16 00:19:46] [INFO ] Parsed PT model containing 206 places and 204 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-02b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 204/204 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 184 transition count 179
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 176 transition count 171
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 176 transition count 171
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 175 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 175 transition count 170
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 174 transition count 169
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 174 transition count 169
Applied a total of 67 rules in 59 ms. Remains 174 /206 variables (removed 32) and now considering 169/204 (removed 35) transitions.
// Phase 1: matrix 169 rows 174 cols
[2022-05-16 00:19:46] [INFO ] Computed 16 place invariants in 21 ms
[2022-05-16 00:19:46] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 169 rows 174 cols
[2022-05-16 00:19:46] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:19:47] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
// Phase 1: matrix 169 rows 174 cols
[2022-05-16 00:19:47] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-16 00:19:47] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/206 places, 169/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/206 places, 169/204 transitions.
Support contains 29 out of 174 places after structural reductions.
[2022-05-16 00:19:47] [INFO ] Flatten gal took : 59 ms
[2022-05-16 00:19:47] [INFO ] Flatten gal took : 25 ms
[2022-05-16 00:19:47] [INFO ] Input system was already deterministic with 169 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 27) seen :25
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 169 rows 174 cols
[2022-05-16 00:19:47] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-16 00:19:47] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-16 00:19:47] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:19:48] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:19:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 19 ms returned sat
[2022-05-16 00:19:48] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:19:48] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:19:48] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 33 ms to minimize.
[2022-05-16 00:19:48] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2022-05-16 00:19:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2022-05-16 00:19:48] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-16 00:19:48] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=70 )
Parikh walk visited 2 properties in 4 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 50 stabilizing places and 50 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)&&G(p0)))))'
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 173 transition count 108
Reduce places removed 60 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 67 rules applied. Total rules applied 127 place count 113 transition count 101
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 131 place count 109 transition count 101
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 131 place count 109 transition count 77
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 179 place count 85 transition count 77
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 184 place count 80 transition count 72
Iterating global reduction 3 with 5 rules applied. Total rules applied 189 place count 80 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 189 place count 80 transition count 71
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 191 place count 79 transition count 71
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 247 place count 51 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 248 place count 51 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 50 transition count 38
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 253 place count 47 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 46 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 254 place count 46 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 258 place count 44 transition count 35
Applied a total of 258 rules in 72 ms. Remains 44 /174 variables (removed 130) and now considering 35/169 (removed 134) transitions.
// Phase 1: matrix 35 rows 44 cols
[2022-05-16 00:19:49] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:19:49] [INFO ] Implicit Places using invariants in 66 ms returned [17, 25, 33, 37, 43]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 70 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/174 places, 35/169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 32
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 35 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 35 transition count 31
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 34 transition count 30
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 34 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 33 transition count 29
Applied a total of 12 rules in 6 ms. Remains 33 /39 variables (removed 6) and now considering 29/35 (removed 6) transitions.
// Phase 1: matrix 29 rows 33 cols
[2022-05-16 00:19:49] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 00:19:49] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 29 rows 33 cols
[2022-05-16 00:19:49] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 00:19:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:19:49] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/174 places, 29/169 transitions.
Finished structural reductions, in 2 iterations. Remains : 33/174 places, 29/169 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-01 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 s4 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 13 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-01 finished in 608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 166 transition count 161
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 166 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 164 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 163 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 163 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 162 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 162 transition count 156
Applied a total of 25 rules in 68 ms. Remains 162 /174 variables (removed 12) and now considering 156/169 (removed 13) transitions.
// Phase 1: matrix 156 rows 162 cols
[2022-05-16 00:19:49] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:19:49] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 156 rows 162 cols
[2022-05-16 00:19:49] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:19:50] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 162 cols
[2022-05-16 00:19:50] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:19:50] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 162/174 places, 156/169 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/174 places, 156/169 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s113 1) (EQ s160 1)), p0:(NEQ s141 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][false, false, false]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-03 finished in 620 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)||p0))))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 166 transition count 161
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 166 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 164 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 163 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 163 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 162 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 162 transition count 156
Applied a total of 25 rules in 103 ms. Remains 162 /174 variables (removed 12) and now considering 156/169 (removed 13) transitions.
// Phase 1: matrix 156 rows 162 cols
[2022-05-16 00:19:50] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:19:50] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 156 rows 162 cols
[2022-05-16 00:19:50] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:19:50] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 162 cols
[2022-05-16 00:19:50] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:19:50] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 162/174 places, 156/169 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/174 places, 156/169 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s142 0) (AND (EQ s142 1) (EQ s154 1))), p1:(EQ s142 0)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 484 ms.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Detected a total of 40/162 stabilizing places and 40/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-02b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-02b-LTLFireability-04 finished in 1430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!F(p1))))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 173 transition count 112
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 62 rules applied. Total rules applied 118 place count 117 transition count 106
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 124 place count 113 transition count 104
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 111 transition count 103
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 127 place count 111 transition count 79
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 175 place count 87 transition count 79
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 179 place count 83 transition count 75
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 83 transition count 75
Performed 30 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 243 place count 53 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 244 place count 52 transition count 40
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 248 place count 49 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 249 place count 48 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 249 place count 48 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 253 place count 46 transition count 37
Applied a total of 253 rules in 50 ms. Remains 46 /174 variables (removed 128) and now considering 37/169 (removed 132) transitions.
// Phase 1: matrix 37 rows 46 cols
[2022-05-16 00:19:51] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:19:52] [INFO ] Implicit Places using invariants in 194 ms returned [19, 27, 35, 39, 45]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 207 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/174 places, 37/169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 38 transition count 34
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 38 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 37 transition count 33
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 37 transition count 33
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 32
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 35 transition count 31
Applied a total of 12 rules in 7 ms. Remains 35 /41 variables (removed 6) and now considering 31/37 (removed 6) transitions.
// Phase 1: matrix 31 rows 35 cols
[2022-05-16 00:19:52] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 00:19:53] [INFO ] Implicit Places using invariants in 1361 ms returned []
// Phase 1: matrix 31 rows 35 cols
[2022-05-16 00:19:53] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 00:19:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:19:54] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 2333 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/174 places, 31/169 transitions.
Finished structural reductions, in 2 iterations. Remains : 35/174 places, 31/169 transitions.
Stuttering acceptance computed with spot in 124 ms :[p1, true, p1]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s12 1) (EQ s9 1)), p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-05 finished in 2749 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||X((X((X(F(p1))||p2)) U G(p3)))))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 167 transition count 162
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 167 transition count 162
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 167 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 166 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 166 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 165 transition count 159
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 165 transition count 159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 164 transition count 158
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 164 transition count 158
Applied a total of 21 rules in 34 ms. Remains 164 /174 variables (removed 10) and now considering 158/169 (removed 11) transitions.
// Phase 1: matrix 158 rows 164 cols
[2022-05-16 00:19:54] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:19:55] [INFO ] Implicit Places using invariants in 1233 ms returned []
// Phase 1: matrix 158 rows 164 cols
[2022-05-16 00:19:55] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-16 00:19:55] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 164 cols
[2022-05-16 00:19:55] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:19:56] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/174 places, 158/169 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/174 places, 158/169 transitions.
Stuttering acceptance computed with spot in 661 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(NOT p2), acceptance={} source=5 dest: 8}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}, { cond=(NOT p3), acceptance={0} source=6 dest: 6}, { cond=p3, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(EQ s72 1), p0:(EQ s4 1), p2:(EQ s78 1), p1:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1337 reset in 198 ms.
Product exploration explored 100000 steps with 1337 reset in 309 ms.
Computed a total of 42 stabilizing places and 42 stable transitions
Computed a total of 42 stabilizing places and 42 stable transitions
Detected a total of 42/164 stabilizing places and 42/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 569 ms. Reduced automaton from 10 states, 20 edges and 4 AP to 8 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 158 rows 164 cols
[2022-05-16 00:19:58] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:19:58] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-16 00:19:58] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:19:58] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 p3 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p2) p3)), (F (AND p2 (NOT p3) (NOT p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 10 factoid took 746 ms. Reduced automaton from 8 states, 15 edges and 3 AP to 8 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
// Phase 1: matrix 158 rows 164 cols
[2022-05-16 00:20:00] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-16 00:20:00] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-16 00:20:00] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:00] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-05-16 00:20:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:20:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-16 00:20:00] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:00] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-16 00:20:00] [INFO ] Computed and/alt/rep : 157/225/157 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 00:20:00] [INFO ] Added : 154 causal constraints over 31 iterations in 453 ms. Result :sat
Could not prove EG (NOT p3)
// Phase 1: matrix 158 rows 164 cols
[2022-05-16 00:20:00] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:20:00] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-16 00:20:00] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:01] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-05-16 00:20:01] [INFO ] Computed and/alt/rep : 157/225/157 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 00:20:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:20:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-16 00:20:01] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 00:20:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:01] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-05-16 00:20:01] [INFO ] Computed and/alt/rep : 157/225/157 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 00:20:01] [INFO ] Added : 152 causal constraints over 31 iterations in 391 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 158/158 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 158/158 (removed 0) transitions.
// Phase 1: matrix 158 rows 164 cols
[2022-05-16 00:20:01] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:01] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 158 rows 164 cols
[2022-05-16 00:20:01] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:01] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 164 cols
[2022-05-16 00:20:01] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:20:01] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 158/158 transitions.
Computed a total of 42 stabilizing places and 42 stable transitions
Computed a total of 42 stabilizing places and 42 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 8 states, 14 edges and 3 AP to 8 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 476 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Finished random walk after 92 steps, including 0 resets, run visited all 6 properties in 8 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p2) p3)), (F (AND p2 (NOT p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 2 factoid took 305 ms. Reduced automaton from 8 states, 14 edges and 3 AP to 8 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 413 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 474 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
// Phase 1: matrix 158 rows 164 cols
[2022-05-16 00:20:03] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-16 00:20:03] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-16 00:20:03] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:04] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-05-16 00:20:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:20:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-16 00:20:04] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:04] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-16 00:20:04] [INFO ] Computed and/alt/rep : 157/225/157 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 00:20:04] [INFO ] Added : 154 causal constraints over 31 iterations in 346 ms. Result :sat
Could not prove EG (NOT p3)
// Phase 1: matrix 158 rows 164 cols
[2022-05-16 00:20:04] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:04] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-16 00:20:04] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:04] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-16 00:20:04] [INFO ] Computed and/alt/rep : 157/225/157 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 00:20:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:20:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-16 00:20:04] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:04] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-16 00:20:04] [INFO ] Computed and/alt/rep : 157/225/157 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 00:20:05] [INFO ] Added : 152 causal constraints over 31 iterations in 362 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 429 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 1330 reset in 114 ms.
Product exploration explored 100000 steps with 1336 reset in 168 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 158/158 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 164 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 164 transition count 157
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 48 place count 164 transition count 158
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 71 place count 164 transition count 158
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 105 place count 130 transition count 124
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 139 place count 130 transition count 124
Performed 38 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 177 place count 130 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 130 transition count 120
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 200 place count 108 transition count 98
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 22 rules applied. Total rules applied 222 place count 108 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 223 place count 108 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 224 place count 107 transition count 97
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 225 place count 107 transition count 97
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 225 rules in 60 ms. Remains 107 /164 variables (removed 57) and now considering 97/158 (removed 61) transitions.
[2022-05-16 00:20:06] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 97 rows 107 cols
[2022-05-16 00:20:06] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:06] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/164 places, 97/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/164 places, 97/158 transitions.
Product exploration explored 100000 steps with 7613 reset in 399 ms.
Product exploration explored 100000 steps with 7643 reset in 364 ms.
Built C files in :
/tmp/ltsmin234574617474994957
[2022-05-16 00:20:07] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin234574617474994957
Running compilation step : cd /tmp/ltsmin234574617474994957;'/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 445 ms.
Running link step : cd /tmp/ltsmin234574617474994957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin234574617474994957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1889674597594607577.hoa' '--buchi-type=spotba'
LTSmin run took 11013 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-02b-LTLFireability-06 finished in 24576 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(G(p0))))||G((p1 U (p1 U p0)))))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 173 transition count 113
Reduce places removed 55 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 62 rules applied. Total rules applied 117 place count 118 transition count 106
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 123 place count 114 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 112 transition count 104
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 125 place count 112 transition count 79
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 175 place count 87 transition count 79
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 180 place count 82 transition count 74
Iterating global reduction 4 with 5 rules applied. Total rules applied 185 place count 82 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 185 place count 82 transition count 73
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 187 place count 81 transition count 73
Performed 28 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 243 place count 53 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 244 place count 52 transition count 40
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 248 place count 49 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 249 place count 48 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 249 place count 48 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 253 place count 46 transition count 37
Applied a total of 253 rules in 17 ms. Remains 46 /174 variables (removed 128) and now considering 37/169 (removed 132) transitions.
// Phase 1: matrix 37 rows 46 cols
[2022-05-16 00:20:19] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:20:19] [INFO ] Implicit Places using invariants in 53 ms returned [27, 35, 39, 45]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/174 places, 37/169 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 40 transition count 35
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 40 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 38 transition count 33
Applied a total of 8 rules in 3 ms. Remains 38 /42 variables (removed 4) and now considering 33/37 (removed 4) transitions.
// Phase 1: matrix 33 rows 38 cols
[2022-05-16 00:20:19] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:20:19] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 33 rows 38 cols
[2022-05-16 00:20:19] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:20:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:20:19] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/174 places, 33/169 transitions.
Finished structural reductions, in 2 iterations. Remains : 38/174 places, 33/169 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s25 1), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-07 finished in 300 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(X((F(p1)&&p2)))))'
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 167 transition count 162
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 167 transition count 162
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 167 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 165 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 165 transition count 159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 164 transition count 158
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 164 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 163 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 163 transition count 157
Applied a total of 23 rules in 22 ms. Remains 163 /174 variables (removed 11) and now considering 157/169 (removed 12) transitions.
// Phase 1: matrix 157 rows 163 cols
[2022-05-16 00:20:19] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:19] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 157 rows 163 cols
[2022-05-16 00:20:19] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:20:19] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 163 cols
[2022-05-16 00:20:19] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:20:19] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/174 places, 157/169 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/174 places, 157/169 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s48 0), p2:(EQ s95 1), p1:(EQ s136 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-09 finished in 472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (X(p1)&&F(p2)))))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 168 transition count 163
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 168 transition count 163
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 166 transition count 161
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 166 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 165 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 165 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 164 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 164 transition count 159
Applied a total of 20 rules in 15 ms. Remains 164 /174 variables (removed 10) and now considering 159/169 (removed 10) transitions.
// Phase 1: matrix 159 rows 164 cols
[2022-05-16 00:20:19] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:20] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 159 rows 164 cols
[2022-05-16 00:20:20] [INFO ] Computed 16 place invariants in 7 ms
[2022-05-16 00:20:20] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 164 cols
[2022-05-16 00:20:20] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:20] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/174 places, 159/169 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/174 places, 159/169 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s40 1) (AND (EQ s66 1) (EQ s35 1))), p2:(EQ s109 1), p1:(NEQ s40 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 3599 reset in 171 ms.
Product exploration explored 100000 steps with 3523 reset in 164 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Computed a total of 41 stabilizing places and 41 stable transitions
Detected a total of 41/164 stabilizing places and 41/159 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 721 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 159 rows 164 cols
[2022-05-16 00:20:21] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:21] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p1))), (F p0), (F (NOT p1)), (F p2)]
Knowledge based reduction with 14 factoid took 965 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
// Phase 1: matrix 159 rows 164 cols
[2022-05-16 00:20:23] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:23] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-16 00:20:23] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:23] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2022-05-16 00:20:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:20:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-16 00:20:23] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:23] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-16 00:20:23] [INFO ] Computed and/alt/rep : 158/227/158 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 00:20:23] [INFO ] Added : 143 causal constraints over 29 iterations in 274 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 159/159 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 159/159 (removed 0) transitions.
// Phase 1: matrix 159 rows 164 cols
[2022-05-16 00:20:23] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:23] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 159 rows 164 cols
[2022-05-16 00:20:23] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:20:24] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 164 cols
[2022-05-16 00:20:24] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:20:24] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 159/159 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Computed a total of 41 stabilizing places and 41 stable transitions
Detected a total of 41/164 stabilizing places and 41/159 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 538 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Finished random walk after 58 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F p0), (F (NOT p1)), (F p2)]
Knowledge based reduction with 9 factoid took 635 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
// Phase 1: matrix 159 rows 164 cols
[2022-05-16 00:20:26] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:26] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-16 00:20:26] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:26] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-16 00:20:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:20:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-16 00:20:26] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 00:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:26] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-16 00:20:26] [INFO ] Computed and/alt/rep : 158/227/158 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 00:20:26] [INFO ] Added : 143 causal constraints over 29 iterations in 319 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Product exploration explored 100000 steps with 3483 reset in 168 ms.
Product exploration explored 100000 steps with 3466 reset in 158 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 159/159 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 164 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 164 transition count 158
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 47 place count 164 transition count 159
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 71 place count 164 transition count 159
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 103 place count 132 transition count 127
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 135 place count 132 transition count 127
Performed 38 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 173 place count 132 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 132 transition count 123
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 198 place count 108 transition count 99
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 24 rules applied. Total rules applied 222 place count 108 transition count 99
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 222 rules in 22 ms. Remains 108 /164 variables (removed 56) and now considering 99/159 (removed 60) transitions.
[2022-05-16 00:20:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 99 rows 108 cols
[2022-05-16 00:20:27] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:20:27] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/164 places, 99/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/164 places, 99/159 transitions.
Product exploration explored 100000 steps with 16227 reset in 242 ms.
Product exploration explored 100000 steps with 16311 reset in 318 ms.
Built C files in :
/tmp/ltsmin223333530278983624
[2022-05-16 00:20:28] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin223333530278983624
Running compilation step : cd /tmp/ltsmin223333530278983624;'/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 362 ms.
Running link step : cd /tmp/ltsmin223333530278983624;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin223333530278983624;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1067504600254843218.hoa' '--buchi-type=spotba'
LTSmin run took 1456 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-02b-LTLFireability-10 finished in 10170 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(F(G(X((X(p0)&&p1)))))))))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 173 transition count 111
Reduce places removed 57 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 64 rules applied. Total rules applied 121 place count 116 transition count 104
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 125 place count 112 transition count 104
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 125 place count 112 transition count 79
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 175 place count 87 transition count 79
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 179 place count 83 transition count 75
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 83 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 183 place count 83 transition count 74
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 185 place count 82 transition count 74
Performed 29 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 243 place count 53 transition count 41
Applied a total of 243 rules in 17 ms. Remains 53 /174 variables (removed 121) and now considering 41/169 (removed 128) transitions.
// Phase 1: matrix 41 rows 53 cols
[2022-05-16 00:20:30] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:20:30] [INFO ] Implicit Places using invariants in 60 ms returned [21, 39, 45, 52]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 61 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/174 places, 41/169 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 39
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 45 transition count 37
Applied a total of 8 rules in 3 ms. Remains 45 /49 variables (removed 4) and now considering 37/41 (removed 4) transitions.
// Phase 1: matrix 37 rows 45 cols
[2022-05-16 00:20:30] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 00:20:30] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 37 rows 45 cols
[2022-05-16 00:20:30] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 00:20:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 00:20:30] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/174 places, 37/169 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 44 transition count 36
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 43 transition count 36
Applied a total of 2 rules in 2 ms. Remains 43 /44 variables (removed 1) and now considering 36/37 (removed 1) transitions.
// Phase 1: matrix 36 rows 43 cols
[2022-05-16 00:20:30] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 00:20:30] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 36 rows 43 cols
[2022-05-16 00:20:30] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 00:20:30] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-16 00:20:30] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 43/174 places, 36/169 transitions.
Finished structural reductions, in 3 iterations. Remains : 43/174 places, 36/169 transitions.
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s34 0), p0:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6625 reset in 244 ms.
Product exploration explored 100000 steps with 6603 reset in 217 ms.
Computed a total of 8 stabilizing places and 5 stable transitions
Computed a total of 8 stabilizing places and 5 stable transitions
Detected a total of 8/43 stabilizing places and 5/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (NOT (AND p1 p0))), (F (OR (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 323 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(OR (NOT p0) (NOT p1))]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 43 cols
[2022-05-16 00:20:31] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 00:20:31] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 36 rows 43 cols
[2022-05-16 00:20:31] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 00:20:31] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-16 00:20:31] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2022-05-16 00:20:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 36 rows 43 cols
[2022-05-16 00:20:31] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 00:20:31] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/43 places, 36/36 transitions.
Computed a total of 8 stabilizing places and 5 stable transitions
Computed a total of 8 stabilizing places and 5 stable transitions
Detected a total of 8/43 stabilizing places and 5/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 5 factoid took 354 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 38 ms :[(OR (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 p0), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (NOT (AND p1 p0))), (F (OR (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 359 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 51 ms :[(OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6603 reset in 156 ms.
Stack based approach found an accepted trace after 11107 steps with 726 reset with depth 11 and stack size 11 in 14 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-11 finished in 2933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 167 transition count 162
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 167 transition count 162
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 167 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 165 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 165 transition count 159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 164 transition count 158
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 164 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 163 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 163 transition count 157
Applied a total of 23 rules in 8 ms. Remains 163 /174 variables (removed 11) and now considering 157/169 (removed 12) transitions.
// Phase 1: matrix 157 rows 163 cols
[2022-05-16 00:20:33] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-16 00:20:33] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 157 rows 163 cols
[2022-05-16 00:20:33] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 00:20:33] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 163 cols
[2022-05-16 00:20:33] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:20:33] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/174 places, 157/169 transitions.
Finished structural reductions, in 1 iterations. Remains : 163/174 places, 157/169 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s24 1), p1:(EQ s74 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-12 finished in 561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(X(X(X(F(p0))))))||F(G(p1)))))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 174 transition count 110
Reduce places removed 59 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 66 rules applied. Total rules applied 125 place count 115 transition count 103
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 131 place count 111 transition count 101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 133 place count 109 transition count 101
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 133 place count 109 transition count 77
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 181 place count 85 transition count 77
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 186 place count 80 transition count 72
Iterating global reduction 4 with 5 rules applied. Total rules applied 191 place count 80 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 191 place count 80 transition count 71
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 193 place count 79 transition count 71
Performed 28 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 249 place count 51 transition count 39
Applied a total of 249 rules in 14 ms. Remains 51 /174 variables (removed 123) and now considering 39/169 (removed 130) transitions.
// Phase 1: matrix 39 rows 51 cols
[2022-05-16 00:20:33] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:20:33] [INFO ] Implicit Places using invariants in 64 ms returned [15, 16, 21, 29, 37, 43, 50]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 66 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/174 places, 39/169 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 44 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 42 transition count 37
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 39 transition count 34
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 39 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 38 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 38 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 37 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 37 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 36 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 35 transition count 39
Applied a total of 18 rules in 9 ms. Remains 35 /44 variables (removed 9) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 35 cols
[2022-05-16 00:20:33] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:20:33] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 39 rows 35 cols
[2022-05-16 00:20:33] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:20:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 00:20:33] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/174 places, 39/169 transitions.
Finished structural reductions, in 2 iterations. Remains : 35/174 places, 39/169 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s18 1), p0:(EQ s0 0)], 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 14162 reset in 181 ms.
Product exploration explored 100000 steps with 14216 reset in 175 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Detected a total of 3/35 stabilizing places and 5/39 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 266 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 831 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 169 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 35 cols
[2022-05-16 00:20:34] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:20:34] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:20:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-16 00:20:34] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 366 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 39 rows 35 cols
[2022-05-16 00:20:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:20:35] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 00:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 00:20:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 00:20:35] [INFO ] [Real]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-16 00:20:35] [INFO ] Computed and/alt/rep : 35/183/35 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 00:20:35] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 35 cols
[2022-05-16 00:20:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:20:35] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 39 rows 35 cols
[2022-05-16 00:20:35] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:20:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 00:20:35] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-05-16 00:20:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 39 rows 35 cols
[2022-05-16 00:20:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:20:35] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 39/39 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Detected a total of 3/35 stabilizing places and 5/39 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 39 rows 35 cols
[2022-05-16 00:20:36] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:20:36] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-16 00:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:20:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 00:20:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 00:20:36] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-16 00:20:36] [INFO ] Computed and/alt/rep : 35/183/35 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 00:20:36] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14122 reset in 112 ms.
Product exploration explored 100000 steps with 14284 reset in 119 ms.
Built C files in :
/tmp/ltsmin6776831399691578289
[2022-05-16 00:20:36] [INFO ] Computing symmetric may disable matrix : 39 transitions.
[2022-05-16 00:20:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:20:36] [INFO ] Computing symmetric may enable matrix : 39 transitions.
[2022-05-16 00:20:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:20:36] [INFO ] Computing Do-Not-Accords matrix : 39 transitions.
[2022-05-16 00:20:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:20:36] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6776831399691578289
Running compilation step : cd /tmp/ltsmin6776831399691578289;'/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 167 ms.
Running link step : cd /tmp/ltsmin6776831399691578289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6776831399691578289;'/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/stateBased819111025490542006.hoa' '--buchi-type=spotba'
LTSmin run took 128 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-02b-LTLFireability-13 finished in 3442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 173 transition count 110
Reduce places removed 58 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 65 rules applied. Total rules applied 123 place count 115 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 127 place count 111 transition count 103
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 127 place count 111 transition count 79
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 175 place count 87 transition count 79
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 179 place count 83 transition count 75
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 83 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 183 place count 83 transition count 74
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 185 place count 82 transition count 74
Performed 28 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 241 place count 54 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 53 transition count 41
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 246 place count 50 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 247 place count 49 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 247 place count 49 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 251 place count 47 transition count 38
Applied a total of 251 rules in 10 ms. Remains 47 /174 variables (removed 127) and now considering 38/169 (removed 131) transitions.
// Phase 1: matrix 38 rows 47 cols
[2022-05-16 00:20:37] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:20:37] [INFO ] Implicit Places using invariants in 38 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/174 places, 38/169 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 42 transition count 34
Applied a total of 8 rules in 1 ms. Remains 42 /46 variables (removed 4) and now considering 34/38 (removed 4) transitions.
// Phase 1: matrix 34 rows 42 cols
[2022-05-16 00:20:37] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 00:20:37] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 34 rows 42 cols
[2022-05-16 00:20:37] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 00:20:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:20:37] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/174 places, 34/169 transitions.
Finished structural reductions, in 2 iterations. Remains : 42/174 places, 34/169 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(NEQ s17 1), p0:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-14 finished in 315 ms.
All properties solved by simple procedures.
Total runtime 51004 ms.

BK_STOP 1652660437506

--------------------
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-02b"
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-02b, 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-165245689200396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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