Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593100436.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
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 r005-oct2-167813593100436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.1K Feb 25 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 18:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 18:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 36K Mar 5 18:22 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 1678513313493

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 05:41:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 05:41:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:41:55] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2023-03-11 05:41:55] [INFO ] Transformed 132 places.
[2023-03-11 05:41:55] [INFO ] Transformed 130 transitions.
[2023-03-11 05:41:55] [INFO ] Found NUPN structural information;
[2023-03-11 05:41:55] [INFO ] Parsed PT model containing 132 places and 130 transitions and 420 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA AutoFlight-PT-05a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 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 13 ms. Remains 132 /132 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 132 cols
[2023-03-11 05:41:55] [INFO ] Computed 34 place invariants in 8 ms
[2023-03-11 05:41:55] [INFO ] Implicit Places using invariants in 359 ms returned [14, 38, 41, 44, 47, 77, 99, 117, 129]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 388 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/132 places, 105/105 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 104
Applied a total of 2 rules in 6 ms. Remains 122 /123 variables (removed 1) and now considering 104/105 (removed 1) transitions.
// Phase 1: matrix 104 rows 122 cols
[2023-03-11 05:41:55] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-11 05:41:56] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-11 05:41:56] [INFO ] Invariant cache hit.
[2023-03-11 05:41:56] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 05:41:56] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 122/132 places, 104/105 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 728 ms. Remains : 122/132 places, 104/105 transitions.
Support contains 45 out of 122 places after structural reductions.
[2023-03-11 05:41:56] [INFO ] Flatten gal took : 43 ms
[2023-03-11 05:41:56] [INFO ] Flatten gal took : 10 ms
[2023-03-11 05:41:56] [INFO ] Input system was already deterministic with 104 transitions.
Support contains 43 out of 122 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 314 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 34) seen :31
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-11 05:41:56] [INFO ] Invariant cache hit.
[2023-03-11 05:41:56] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2023-03-11 05:41:56] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA AutoFlight-PT-05a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(X(X(F(!p1))))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 92
Applied a total of 24 rules in 42 ms. Remains 110 /122 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 110 cols
[2023-03-11 05:41:57] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-11 05:41:57] [INFO ] Implicit Places using invariants in 126 ms returned [7, 27, 34, 45, 87, 93, 103, 109]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 127 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/122 places, 92/104 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
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
Applied a total of 10 rules in 5 ms. Remains 97 /102 variables (removed 5) and now considering 87/92 (removed 5) transitions.
// Phase 1: matrix 87 rows 97 cols
[2023-03-11 05:41:57] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 05:41:57] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-11 05:41:57] [INFO ] Invariant cache hit.
[2023-03-11 05:41:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 05:41:57] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 97/122 places, 87/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 332 ms. Remains : 97/122 places, 87/104 transitions.
Stuttering acceptance computed with spot in 320 ms :[p1, false, p1, p1, false, false]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(EQ s3 1), p0:(AND (EQ s19 1) (EQ s60 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8612 reset in 367 ms.
Product exploration explored 100000 steps with 8593 reset in 199 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 329 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[p1, p1, p1, p1]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1)]
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 139 ms :[p1, p1, p1, p1]
Support contains 1 out of 97 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-11 05:41:59] [INFO ] Invariant cache hit.
[2023-03-11 05:41:59] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-11 05:41:59] [INFO ] Invariant cache hit.
[2023-03-11 05:42:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 05:42:00] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-11 05:42:00] [INFO ] Invariant cache hit.
[2023-03-11 05:42:00] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 97/97 places, 87/87 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p1), (X p1), true]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[p1, p1, p1, p1]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (X p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 206 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 199 ms :[p1, p1, p1, p1]
Product exploration explored 100000 steps with 8579 reset in 219 ms.
Product exploration explored 100000 steps with 8669 reset in 168 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 149 ms :[p1, p1, p1, p1]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 87/87 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 97 transition count 87
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 20 place count 97 transition count 87
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 97 transition count 87
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 41 place count 84 transition count 74
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 54 place count 84 transition count 74
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 66 place count 84 transition count 74
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 79 transition count 69
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 79 transition count 69
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 76 rules in 33 ms. Remains 79 /97 variables (removed 18) and now considering 69/87 (removed 18) transitions.
[2023-03-11 05:42:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 69 rows 79 cols
[2023-03-11 05:42:02] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 05:42:02] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/97 places, 69/87 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 79/97 places, 69/87 transitions.
Built C files in :
/tmp/ltsmin1350570690482410009
[2023-03-11 05:42:02] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1350570690482410009
Running compilation step : cd /tmp/ltsmin1350570690482410009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 280 ms.
Running link step : cd /tmp/ltsmin1350570690482410009;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1350570690482410009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17931156391471556480.hoa' '--buchi-type=spotba'
LTSmin run took 163 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-05a-LTLFireability-00 finished in 5462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(((p0 U p1)&&X(p2))))))))'
Support contains 6 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 103
Applied a total of 2 rules in 3 ms. Remains 121 /122 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 121 cols
[2023-03-11 05:42:02] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-11 05:42:02] [INFO ] Implicit Places using invariants in 61 ms returned [7, 20, 34, 45, 98, 104, 114]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 62 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/122 places, 103/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 111 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 111 transition count 100
Applied a total of 6 rules in 2 ms. Remains 111 /114 variables (removed 3) and now considering 100/103 (removed 3) transitions.
// Phase 1: matrix 100 rows 111 cols
[2023-03-11 05:42:02] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-11 05:42:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-11 05:42:02] [INFO ] Invariant cache hit.
[2023-03-11 05:42:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 05:42:03] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/122 places, 100/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 231 ms. Remains : 111/122 places, 100/104 transitions.
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(OR p1 p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s25 1) (EQ s72 1)), p0:(AND (EQ s42 1) (EQ s110 1)), p2:(OR (AND (EQ s42 1) (EQ s110 1)) (AND (EQ s19 1) (EQ s66 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-01 finished in 671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(G(p1) U (G(p2) U p3))))'
Support contains 7 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 92
Applied a total of 24 rules in 10 ms. Remains 110 /122 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 110 cols
[2023-03-11 05:42:03] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-11 05:42:03] [INFO ] Implicit Places using invariants in 80 ms returned [7, 20, 27, 34, 45, 87, 103, 109]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 87 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/122 places, 92/104 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
Applied a total of 8 rules in 1 ms. Remains 98 /102 variables (removed 4) and now considering 88/92 (removed 4) transitions.
// Phase 1: matrix 88 rows 98 cols
[2023-03-11 05:42:03] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-11 05:42:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 05:42:03] [INFO ] Invariant cache hit.
[2023-03-11 05:42:03] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/122 places, 88/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 98/122 places, 88/104 transitions.
Stuttering acceptance computed with spot in 494 ms :[true, (AND (NOT p0) (NOT p3)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p3)), (NOT p1)]
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=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=3 dest: 10}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND p3 p2 p1 (NOT p0)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 10}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 11}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p3 p2), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=7 dest: 7}, { cond=(AND p3 p2 (NOT p1)), acceptance={0} source=7 dest: 8}, { cond=(AND p3 p2 p1), acceptance={0} source=7 dest: 9}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=7 dest: 10}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=7 dest: 11}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p2 p1), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 11}], [{ cond=(NOT p1), acceptance={0} source=10 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={0} source=10 dest: 10}, { cond=(AND p3 p1), acceptance={0} source=10 dest: 11}], [{ cond=(NOT p1), acceptance={} source=11 dest: 0}, { cond=p1, acceptance={} source=11 dest: 11}]], initial=1, aps=[p3:(AND (EQ s37 1) (EQ s91 1)), p2:(AND (EQ s84 1) (EQ s97 1)), p1:(AND (EQ s10 1) (EQ s71 1)), p0:(AND (EQ s84 1) (EQ s97 1) (EQ s54 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Product exploration explored 100000 steps with 50000 reset in 254 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) p2 p1 (NOT p0)))), (X (NOT (AND p3 p2 p1 (NOT p0)))), (X (NOT (AND p3 p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p3 p1 (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND p3 p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p3 p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p2 p1)))), true, (X (X (NOT (AND (NOT p3) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) p2 (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 27 factoid took 884 ms. Reduced automaton from 12 states, 40 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLFireability-03 finished in 2132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((G(F((p2 U (p3||G(p2)))))||p1))))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 96
Applied a total of 16 rules in 7 ms. Remains 114 /122 variables (removed 8) and now considering 96/104 (removed 8) transitions.
// Phase 1: matrix 96 rows 114 cols
[2023-03-11 05:42:05] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-11 05:42:05] [INFO ] Implicit Places using invariants in 87 ms returned [7, 20, 27, 34, 91, 97, 107, 113]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 88 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/122 places, 96/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 103 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 93
Applied a total of 6 rules in 1 ms. Remains 103 /106 variables (removed 3) and now considering 93/96 (removed 3) transitions.
// Phase 1: matrix 93 rows 103 cols
[2023-03-11 05:42:05] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 05:42:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 05:42:05] [INFO ] Invariant cache hit.
[2023-03-11 05:42:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:42:05] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/122 places, 93/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 103/122 places, 93/104 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s41 1) (EQ s101 1)), p1:(OR (EQ s41 0) (EQ s101 0)), p3:(AND (NEQ s49 1) (NEQ s70 1)), p2:(NEQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29759 reset in 212 ms.
Product exploration explored 100000 steps with 29476 reset in 213 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 287 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:42:06] [INFO ] Invariant cache hit.
[2023-03-11 05:42:06] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:42:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-11 05:42:07] [INFO ] After 60ms 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 p0) p1 p3 p2), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p1) p2 (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLFireability-04 finished in 1714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(!p0)&&X(G(p1)))) U (p1&&X(p0))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 92
Applied a total of 24 rules in 10 ms. Remains 110 /122 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 110 cols
[2023-03-11 05:42:07] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-11 05:42:07] [INFO ] Implicit Places using invariants in 185 ms returned [7, 20, 27, 34, 45, 87, 93, 109]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 187 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/122 places, 92/104 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
[2023-03-11 05:42:07] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 05:42:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-11 05:42:07] [INFO ] Invariant cache hit.
[2023-03-11 05:42:07] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/122 places, 85/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 312 ms. Remains : 95/122 places, 85/104 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p0), p0, (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s21 1), p0:(AND (EQ s89 1) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 22 steps with 2 reset in 1 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-05 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 92
Applied a total of 24 rules in 22 ms. Remains 110 /122 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 110 cols
[2023-03-11 05:42:07] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-11 05:42:08] [INFO ] Implicit Places using invariants in 152 ms returned [7, 20, 27, 34, 45, 87, 93, 103, 109]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 173 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/122 places, 92/104 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 6 ms. Remains 93 /101 variables (removed 8) and now considering 84/92 (removed 8) transitions.
// Phase 1: matrix 84 rows 93 cols
[2023-03-11 05:42:08] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-11 05:42:08] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-11 05:42:08] [INFO ] Invariant cache hit.
[2023-03-11 05:42:08] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/122 places, 84/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 367 ms. Remains : 93/122 places, 84/104 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-06 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: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-06 finished in 609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 95
Applied a total of 18 rules in 14 ms. Remains 113 /122 variables (removed 9) and now considering 95/104 (removed 9) transitions.
// Phase 1: matrix 95 rows 113 cols
[2023-03-11 05:42:08] [INFO ] Computed 25 place invariants in 13 ms
[2023-03-11 05:42:08] [INFO ] Implicit Places using invariants in 116 ms returned [7, 20, 27, 34, 45, 90, 96, 106, 112]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 118 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/122 places, 95/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 92
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 92
Applied a total of 6 rules in 2 ms. Remains 101 /104 variables (removed 3) and now considering 92/95 (removed 3) transitions.
// Phase 1: matrix 92 rows 101 cols
[2023-03-11 05:42:08] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-11 05:42:08] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-11 05:42:08] [INFO ] Invariant cache hit.
[2023-03-11 05:42:08] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/122 places, 92/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 294 ms. Remains : 101/122 places, 92/104 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s67 1) (AND (EQ s19 1) (EQ s65 1))), p1:(NEQ s67 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 120 steps with 4 reset in 1 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-07 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||F(G(p2))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 116 transition count 70
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 71 place count 83 transition count 70
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 71 place count 83 transition count 58
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 100 place count 66 transition count 58
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 100 place count 66 transition count 53
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 61 transition count 53
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 59 transition count 51
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 59 transition count 51
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 128 place count 52 transition count 44
Applied a total of 128 rules in 18 ms. Remains 52 /122 variables (removed 70) and now considering 44/104 (removed 60) transitions.
// Phase 1: matrix 44 rows 52 cols
[2023-03-11 05:42:08] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-11 05:42:08] [INFO ] Implicit Places using invariants in 69 ms returned [37, 41, 47, 51]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 71 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/122 places, 44/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 45 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 45 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 44 transition count 40
Applied a total of 8 rules in 3 ms. Remains 44 /48 variables (removed 4) and now considering 40/44 (removed 4) transitions.
// Phase 1: matrix 40 rows 44 cols
[2023-03-11 05:42:08] [INFO ] Computed 11 place invariants in 12 ms
[2023-03-11 05:42:09] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-11 05:42:09] [INFO ] Invariant cache hit.
[2023-03-11 05:42:09] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/122 places, 40/104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 44/122 places, 40/104 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s11 1), p0:(EQ s16 1), p2:(NEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5728 reset in 175 ms.
Stack based approach found an accepted trace after 79545 steps with 4582 reset with depth 13 and stack size 13 in 118 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-08 finished in 643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||X((G(p2) U (!p3&&G(p2))))||p0)))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 92
Applied a total of 24 rules in 8 ms. Remains 110 /122 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 110 cols
[2023-03-11 05:42:09] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-11 05:42:09] [INFO ] Implicit Places using invariants in 188 ms returned [7, 20, 34, 45, 87, 93, 103, 109]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 189 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/122 places, 92/104 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
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
Applied a total of 12 rules in 2 ms. Remains 96 /102 variables (removed 6) and now considering 86/92 (removed 6) transitions.
// Phase 1: matrix 86 rows 96 cols
[2023-03-11 05:42:09] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-11 05:42:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-11 05:42:09] [INFO ] Invariant cache hit.
[2023-03-11 05:42:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 05:42:09] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/122 places, 86/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 316 ms. Remains : 96/122 places, 86/104 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (OR (NOT p2) p3), (OR (AND p0 (NOT p1) p3) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p3 p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p3 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (NEQ s25 1) (NEQ s68 1)), p1:(EQ s21 0), p3:(AND (EQ s25 1) (EQ s68 1)), p2:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1605 steps with 53 reset in 7 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-09 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 122 transition count 91
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 109 transition count 91
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 26 place count 109 transition count 77
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 54 place count 95 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 93 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 93 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 92 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 92 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 91 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 91 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 90 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 90 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 89 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 89 transition count 71
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 86 place count 79 transition count 61
Applied a total of 86 rules in 38 ms. Remains 79 /122 variables (removed 43) and now considering 61/104 (removed 43) transitions.
// Phase 1: matrix 61 rows 79 cols
[2023-03-11 05:42:10] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-11 05:42:10] [INFO ] Implicit Places using invariants in 97 ms returned [14, 19, 24, 25, 26, 27, 28, 29, 30, 64, 72, 78]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 98 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/122 places, 61/104 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 67 transition count 54
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 60 transition count 49
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 24 place count 55 transition count 49
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 24 place count 55 transition count 46
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 52 transition count 46
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 50 transition count 44
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 50 transition count 44
Applied a total of 34 rules in 3 ms. Remains 50 /67 variables (removed 17) and now considering 44/61 (removed 17) transitions.
// Phase 1: matrix 44 rows 50 cols
[2023-03-11 05:42:10] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-11 05:42:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 05:42:10] [INFO ] Invariant cache hit.
[2023-03-11 05:42:10] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 05:42:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/122 places, 44/104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 50/122 places, 44/104 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-11 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 s5 1) (EQ s24 1)), p1:(AND (EQ s40 1) (EQ s49 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 13 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-11 finished in 425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 122 transition count 91
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 109 transition count 91
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 26 place count 109 transition count 76
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 56 place count 94 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 92 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 92 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 91 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 91 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 90 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 90 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 89 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 89 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 88 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 88 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 87 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 87 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 86 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 86 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 85 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 85 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 84 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 84 transition count 66
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 94 place count 75 transition count 57
Applied a total of 94 rules in 21 ms. Remains 75 /122 variables (removed 47) and now considering 57/104 (removed 47) transitions.
// Phase 1: matrix 57 rows 75 cols
[2023-03-11 05:42:10] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-11 05:42:10] [INFO ] Implicit Places using invariants in 87 ms returned [5, 15, 20, 25, 26, 27, 28, 29, 30, 31, 55, 60, 68, 74]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 88 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/122 places, 57/104 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 61 transition count 44
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 48 transition count 44
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 45 transition count 41
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 45 transition count 41
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 36 place count 43 transition count 39
Applied a total of 36 rules in 19 ms. Remains 43 /61 variables (removed 18) and now considering 39/57 (removed 18) transitions.
// Phase 1: matrix 39 rows 43 cols
[2023-03-11 05:42:10] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 05:42:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 05:42:10] [INFO ] Invariant cache hit.
[2023-03-11 05:42:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 05:42:10] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/122 places, 39/104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 43/122 places, 39/104 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s7 1) (NEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5425 reset in 104 ms.
Stack based approach found an accepted trace after 5928 steps with 311 reset with depth 9 and stack size 9 in 9 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-12 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 112 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 112 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 92
Applied a total of 24 rules in 8 ms. Remains 110 /122 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 110 cols
[2023-03-11 05:42:11] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-11 05:42:11] [INFO ] Implicit Places using invariants in 99 ms returned [7, 20, 27, 34, 45, 87, 93, 103, 109]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 100 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/122 places, 92/104 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 3 ms. Remains 93 /101 variables (removed 8) and now considering 84/92 (removed 8) transitions.
// Phase 1: matrix 84 rows 93 cols
[2023-03-11 05:42:11] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-11 05:42:11] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-11 05:42:11] [INFO ] Invariant cache hit.
[2023-03-11 05:42:11] [INFO ] Implicit Places using invariants and state equation in 73 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/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 236 ms. Remains : 93/122 places, 84/104 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s30 1) (EQ s89 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][false, false]]
Stuttering criterion allowed to conclude after 20 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 328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(X(X(p3))||p2))))'
Support contains 7 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 103
Applied a total of 2 rules in 1 ms. Remains 121 /122 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 121 cols
[2023-03-11 05:42:11] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-11 05:42:11] [INFO ] Implicit Places using invariants in 85 ms returned [7, 20, 27, 34, 45, 98, 104]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 86 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/122 places, 103/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 101
Applied a total of 4 rules in 3 ms. Remains 112 /114 variables (removed 2) and now considering 101/103 (removed 2) transitions.
// Phase 1: matrix 101 rows 112 cols
[2023-03-11 05:42:11] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-11 05:42:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 05:42:11] [INFO ] Invariant cache hit.
[2023-03-11 05:42:11] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/122 places, 101/104 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 248 ms. Remains : 112/122 places, 101/104 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}]], initial=0, aps=[p1:(NEQ s24 1), p0:(EQ s17 1), p2:(OR (EQ s14 1) (AND (EQ s67 1) (EQ s111 1))), p3:(AND (EQ s105 1) (EQ s110 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-15 finished in 584 ms.
All properties solved by simple procedures.
Total runtime 16714 ms.

BK_STOP 1678513332101

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-5348"
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 r005-oct2-167813593100436"
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 ;