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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 7.2K Apr 30 02:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 02:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 02:16 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.3K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 36K 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-05a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652661190238

Running Version 202205111006
[2022-05-16 00:33:11] [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:33:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:33:11] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2022-05-16 00:33:11] [INFO ] Transformed 132 places.
[2022-05-16 00:33:11] [INFO ] Transformed 130 transitions.
[2022-05-16 00:33:11] [INFO ] Found NUPN structural information;
[2022-05-16 00:33:11] [INFO ] Parsed PT model containing 132 places and 130 transitions in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA AutoFlight-PT-05a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 105/105 transitions.
Applied a total of 0 rules in 14 ms. Remains 132 /132 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 132 cols
[2022-05-16 00:33:11] [INFO ] Computed 34 place invariants in 13 ms
[2022-05-16 00:33:12] [INFO ] Implicit Places using invariants in 209 ms returned [21, 28, 38, 41, 44, 47, 77, 99, 105, 111]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 247 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/132 places, 105/105 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/132 places, 105/105 transitions.
Support contains 35 out of 122 places after structural reductions.
[2022-05-16 00:33:12] [INFO ] Flatten gal took : 32 ms
[2022-05-16 00:33:12] [INFO ] Flatten gal took : 12 ms
[2022-05-16 00:33:12] [INFO ] Input system was already deterministic with 105 transitions.
Incomplete random walk after 10000 steps, including 285 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 30) seen :24
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 105 rows 122 cols
[2022-05-16 00:33:12] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-16 00:33:12] [INFO ] [Real]Absence check using 24 positive place invariants in 5 ms returned sat
[2022-05-16 00:33:13] [INFO ] After 71ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2022-05-16 00:33:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 00:33:13] [INFO ] After 23ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 00:33:13] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 00:33:13] [INFO ] [Nat]Absence check using 24 positive place invariants in 4 ms returned sat
[2022-05-16 00:33:13] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 00:33:13] [INFO ] After 27ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-16 00:33:13] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-16 00:33:13] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 20 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 5 properties in 6 ms.
Computed a total of 5 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F(X(F((p0 U G(p1))))))) U p2))'
Support contains 7 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 105/105 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 122 transition count 88
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 105 transition count 88
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 34 place count 105 transition count 73
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 64 place count 90 transition count 73
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 87 transition count 70
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 87 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 86 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 86 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 85 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 85 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 84 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 84 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 83 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 83 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 82 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 82 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 81 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 81 transition count 64
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 100 place count 72 transition count 55
Applied a total of 100 rules in 58 ms. Remains 72 /122 variables (removed 50) and now considering 55/105 (removed 50) transitions.
// Phase 1: matrix 55 rows 72 cols
[2022-05-16 00:33:13] [INFO ] Computed 24 place invariants in 4 ms
[2022-05-16 00:33:13] [INFO ] Implicit Places using invariants in 71 ms returned [5, 11, 24, 25, 26, 27, 28, 29, 30, 63, 69, 71]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 72 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/122 places, 55/105 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 60 transition count 49
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 11 rules applied. Total rules applied 17 place count 54 transition count 44
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 22 place count 49 transition count 44
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 47 transition count 42
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 47 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 46 transition count 41
Applied a total of 28 rules in 6 ms. Remains 46 /60 variables (removed 14) and now considering 41/55 (removed 14) transitions.
// Phase 1: matrix 41 rows 46 cols
[2022-05-16 00:33:13] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 00:33:13] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 41 rows 46 cols
[2022-05-16 00:33:13] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 00:33:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 00:33:13] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/122 places, 41/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 46/122 places, 41/105 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (EQ s20 1) (EQ s32 1)) (AND (EQ s40 1) (EQ s45 1) (EQ s7 1))), p1:(AND (EQ s5 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-00 finished in 505 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(p0)))&&F(G(F(G(p1))))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 102
Applied a total of 6 rules in 5 ms. Remains 119 /122 variables (removed 3) and now considering 102/105 (removed 3) transitions.
// Phase 1: matrix 102 rows 119 cols
[2022-05-16 00:33:14] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:33:14] [INFO ] Implicit Places using invariants in 68 ms returned [14, 33, 44, 104, 110, 116, 118]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 69 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/122 places, 102/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 99
Applied a total of 6 rules in 4 ms. Remains 109 /112 variables (removed 3) and now considering 99/102 (removed 3) transitions.
// Phase 1: matrix 99 rows 109 cols
[2022-05-16 00:33:14] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:14] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 99 rows 109 cols
[2022-05-16 00:33:14] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 00:33:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 00:33:14] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/122 places, 99/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 109/122 places, 99/105 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s68 1)), p1:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-01 finished in 333 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(X((G(p0)&&X(p1))))))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 109 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 109 transition count 92
Applied a total of 26 rules in 16 ms. Remains 109 /122 variables (removed 13) and now considering 92/105 (removed 13) transitions.
// Phase 1: matrix 92 rows 109 cols
[2022-05-16 00:33:14] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:33:14] [INFO ] Implicit Places using invariants in 56 ms returned [7, 33, 44, 94, 100, 106, 108]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 58 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/122 places, 92/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 98 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 98 transition count 88
Applied a total of 8 rules in 2 ms. Remains 98 /102 variables (removed 4) and now considering 88/92 (removed 4) transitions.
// Phase 1: matrix 88 rows 98 cols
[2022-05-16 00:33:14] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:14] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 88 rows 98 cols
[2022-05-16 00:33:14] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 00:33:14] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/122 places, 88/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 98/122 places, 88/105 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(EQ s2 1), p1:(OR (EQ s13 0) (EQ s68 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-03 finished in 426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F((G(p2)&&p1))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 109 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 109 transition count 92
Applied a total of 26 rules in 31 ms. Remains 109 /122 variables (removed 13) and now considering 92/105 (removed 13) transitions.
// Phase 1: matrix 92 rows 109 cols
[2022-05-16 00:33:15] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:33:15] [INFO ] Implicit Places using invariants in 92 ms returned [7, 14, 33, 44, 94, 100, 106, 108]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 93 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/122 places, 92/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 93 transition count 84
Applied a total of 16 rules in 9 ms. Remains 93 /101 variables (removed 8) and now considering 84/92 (removed 8) transitions.
// Phase 1: matrix 84 rows 93 cols
[2022-05-16 00:33:15] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:33:15] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 84 rows 93 cols
[2022-05-16 00:33:15] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:33:15] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/122 places, 84/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 93/122 places, 84/105 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s20 0) (EQ s27 0)), p2:(EQ s38 0), p0:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-04 finished in 479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(G(p0))))||(X(F(p1))&&X(p2))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 109 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 109 transition count 92
Applied a total of 26 rules in 19 ms. Remains 109 /122 variables (removed 13) and now considering 92/105 (removed 13) transitions.
// Phase 1: matrix 92 rows 109 cols
[2022-05-16 00:33:15] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:33:15] [INFO ] Implicit Places using invariants in 56 ms returned [7, 14, 33, 44, 94, 100, 106]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 59 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/122 places, 92/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 98 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 98 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 97 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 96 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 95 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 95 transition count 85
Applied a total of 14 rules in 6 ms. Remains 95 /102 variables (removed 7) and now considering 85/92 (removed 7) transitions.
// Phase 1: matrix 85 rows 95 cols
[2022-05-16 00:33:15] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:15] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 85 rows 95 cols
[2022-05-16 00:33:15] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:15] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/122 places, 85/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 95/122 places, 85/105 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (EQ s84 1) (EQ s94 1)), p2:(AND (EQ s6 1) (EQ s73 1)), p0:(OR (EQ s6 0) (EQ s73 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, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3485 steps with 103 reset in 34 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-05 finished in 386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 105/105 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 122 transition count 88
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 105 transition count 88
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 34 place count 105 transition count 73
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 64 place count 90 transition count 73
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 87 transition count 70
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 87 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 86 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 86 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 85 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 85 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 84 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 84 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 83 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 83 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 82 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 82 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 81 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 81 transition count 64
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 73 transition count 56
Applied a total of 98 rules in 17 ms. Remains 73 /122 variables (removed 49) and now considering 56/105 (removed 49) transitions.
// Phase 1: matrix 56 rows 73 cols
[2022-05-16 00:33:15] [INFO ] Computed 24 place invariants in 0 ms
[2022-05-16 00:33:15] [INFO ] Implicit Places using invariants in 60 ms returned [5, 10, 25, 26, 27, 28, 29, 30, 31, 59, 64, 70, 72]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 61 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/122 places, 56/105 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 60 transition count 45
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 49 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 46 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 46 transition count 42
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 2 with 4 rules applied. Total rules applied 32 place count 44 transition count 40
Applied a total of 32 rules in 6 ms. Remains 44 /60 variables (removed 16) and now considering 40/56 (removed 16) transitions.
// Phase 1: matrix 40 rows 44 cols
[2022-05-16 00:33:15] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 00:33:15] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 40 rows 44 cols
[2022-05-16 00:33:15] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 00:33:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 00:33:16] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/122 places, 40/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 44/122 places, 40/105 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s39 1)), p1:(EQ s20 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 19 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-07 finished in 340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1)) U p2))'
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 105/105 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 104
Applied a total of 2 rules in 3 ms. Remains 121 /122 variables (removed 1) and now considering 104/105 (removed 1) transitions.
// Phase 1: matrix 104 rows 121 cols
[2022-05-16 00:33:16] [INFO ] Computed 24 place invariants in 3 ms
[2022-05-16 00:33:16] [INFO ] Implicit Places using invariants in 78 ms returned [7, 14, 33, 106, 112, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 79 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/122 places, 104/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 101
Applied a total of 6 rules in 3 ms. Remains 112 /115 variables (removed 3) and now considering 101/104 (removed 3) transitions.
// Phase 1: matrix 101 rows 112 cols
[2022-05-16 00:33:16] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-16 00:33:16] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 101 rows 112 cols
[2022-05-16 00:33:16] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-16 00:33:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:33:16] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/122 places, 101/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 112/122 places, 101/105 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} 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=[p2:(AND (EQ s68 1) (EQ s111 1)), p0:(AND (EQ s93 1) (EQ s111 1)), p1:(AND (EQ s41 1) (EQ s109 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-05a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-08 finished in 430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 109 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 109 transition count 92
Applied a total of 26 rules in 12 ms. Remains 109 /122 variables (removed 13) and now considering 92/105 (removed 13) transitions.
// Phase 1: matrix 92 rows 109 cols
[2022-05-16 00:33:16] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:33:16] [INFO ] Implicit Places using invariants in 65 ms returned [7, 14, 33, 44, 94, 100, 106, 108]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 66 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/122 places, 92/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 93 transition count 84
Applied a total of 16 rules in 4 ms. Remains 93 /101 variables (removed 8) and now considering 84/92 (removed 8) transitions.
// Phase 1: matrix 84 rows 93 cols
[2022-05-16 00:33:16] [INFO ] Computed 16 place invariants in 4 ms
[2022-05-16 00:33:16] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 84 rows 93 cols
[2022-05-16 00:33:16] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:33:16] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/122 places, 84/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 93/122 places, 84/105 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s34 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, null][false, false, false]]
Product exploration explored 100000 steps with 8732 reset in 202 ms.
Stack based approach found an accepted trace after 20578 steps with 1769 reset with depth 29 and stack size 29 in 38 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-09 finished in 597 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(((p0 U G(p1))||G(F(p2))))||p3)))'
Support contains 4 out of 122 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 : 122/122 places, 105/105 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 122 transition count 90
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 107 transition count 90
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 107 transition count 75
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 92 transition count 75
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 89 transition count 72
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 89 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 88 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 88 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 87 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 87 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 86 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 86 transition count 69
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 90 place count 77 transition count 60
Applied a total of 90 rules in 9 ms. Remains 77 /122 variables (removed 45) and now considering 60/105 (removed 45) transitions.
// Phase 1: matrix 60 rows 77 cols
[2022-05-16 00:33:17] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:33:17] [INFO ] Implicit Places using invariants in 44 ms returned [5, 10, 24, 25, 26, 27, 28, 29, 30, 74, 76]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 45 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/122 places, 60/105 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 66 transition count 53
Reduce places removed 7 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 12 rules applied. Total rules applied 19 place count 59 transition count 48
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 24 place count 54 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 54 transition count 47
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 26 place count 53 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 52 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 52 transition count 46
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 3 with 4 rules applied. Total rules applied 32 place count 50 transition count 44
Applied a total of 32 rules in 6 ms. Remains 50 /66 variables (removed 16) and now considering 44/60 (removed 16) transitions.
// Phase 1: matrix 44 rows 50 cols
[2022-05-16 00:33:17] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:33:17] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 44 rows 50 cols
[2022-05-16 00:33:17] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:33:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 00:33:17] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/122 places, 44/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 50/122 places, 44/105 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(AND (EQ s46 1) (EQ s49 1)), p1:(EQ s11 1), p2:(EQ s23 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5456 reset in 213 ms.
Product exploration explored 100000 steps with 5370 reset in 145 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 9 factoid took 424 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 175 steps, including 10 resets, run visited all 2 properties in 4 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 277 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 50 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 : 50/50 places, 44/44 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 50 cols
[2022-05-16 00:33:18] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:33:18] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 44 rows 50 cols
[2022-05-16 00:33:18] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:33:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 00:33:19] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-05-16 00:33:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 50 cols
[2022-05-16 00:33:19] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:33:19] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 44/44 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 411 steps, including 17 resets, run visited all 2 properties in 2 ms. (steps per millisecond=205 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5380 reset in 145 ms.
Product exploration explored 100000 steps with 5437 reset in 145 ms.
Built C files in :
/tmp/ltsmin10533443083623038690
[2022-05-16 00:33:20] [INFO ] Computing symmetric may disable matrix : 44 transitions.
[2022-05-16 00:33:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:33:20] [INFO ] Computing symmetric may enable matrix : 44 transitions.
[2022-05-16 00:33:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:33:20] [INFO ] Computing Do-Not-Accords matrix : 44 transitions.
[2022-05-16 00:33:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:33:20] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10533443083623038690
Running compilation step : cd /tmp/ltsmin10533443083623038690;'/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 301 ms.
Running link step : cd /tmp/ltsmin10533443083623038690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin10533443083623038690;'/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/stateBased16043483127880876939.hoa' '--buchi-type=spotba'
LTSmin run took 583 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-05a-LTLFireability-10 finished in 4103 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X((p0 U p1))||p2))||X(p3)))'
Support contains 5 out of 122 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 103
Applied a total of 4 rules in 2 ms. Remains 120 /122 variables (removed 2) and now considering 103/105 (removed 2) transitions.
// Phase 1: matrix 103 rows 120 cols
[2022-05-16 00:33:21] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:33:21] [INFO ] Implicit Places using invariants in 65 ms returned [14, 44, 105, 111, 117]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 66 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/122 places, 103/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 100
Applied a total of 6 rules in 2 ms. Remains 112 /115 variables (removed 3) and now considering 100/103 (removed 3) transitions.
// Phase 1: matrix 100 rows 112 cols
[2022-05-16 00:33:21] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 00:33:21] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 100 rows 112 cols
[2022-05-16 00:33:21] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-16 00:33:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 00:33:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/122 places, 100/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 112/122 places, 100/105 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s7 1) (EQ s80 1)), p3:(OR (EQ s32 0) (EQ s48 0)), p1:(EQ s36 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]]
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-05a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLFireability-12 finished in 936 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(p1))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 109 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 109 transition count 92
Applied a total of 26 rules in 12 ms. Remains 109 /122 variables (removed 13) and now considering 92/105 (removed 13) transitions.
// Phase 1: matrix 92 rows 109 cols
[2022-05-16 00:33:22] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:33:22] [INFO ] Implicit Places using invariants in 79 ms returned [7, 14, 33, 44, 94, 100, 108]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 80 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/122 places, 92/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 98 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 98 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 97 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 96 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 95 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 95 transition count 85
Applied a total of 14 rules in 4 ms. Remains 95 /102 variables (removed 7) and now considering 85/92 (removed 7) transitions.
// Phase 1: matrix 85 rows 95 cols
[2022-05-16 00:33:22] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 00:33:22] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 85 rows 95 cols
[2022-05-16 00:33:22] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:22] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/122 places, 85/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 95/122 places, 85/105 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(AND (EQ s6 1) (EQ s73 1)), p0:(AND (EQ s93 1) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-13 finished in 503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||F((X((F(p2) U X(p2)))&&p1)))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 103
Applied a total of 4 rules in 3 ms. Remains 120 /122 variables (removed 2) and now considering 103/105 (removed 2) transitions.
// Phase 1: matrix 103 rows 120 cols
[2022-05-16 00:33:22] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:33:22] [INFO ] Implicit Places using invariants in 71 ms returned [7, 14, 33, 44, 105, 111, 117]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 72 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/122 places, 103/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 100
Applied a total of 6 rules in 3 ms. Remains 110 /113 variables (removed 3) and now considering 100/103 (removed 3) transitions.
// Phase 1: matrix 100 rows 110 cols
[2022-05-16 00:33:22] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:22] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 100 rows 110 cols
[2022-05-16 00:33:22] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 00:33:22] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 110/122 places, 100/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 110/122 places, 100/105 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s41 1) (EQ s109 1)), p0:(EQ s0 0), p2:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33418 reset in 252 ms.
Product exploration explored 100000 steps with 33373 reset in 261 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/110 stabilizing places and 1/100 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 832 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 7 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 298 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 100 rows 110 cols
[2022-05-16 00:33:25] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 00:33:25] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-16 00:33:25] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:33:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-16 00:33:25] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F p0), (F (AND (NOT p2) p0)), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 974 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 324 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
// Phase 1: matrix 100 rows 110 cols
[2022-05-16 00:33:26] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:27] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-16 00:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:33:27] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-16 00:33:27] [INFO ] Computed and/alt/rep : 98/189/98 causal constraints (skipped 1 transitions) in 10 ms.
[2022-05-16 00:33:27] [INFO ] Added : 0 causal constraints over 0 iterations in 26 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 110 cols
[2022-05-16 00:33:27] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:27] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 100 rows 110 cols
[2022-05-16 00:33:27] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:27] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 110 cols
[2022-05-16 00:33:27] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:27] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 100/100 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/110 stabilizing places and 1/100 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p0), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 358 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Finished random walk after 181 steps, including 5 resets, run visited all 3 properties in 2 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p0), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F p0)]
Knowledge based reduction with 6 factoid took 433 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
// Phase 1: matrix 100 rows 110 cols
[2022-05-16 00:33:28] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:28] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-16 00:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:33:29] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-05-16 00:33:29] [INFO ] Computed and/alt/rep : 98/189/98 causal constraints (skipped 1 transitions) in 8 ms.
[2022-05-16 00:33:29] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 33318 reset in 274 ms.
Product exploration explored 100000 steps with 33326 reset in 278 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 100/100 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 110 transition count 100
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 32 place count 110 transition count 105
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 43 place count 110 transition count 105
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 74 place count 79 transition count 74
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 105 place count 79 transition count 74
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 116 place count 79 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 78 transition count 73
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 78 transition count 73
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 118 rules in 14 ms. Remains 78 /110 variables (removed 32) and now considering 73/100 (removed 27) transitions.
[2022-05-16 00:33:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 78 cols
[2022-05-16 00:33:30] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:30] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/110 places, 73/100 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/110 places, 73/100 transitions.
Product exploration explored 100000 steps with 33387 reset in 243 ms.
Product exploration explored 100000 steps with 33374 reset in 266 ms.
Built C files in :
/tmp/ltsmin16120482770066660267
[2022-05-16 00:33:31] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16120482770066660267
Running compilation step : cd /tmp/ltsmin16120482770066660267;'/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 247 ms.
Running link step : cd /tmp/ltsmin16120482770066660267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin16120482770066660267;'/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/stateBased14188371660413343632.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 110 cols
[2022-05-16 00:33:46] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 00:33:46] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 100 rows 110 cols
[2022-05-16 00:33:46] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:46] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 110 cols
[2022-05-16 00:33:46] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 00:33:46] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin15132433945278594746
[2022-05-16 00:33:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15132433945278594746
Running compilation step : cd /tmp/ltsmin15132433945278594746;'/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 203 ms.
Running link step : cd /tmp/ltsmin15132433945278594746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15132433945278594746;'/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/stateBased436019701842410316.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 00:34:01] [INFO ] Flatten gal took : 12 ms
[2022-05-16 00:34:01] [INFO ] Flatten gal took : 9 ms
[2022-05-16 00:34:01] [INFO ] Time to serialize gal into /tmp/LTL8152025393318135796.gal : 3 ms
[2022-05-16 00:34:01] [INFO ] Time to serialize properties into /tmp/LTL4253878528349023606.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8152025393318135796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4253878528349023606.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8152025...266
Read 1 LTL properties
Checking formula 0 : !((G((X(G("(p0==0)")))||(F(((X((F("(p0==1)"))U(X("(p0==1)"))))&&("(p51==1)"))&&("(p131==1)"))))))
Formula 0 simplified : !G(XG"(p0==0)" | F("(p51==1)" & "(p131==1)" & X(F"(p0==1)" U X"(p0==1)")))
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t48, t94, Intersection with reachable at eac...219
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
0 strongly connected components in search stack
6 transitions explored
3 items max in DFS search stack
47 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.509069,36492,1,0,182,83355,235,104,3265,85107,234
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-05a-LTLFireability-15 finished in 39454 ms.
All properties solved by simple procedures.
Total runtime 50728 ms.

BK_STOP 1652661242310

--------------------
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-05a"
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-05a, 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-165245689300436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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