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.r009-oct2-167813597900452.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 ltsminxred
Input is AutoFlight-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597900452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 17:59 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.2K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 18:03 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 43K 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-06a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678629511343

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:58:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 13:58:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:58:34] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-12 13:58:34] [INFO ] Transformed 157 places.
[2023-03-12 13:58:34] [INFO ] Transformed 155 transitions.
[2023-03-12 13:58:34] [INFO ] Found NUPN structural information;
[2023-03-12 13:58:34] [INFO ] Parsed PT model containing 157 places and 155 transitions and 500 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
FORMULA AutoFlight-PT-06a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 125/125 transitions.
Applied a total of 0 rules in 21 ms. Remains 157 /157 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 157 cols
[2023-03-12 13:58:35] [INFO ] Computed 40 place invariants in 27 ms
[2023-03-12 13:58:36] [INFO ] Implicit Places using invariants in 867 ms returned [7, 14, 21, 42, 48, 51, 54, 118, 124, 130, 136, 142, 148]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 916 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/157 places, 125/125 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 139 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 139 transition count 120
Applied a total of 10 rules in 24 ms. Remains 139 /144 variables (removed 5) and now considering 120/125 (removed 5) transitions.
// Phase 1: matrix 120 rows 139 cols
[2023-03-12 13:58:36] [INFO ] Computed 27 place invariants in 14 ms
[2023-03-12 13:58:36] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-12 13:58:36] [INFO ] Invariant cache hit.
[2023-03-12 13:58:36] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 13:58:36] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 139/157 places, 120/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1566 ms. Remains : 139/157 places, 120/125 transitions.
Support contains 42 out of 139 places after structural reductions.
[2023-03-12 13:58:37] [INFO ] Flatten gal took : 68 ms
[2023-03-12 13:58:37] [INFO ] Flatten gal took : 22 ms
[2023-03-12 13:58:37] [INFO ] Input system was already deterministic with 120 transitions.
Support contains 41 out of 139 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 291 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 29) seen :25
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:58:37] [INFO ] Invariant cache hit.
[2023-03-12 13:58:37] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2023-03-12 13:58:37] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:58:37] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned sat
[2023-03-12 13:58:38] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:58:38] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 13:58:38] [INFO ] After 57ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:58:38] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 22 ms to minimize.
[2023-03-12 13:58:38] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2023-03-12 13:58:38] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 1 ms to minimize.
[2023-03-12 13:58:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 393 ms
[2023-03-12 13:58:38] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 13:58:38] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 5 ms.
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 120/120 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 139 transition count 92
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 111 transition count 92
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 56 place count 111 transition count 78
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 84 place count 97 transition count 78
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 108 place count 85 transition count 66
Free-agglomeration rule applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 85 transition count 54
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 132 place count 73 transition count 54
Applied a total of 132 rules in 19 ms. Remains 73 /139 variables (removed 66) and now considering 54/120 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 73/139 places, 54/120 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished Best-First random walk after 924 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=462 )
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' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2023-03-12 13:58:39] [INFO ] Invariant cache hit.
[2023-03-12 13:58:39] [INFO ] Implicit Places using invariants in 376 ms returned [25, 32, 41, 50, 53, 85, 136, 138]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 393 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/139 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 122 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 122 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 121 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 121 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 120 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 120 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 119 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 119 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 118 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 118 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 117 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 117 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 116 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 116 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 115 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 115 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 114 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 114 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 113 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 111 transition count 100
Applied a total of 40 rules in 68 ms. Remains 111 /131 variables (removed 20) and now considering 100/120 (removed 20) transitions.
// Phase 1: matrix 100 rows 111 cols
[2023-03-12 13:58:39] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-12 13:58:39] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-12 13:58:39] [INFO ] Invariant cache hit.
[2023-03-12 13:58:40] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/139 places, 100/120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 837 ms. Remains : 111/139 places, 100/120 transitions.
Stuttering acceptance computed with spot in 440 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-00 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: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(EQ s18 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-00 finished in 1350 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(F(p0)))))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 139 /139 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 139 cols
[2023-03-12 13:58:40] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-12 13:58:40] [INFO ] Implicit Places using invariants in 372 ms returned [25, 32, 41, 50, 53, 85, 136, 138]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 373 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/139 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 122 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 122 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 121 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 121 transition count 110
Applied a total of 20 rules in 9 ms. Remains 121 /131 variables (removed 10) and now considering 110/120 (removed 10) transitions.
// Phase 1: matrix 110 rows 121 cols
[2023-03-12 13:58:40] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-12 13:58:41] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-12 13:58:41] [INFO ] Invariant cache hit.
[2023-03-12 13:58:41] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/139 places, 110/120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 909 ms. Remains : 121/139 places, 110/120 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(NEQ s58 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][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 387 ms.
Product exploration explored 100000 steps with 25000 reset in 293 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 169 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 245 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 114 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 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-12 13:58:43] [INFO ] Invariant cache hit.
[2023-03-12 13:58:43] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-12 13:58:43] [INFO ] Invariant cache hit.
[2023-03-12 13:58:43] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-12 13:58:43] [INFO ] Invariant cache hit.
[2023-03-12 13:58:44] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 621 ms. Remains : 121/121 places, 110/110 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 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 230 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 143 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 143 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 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 220 ms.
Product exploration explored 100000 steps with 25000 reset in 232 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 110/110 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 121 transition count 110
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 35 place count 121 transition count 110
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 121 transition count 110
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 69 place count 94 transition count 83
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 96 place count 94 transition count 83
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 111 place count 94 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 115 place count 90 transition count 79
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 119 place count 90 transition count 79
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 119 rules in 26 ms. Remains 90 /121 variables (removed 31) and now considering 79/110 (removed 31) transitions.
[2023-03-12 13:58:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 79 rows 90 cols
[2023-03-12 13:58:46] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-12 13:58:46] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/121 places, 79/110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 90/121 places, 79/110 transitions.
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 110/110 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 121 cols
[2023-03-12 13:58:46] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-12 13:58:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 13:58:46] [INFO ] Invariant cache hit.
[2023-03-12 13:58:46] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-12 13:58:46] [INFO ] Invariant cache hit.
[2023-03-12 13:58:46] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 121/121 places, 110/110 transitions.
Treatment of property AutoFlight-PT-06a-LTLFireability-01 finished in 6059 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(p0) U G(p1)))||F(!p2)))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 139 cols
[2023-03-12 13:58:46] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-12 13:58:46] [INFO ] Implicit Places using invariants in 81 ms returned [25, 32, 41, 50, 53, 85, 136, 138]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 82 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/139 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 122 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 122 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 121 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 121 transition count 110
Applied a total of 20 rules in 13 ms. Remains 121 /131 variables (removed 10) and now considering 110/120 (removed 10) transitions.
// Phase 1: matrix 110 rows 121 cols
[2023-03-12 13:58:46] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-12 13:58:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 13:58:46] [INFO ] Invariant cache hit.
[2023-03-12 13:58:46] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/139 places, 110/120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 327 ms. Remains : 121/139 places, 110/120 transitions.
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 (NOT p0)), (AND p2 (NOT p1) (NOT p0)), p2, (AND p2 (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s58 1), p1:(EQ s33 1), p0:(AND (EQ s21 1) (EQ s108 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 3 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-02 finished in 696 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||F(G(p1)))))'
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 139 cols
[2023-03-12 13:58:47] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 13:58:47] [INFO ] Implicit Places using invariants in 113 ms returned [25, 32, 41, 50, 53, 85, 136]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 115 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/139 places, 120/120 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 131 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 131 transition count 119
Applied a total of 2 rules in 3 ms. Remains 131 /132 variables (removed 1) and now considering 119/120 (removed 1) transitions.
// Phase 1: matrix 119 rows 131 cols
[2023-03-12 13:58:47] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-12 13:58:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 13:58:47] [INFO ] Invariant cache hit.
[2023-03-12 13:58:47] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/139 places, 119/120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 303 ms. Remains : 131/139 places, 119/120 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s42 1), p1:(AND (EQ s49 1) (EQ s130 1) (OR (EQ s22 0) (EQ s102 0)) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 218 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 p0) (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-06a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-06a-LTLFireability-03 finished in 985 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 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 133 transition count 82
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 80 place count 96 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 95 transition count 81
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 81 place count 95 transition count 68
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 113 place count 76 transition count 68
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 113 place count 76 transition count 62
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 125 place count 70 transition count 62
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 151 place count 57 transition count 49
Applied a total of 151 rules in 17 ms. Remains 57 /139 variables (removed 82) and now considering 49/120 (removed 71) transitions.
// Phase 1: matrix 49 rows 57 cols
[2023-03-12 13:58:48] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-12 13:58:48] [INFO ] Implicit Places using invariants in 41 ms returned [33, 54, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/139 places, 49/120 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 53 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 52 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 52 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 51 transition count 46
Applied a total of 6 rules in 4 ms. Remains 51 /54 variables (removed 3) and now considering 46/49 (removed 3) transitions.
// Phase 1: matrix 46 rows 51 cols
[2023-03-12 13:58:48] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 13:58:48] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-12 13:58:48] [INFO ] Invariant cache hit.
[2023-03-12 13:58:48] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/139 places, 46/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 51/139 places, 46/120 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s24 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 5084 reset in 187 ms.
Stack based approach found an accepted trace after 95 steps with 4 reset with depth 36 and stack size 36 in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-04 finished in 422 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(G(p0))&&(p1||X(p2)))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 139 /139 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 139 cols
[2023-03-12 13:58:48] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 13:58:48] [INFO ] Implicit Places using invariants in 102 ms returned [25, 32, 53, 85, 136, 138]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 104 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/139 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 130 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 130 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 129 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 129 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 128 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 128 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 127 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 127 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 126 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 126 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 125 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 125 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 124 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 124 transition count 111
Applied a total of 18 rules in 9 ms. Remains 124 /133 variables (removed 9) and now considering 111/120 (removed 9) transitions.
// Phase 1: matrix 111 rows 124 cols
[2023-03-12 13:58:48] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-12 13:58:48] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-12 13:58:49] [INFO ] Invariant cache hit.
[2023-03-12 13:58:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:58:49] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/139 places, 111/120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 391 ms. Remains : 124/139 places, 111/120 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s59 1), p0:(AND (EQ s48 1) (EQ s118 1)), p2:(AND (EQ s39 1) (EQ s102 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-05 finished in 583 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(((p1||F(p2))&&p0))&&F(p3)))'
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 139 /139 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 139 cols
[2023-03-12 13:58:49] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 13:58:49] [INFO ] Implicit Places using invariants in 189 ms returned [32, 41, 50, 53, 85, 136, 138]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 196 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/139 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 130 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 130 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 129 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 129 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 128 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 128 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 127 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 127 transition count 115
Applied a total of 10 rules in 5 ms. Remains 127 /132 variables (removed 5) and now considering 115/120 (removed 5) transitions.
// Phase 1: matrix 115 rows 127 cols
[2023-03-12 13:58:49] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-12 13:58:49] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-12 13:58:49] [INFO ] Invariant cache hit.
[2023-03-12 13:58:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 13:58:49] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 127/139 places, 115/120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 437 ms. Remains : 127/139 places, 115/120 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p3) (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), true, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s63 1), p0:(AND (EQ s25 1) (EQ s54 1) (EQ s36 1)), p1:(AND (EQ s25 1) (EQ s54 1)), p2:(AND (OR (EQ s6 0) (EQ s103 0)) (EQ s36 0))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-06 finished in 725 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((p1 U (G(p1)||(p1&&G(p2))))))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 139 transition count 92
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 111 transition count 92
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 56 place count 111 transition count 78
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 84 place count 97 transition count 78
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 106 place count 86 transition count 67
Applied a total of 106 rules in 6 ms. Remains 86 /139 variables (removed 53) and now considering 67/120 (removed 53) transitions.
// Phase 1: matrix 67 rows 86 cols
[2023-03-12 13:58:50] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 13:58:50] [INFO ] Implicit Places using invariants in 132 ms returned [17, 23, 29, 30, 31, 32, 33, 34, 35, 36, 37, 49, 83, 85]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 134 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/139 places, 67/120 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 72 transition count 51
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 56 transition count 51
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 54 transition count 49
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 54 transition count 49
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 40 place count 52 transition count 47
Applied a total of 40 rules in 14 ms. Remains 52 /72 variables (removed 20) and now considering 47/67 (removed 20) transitions.
// Phase 1: matrix 47 rows 52 cols
[2023-03-12 13:58:50] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 13:58:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-12 13:58:50] [INFO ] Invariant cache hit.
[2023-03-12 13:58:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 13:58:50] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/139 places, 47/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 377 ms. Remains : 52/139 places, 47/120 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s31 0)), p2:(AND (EQ s19 1) (EQ s47 1)), p1:(NEQ s26 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 4876 reset in 181 ms.
Stack based approach found an accepted trace after 1270 steps with 64 reset with depth 36 and stack size 36 in 3 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-08 finished in 768 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(F((G(p0)||(p1&&F(p2)))))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 139 cols
[2023-03-12 13:58:50] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 13:58:50] [INFO ] Implicit Places using invariants in 94 ms returned [25, 32, 41, 50, 53, 85, 136, 138]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 95 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/139 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 122 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 122 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 121 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 121 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 120 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 120 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 119 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 119 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 118 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 118 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 117 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 117 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 116 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 116 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 115 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 115 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 114 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 114 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 113 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 111 transition count 100
Applied a total of 40 rules in 41 ms. Remains 111 /131 variables (removed 20) and now considering 100/120 (removed 20) transitions.
// Phase 1: matrix 100 rows 111 cols
[2023-03-12 13:58:50] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-12 13:58:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-12 13:58:51] [INFO ] Invariant cache hit.
[2023-03-12 13:58:51] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/139 places, 100/120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 111/139 places, 100/120 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s29 1), p1:(EQ s20 0), p2:(EQ s29 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 247 ms.
Product exploration explored 100000 steps with 33333 reset in 183 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 p0 p1 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 p2)
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-06a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-06a-LTLFireability-09 finished in 1210 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((G(!p1)||(!p1&&F(!p2)))))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 139 cols
[2023-03-12 13:58:52] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 13:58:52] [INFO ] Implicit Places using invariants in 135 ms returned [25, 32, 41, 50, 53, 85, 138]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 150 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/139 places, 120/120 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 131 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 131 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 130 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 130 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 129 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 129 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 128 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 128 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 127 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 127 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 126 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 126 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 125 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 125 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 124 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 124 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 123 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 123 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 122 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 122 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 121 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 121 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 120 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 120 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 119 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 119 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 118 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 118 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 117 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 117 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 116 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 116 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 115 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 115 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 114 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 114 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 113 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 113 transition count 101
Applied a total of 38 rules in 26 ms. Remains 113 /132 variables (removed 19) and now considering 101/120 (removed 19) transitions.
// Phase 1: matrix 101 rows 113 cols
[2023-03-12 13:58:52] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-12 13:58:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 13:58:52] [INFO ] Invariant cache hit.
[2023-03-12 13:58:52] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 113/139 places, 101/120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 327 ms. Remains : 113/139 places, 101/120 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, p2, (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p2 p1)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (EQ s111 1) (EQ s112 1)), p0:(OR (EQ s41 0) (EQ s96 0)), p1:(AND (EQ s41 1) (EQ s96 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 20091 reset in 268 ms.
Product exploration explored 100000 steps with 19913 reset in 190 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 p2) p0 (NOT p1)), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 4 factoid took 429 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[p2, (AND p2 p1), (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 263 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:58:53] [INFO ] Invariant cache hit.
[2023-03-12 13:58:53] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-12 13:58:53] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p0), true, (X (X (NOT p1))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F p2), (F (AND p2 (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p2 p1)))
Knowledge based reduction with 5 factoid took 282 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-06a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-06a-LTLFireability-10 finished in 2073 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 X(X(p1))) U X((p2||G(!p2))))))'
Support contains 7 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 139 cols
[2023-03-12 13:58:54] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 13:58:54] [INFO ] Implicit Places using invariants in 160 ms returned [25, 41, 50, 53, 85, 136, 138]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 161 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/139 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 130 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 130 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 129 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 129 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 128 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 128 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 127 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 127 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 126 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 126 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 125 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 125 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 124 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 124 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 123 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 123 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 122 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 122 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 121 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 121 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 120 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 120 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 119 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 119 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 118 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 118 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 117 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 117 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 116 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 116 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 115 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 115 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 114 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 114 transition count 102
Applied a total of 36 rules in 24 ms. Remains 114 /132 variables (removed 18) and now considering 102/120 (removed 18) transitions.
// Phase 1: matrix 102 rows 114 cols
[2023-03-12 13:58:54] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-12 13:58:54] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-12 13:58:54] [INFO ] Invariant cache hit.
[2023-03-12 13:58:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 13:58:54] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 114/139 places, 102/120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 439 ms. Remains : 114/139 places, 102/120 transitions.
Stuttering acceptance computed with spot in 599 ms :[true, (NOT p1), false, false, false, false, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (NOT p1), p2]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 12}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 12}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=9 dest: 10}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=9 dest: 11}], [{ cond=(NOT p1), acceptance={} source=10 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=11 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 11}], [{ cond=p2, acceptance={} source=12 dest: 0}, { cond=(NOT p2), acceptance={} source=12 dest: 12}]], initial=2, aps=[p1:(OR (AND (EQ s6 1) (EQ s90 1)) (AND (EQ s22 1) (EQ s86 1))), p0:(AND (EQ s31 1) (EQ s73 1)), p2:(NEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 234 ms.
Product exploration explored 100000 steps with 33333 reset in 235 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) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 (NOT p2)))))
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 13 states, 29 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-06a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-06a-LTLFireability-11 finished in 1807 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)))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 139 transition count 92
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 111 transition count 92
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 56 place count 111 transition count 78
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 84 place count 97 transition count 78
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 110 place count 84 transition count 65
Applied a total of 110 rules in 40 ms. Remains 84 /139 variables (removed 55) and now considering 65/120 (removed 55) transitions.
// Phase 1: matrix 65 rows 84 cols
[2023-03-12 13:58:55] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-12 13:58:56] [INFO ] Implicit Places using invariants in 115 ms returned [17, 22, 27, 28, 29, 30, 31, 32, 33, 34, 35, 81, 83]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 117 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/139 places, 65/120 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 71 transition count 56
Reduce places removed 9 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 24 place count 62 transition count 50
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 56 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 56 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 55 transition count 49
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 54 transition count 48
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 54 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 53 transition count 47
Applied a total of 36 rules in 3 ms. Remains 53 /71 variables (removed 18) and now considering 47/65 (removed 18) transitions.
// Phase 1: matrix 47 rows 53 cols
[2023-03-12 13:58:56] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-12 13:58:56] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-12 13:58:56] [INFO ] Invariant cache hit.
[2023-03-12 13:58:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 13:58:56] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/139 places, 47/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 309 ms. Remains : 53/139 places, 47/120 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s32 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 86 steps with 12 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-12 finished in 396 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||G(p1)))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 139 transition count 95
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 114 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 113 transition count 94
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 52 place count 113 transition count 80
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 80 place count 99 transition count 80
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 106 place count 86 transition count 67
Applied a total of 106 rules in 9 ms. Remains 86 /139 variables (removed 53) and now considering 67/120 (removed 53) transitions.
// Phase 1: matrix 67 rows 86 cols
[2023-03-12 13:58:56] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-12 13:58:56] [INFO ] Implicit Places using invariants in 89 ms returned [22, 27, 28, 29, 30, 31, 32, 33, 34, 49, 83, 85]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 91 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/139 places, 67/120 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 74 transition count 60
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 67 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 66 transition count 59
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 66 transition count 56
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 22 place count 63 transition count 56
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 61 transition count 54
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 61 transition count 54
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 60 transition count 53
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 60 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 59 transition count 52
Applied a total of 30 rules in 5 ms. Remains 59 /74 variables (removed 15) and now considering 52/67 (removed 15) transitions.
// Phase 1: matrix 52 rows 59 cols
[2023-03-12 13:58:56] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-12 13:58:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-12 13:58:56] [INFO ] Invariant cache hit.
[2023-03-12 13:58:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 13:58:56] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/139 places, 52/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 59/139 places, 52/120 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s17 1) (EQ s30 1) (OR (EQ s26 0) (EQ s57 0))), p0:(NEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-13 finished in 394 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)))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 139 transition count 92
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 111 transition count 92
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 56 place count 111 transition count 78
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 84 place count 97 transition count 78
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 108 place count 85 transition count 66
Applied a total of 108 rules in 10 ms. Remains 85 /139 variables (removed 54) and now considering 66/120 (removed 54) transitions.
// Phase 1: matrix 66 rows 85 cols
[2023-03-12 13:58:56] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 13:58:56] [INFO ] Implicit Places using invariants in 225 ms returned [17, 23, 28, 29, 30, 31, 32, 33, 34, 35, 36, 48, 82, 84]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 239 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/139 places, 66/120 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 71 transition count 50
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 55 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 53 transition count 48
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 53 transition count 48
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 40 place count 51 transition count 46
Applied a total of 40 rules in 3 ms. Remains 51 /71 variables (removed 20) and now considering 46/66 (removed 20) transitions.
// Phase 1: matrix 46 rows 51 cols
[2023-03-12 13:58:56] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 13:58:57] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-12 13:58:57] [INFO ] Invariant cache hit.
[2023-03-12 13:58:57] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 13:58:57] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/139 places, 46/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 400 ms. Remains : 51/139 places, 46/120 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9441 reset in 140 ms.
Stack based approach found an accepted trace after 5673 steps with 537 reset with depth 8 and stack size 8 in 17 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-14 finished in 697 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(F(p0)))))'
Found a Shortening insensitive property : AutoFlight-PT-06a-LTLFireability-01
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 139/139 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 133 transition count 82
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 80 place count 96 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 95 transition count 81
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 81 place count 95 transition count 68
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 113 place count 76 transition count 68
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 113 place count 76 transition count 62
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 125 place count 70 transition count 62
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 151 place count 57 transition count 49
Applied a total of 151 rules in 5 ms. Remains 57 /139 variables (removed 82) and now considering 49/120 (removed 71) transitions.
// Phase 1: matrix 49 rows 57 cols
[2023-03-12 13:58:57] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-12 13:58:57] [INFO ] Implicit Places using invariants in 107 ms returned [33, 54, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 109 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 54/139 places, 49/120 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 53 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 52 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 52 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 51 transition count 46
Applied a total of 6 rules in 3 ms. Remains 51 /54 variables (removed 3) and now considering 46/49 (removed 3) transitions.
// Phase 1: matrix 46 rows 51 cols
[2023-03-12 13:58:57] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 13:58:57] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-12 13:58:57] [INFO ] Invariant cache hit.
[2023-03-12 13:58:57] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 51/139 places, 46/120 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 250 ms. Remains : 51/139 places, 46/120 transitions.
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(NEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 169 ms.
Product exploration explored 100000 steps with 25000 reset in 208 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 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 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 40 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 169 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 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-12 13:58:59] [INFO ] Invariant cache hit.
[2023-03-12 13:58:59] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-12 13:58:59] [INFO ] Invariant cache hit.
[2023-03-12 13:58:59] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-12 13:58:59] [INFO ] Invariant cache hit.
[2023-03-12 13:58:59] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 51/51 places, 46/46 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 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 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 84 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=84 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 158 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 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Product exploration explored 100000 steps with 25000 reset in 182 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-12 13:59:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:59:01] [INFO ] Invariant cache hit.
[2023-03-12 13:59:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 51/51 places, 46/46 transitions.
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 46/46 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-12 13:59:01] [INFO ] Invariant cache hit.
[2023-03-12 13:59:01] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-12 13:59:01] [INFO ] Invariant cache hit.
[2023-03-12 13:59:01] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-12 13:59:01] [INFO ] Invariant cache hit.
[2023-03-12 13:59:01] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 51/51 places, 46/46 transitions.
Treatment of property AutoFlight-PT-06a-LTLFireability-01 finished in 3957 ms.
[2023-03-12 13:59:01] [INFO ] Flatten gal took : 20 ms
[2023-03-12 13:59:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 13:59:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 139 places, 120 transitions and 362 arcs took 1 ms.
Total runtime 26800 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1463/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-06a-LTLFireability-01

BK_STOP 1678629542011

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

+ 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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutoFlight-PT-06a-LTLFireability-01
ltl formula formula --ltl=/tmp/1463/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 139 places, 120 transitions and 362 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1463/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1463/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1463/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1463/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55767199b3f4]
1: pnml2lts-mc(+0xa2496) [0x55767199b496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fbd2ba84140]
3: pnml2lts-mc(+0x405be5) [0x557671cfebe5]
4: pnml2lts-mc(+0x16b3f9) [0x557671a643f9]
5: pnml2lts-mc(+0x164ac4) [0x557671a5dac4]
6: pnml2lts-mc(+0x272e0a) [0x557671b6be0a]
7: pnml2lts-mc(+0xb61f0) [0x5576719af1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fbd2b8d74d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fbd2b8d767a]
10: pnml2lts-mc(+0xa1581) [0x55767199a581]
11: pnml2lts-mc(+0xa1910) [0x55767199a910]
12: pnml2lts-mc(+0xa32a2) [0x55767199c2a2]
13: pnml2lts-mc(+0xa50f4) [0x55767199e0f4]
14: pnml2lts-mc(+0xa516b) [0x55767199e16b]
15: pnml2lts-mc(+0x3f34b3) [0x557671cec4b3]
16: pnml2lts-mc(+0x7c63d) [0x55767197563d]
17: pnml2lts-mc(+0x67d86) [0x557671960d86]
18: pnml2lts-mc(+0x60a8a) [0x557671959a8a]
19: pnml2lts-mc(+0x5eb15) [0x557671957b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fbd2b8bfd0a]
21: pnml2lts-mc(+0x6075e) [0x55767195975e]

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-06a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutoFlight-PT-06a, 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 r009-oct2-167813597900452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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