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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:03 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.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 18:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 85K 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-12a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-12a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678349225343

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:07:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:07:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:07:07] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-09 08:07:07] [INFO ] Transformed 307 places.
[2023-03-09 08:07:07] [INFO ] Transformed 305 transitions.
[2023-03-09 08:07:07] [INFO ] Found NUPN structural information;
[2023-03-09 08:07:07] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
FORMULA AutoFlight-PT-12a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 245/245 transitions.
Applied a total of 0 rules in 38 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2023-03-09 08:07:07] [INFO ] Computed 76 place invariants in 11 ms
[2023-03-09 08:07:08] [INFO ] Implicit Places using invariants in 884 ms returned [28, 35, 56, 70, 77, 84, 87, 90, 93, 96, 102, 105, 108, 111, 114, 120, 182, 232, 238, 244, 250, 256, 262, 268, 274, 280, 286, 292, 298, 304, 306]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 918 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 276/307 places, 245/245 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 263 transition count 232
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 263 transition count 232
Applied a total of 26 rules in 45 ms. Remains 263 /276 variables (removed 13) and now considering 232/245 (removed 13) transitions.
// Phase 1: matrix 232 rows 263 cols
[2023-03-09 08:07:08] [INFO ] Computed 45 place invariants in 5 ms
[2023-03-09 08:07:09] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-09 08:07:09] [INFO ] Invariant cache hit.
[2023-03-09 08:07:09] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 08:07:09] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/307 places, 232/245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1403 ms. Remains : 263/307 places, 232/245 transitions.
Support contains 41 out of 263 places after structural reductions.
[2023-03-09 08:07:09] [INFO ] Flatten gal took : 44 ms
[2023-03-09 08:07:09] [INFO ] Flatten gal took : 18 ms
[2023-03-09 08:07:09] [INFO ] Input system was already deterministic with 232 transitions.
Support contains 40 out of 263 places (down from 41) after GAL structural reductions.
Finished random walk after 8623 steps, including 166 resets, run visited all 26 properties in 182 ms. (steps per millisecond=47 )
FORMULA AutoFlight-PT-12a-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9 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' '!(F((p0||X((!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 208
Applied a total of 48 rules in 223 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-09 08:07:10] [INFO ] Computed 45 place invariants in 5 ms
[2023-03-09 08:07:10] [INFO ] Implicit Places using invariants in 146 ms returned [7, 14, 21, 40, 47, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 147 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/263 places, 208/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 231 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 231 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 230 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 230 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 229 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 229 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 228 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 228 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 227 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 227 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 226 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 226 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 225 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 225 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 224 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 224 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 223 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 223 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 222 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 222 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 221 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 221 transition count 196
Applied a total of 24 rules in 30 ms. Remains 221 /233 variables (removed 12) and now considering 196/208 (removed 12) transitions.
// Phase 1: matrix 196 rows 221 cols
[2023-03-09 08:07:10] [INFO ] Computed 39 place invariants in 2 ms
[2023-03-09 08:07:10] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 08:07:10] [INFO ] Invariant cache hit.
[2023-03-09 08:07:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:07:10] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 221/263 places, 196/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 652 ms. Remains : 221/263 places, 196/232 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s63 1), p2:(AND (NOT (AND (EQ s83 1) (EQ s191 1))) (NOT (AND (EQ s96 1) (EQ s215 1)))), p1:(AND (EQ s96 1) (EQ s215 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 588 ms.
Product exploration explored 100000 steps with 50000 reset in 512 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2 (NOT p1))
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLFireability-01 finished in 2416 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(p0)&&G(F(p1))))))'
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Applied a total of 0 rules in 6 ms. Remains 263 /263 variables (removed 0) and now considering 232/232 (removed 0) transitions.
// Phase 1: matrix 232 rows 263 cols
[2023-03-09 08:07:12] [INFO ] Computed 45 place invariants in 4 ms
[2023-03-09 08:07:12] [INFO ] Implicit Places using invariants in 322 ms returned [14, 40, 47, 60, 89, 102]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 324 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/263 places, 232/232 transitions.
Applied a total of 0 rules in 4 ms. Remains 257 /257 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 334 ms. Remains : 257/263 places, 232/232 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s160 1)), p1:(OR (AND (EQ s7 1) (EQ s160 1)) (AND (EQ s20 1) (EQ s102 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-02 finished in 661 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(G((p0||F(p1)))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 208
Applied a total of 48 rules in 143 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-09 08:07:13] [INFO ] Computed 45 place invariants in 4 ms
[2023-03-09 08:07:13] [INFO ] Implicit Places using invariants in 211 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 212 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 231/263 places, 208/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 224 transition count 201
Applied a total of 14 rules in 24 ms. Remains 224 /231 variables (removed 7) and now considering 201/208 (removed 7) transitions.
// Phase 1: matrix 201 rows 224 cols
[2023-03-09 08:07:13] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-09 08:07:13] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-09 08:07:13] [INFO ] Invariant cache hit.
[2023-03-09 08:07:13] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 224/263 places, 201/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 665 ms. Remains : 224/263 places, 201/232 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s129 0), p1:(EQ s47 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1854 reset in 291 ms.
Product exploration explored 100000 steps with 1833 reset in 362 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), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 289 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 187 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:07:15] [INFO ] Invariant cache hit.
[2023-03-09 08:07:15] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:07:15] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-09 08:07:15] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:07:15] [INFO ] Deduced a trap composed of 112 places in 77 ms of which 3 ms to minimize.
[2023-03-09 08:07:15] [INFO ] Deduced a trap composed of 104 places in 60 ms of which 1 ms to minimize.
[2023-03-09 08:07:15] [INFO ] Deduced a trap composed of 103 places in 58 ms of which 1 ms to minimize.
[2023-03-09 08:07:15] [INFO ] Deduced a trap composed of 108 places in 57 ms of which 1 ms to minimize.
[2023-03-09 08:07:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 316 ms
[2023-03-09 08:07:15] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 08:07:15] [INFO ] After 476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 201/201 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 224 transition count 141
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 164 transition count 141
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 120 place count 164 transition count 128
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 146 place count 151 transition count 128
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 198 place count 125 transition count 102
Free-agglomeration rule applied 38 times.
Iterating global reduction 2 with 38 rules applied. Total rules applied 236 place count 125 transition count 64
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 274 place count 87 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 86 transition count 63
Reduce places removed 35 places and 0 transitions.
Graph (trivial) has 58 edges and 51 vertex of which 23 / 51 are part of one of the 1 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 3 with 56 rules applied. Total rules applied 331 place count 29 transition count 43
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 384 place count 9 transition count 10
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 385 place count 8 transition count 9
Iterating global reduction 5 with 1 rules applied. Total rules applied 386 place count 8 transition count 9
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 5 with 2 rules applied. Total rules applied 388 place count 7 transition count 8
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 391 place count 7 transition count 5
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 395 place count 4 transition count 4
Applied a total of 395 rules in 26 ms. Remains 4 /224 variables (removed 220) and now considering 4/201 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 4/224 places, 4/201 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 340 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 201/201 transitions.
Applied a total of 0 rules in 6 ms. Remains 224 /224 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-09 08:07:16] [INFO ] Invariant cache hit.
[2023-03-09 08:07:17] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-09 08:07:17] [INFO ] Invariant cache hit.
[2023-03-09 08:07:17] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2023-03-09 08:07:17] [INFO ] Invariant cache hit.
[2023-03-09 08:07:17] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 224/224 places, 201/201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 298 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 189 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:07:18] [INFO ] Invariant cache hit.
[2023-03-09 08:07:18] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:07:18] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2023-03-09 08:07:18] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:07:18] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 1 ms to minimize.
[2023-03-09 08:07:18] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 0 ms to minimize.
[2023-03-09 08:07:18] [INFO ] Deduced a trap composed of 103 places in 97 ms of which 0 ms to minimize.
[2023-03-09 08:07:19] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 0 ms to minimize.
[2023-03-09 08:07:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 530 ms
[2023-03-09 08:07:19] [INFO ] After 670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 08:07:19] [INFO ] After 801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 201/201 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 224 transition count 141
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 164 transition count 141
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 120 place count 164 transition count 128
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 146 place count 151 transition count 128
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 198 place count 125 transition count 102
Free-agglomeration rule applied 38 times.
Iterating global reduction 2 with 38 rules applied. Total rules applied 236 place count 125 transition count 64
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 274 place count 87 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 86 transition count 63
Reduce places removed 35 places and 0 transitions.
Graph (trivial) has 58 edges and 51 vertex of which 23 / 51 are part of one of the 1 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 3 with 56 rules applied. Total rules applied 331 place count 29 transition count 43
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 384 place count 9 transition count 10
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 385 place count 8 transition count 9
Iterating global reduction 5 with 1 rules applied. Total rules applied 386 place count 8 transition count 9
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 5 with 2 rules applied. Total rules applied 388 place count 7 transition count 8
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 391 place count 7 transition count 5
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 395 place count 4 transition count 4
Applied a total of 395 rules in 35 ms. Remains 4 /224 variables (removed 220) and now considering 4/201 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 4/224 places, 4/201 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 438 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1837 reset in 265 ms.
Product exploration explored 100000 steps with 1856 reset in 270 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 201/201 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 224 transition count 201
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 60 place count 224 transition count 201
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 224 transition count 201
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 119 place count 178 transition count 155
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 165 place count 178 transition count 155
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 191 place count 178 transition count 155
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 195 place count 174 transition count 151
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 199 place count 174 transition count 151
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 199 rules in 76 ms. Remains 174 /224 variables (removed 50) and now considering 151/201 (removed 50) transitions.
[2023-03-09 08:07:21] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 151 rows 174 cols
[2023-03-09 08:07:21] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-09 08:07:21] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/224 places, 151/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 174/224 places, 151/201 transitions.
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 201/201 transitions.
Applied a total of 0 rules in 7 ms. Remains 224 /224 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 224 cols
[2023-03-09 08:07:21] [INFO ] Computed 37 place invariants in 3 ms
[2023-03-09 08:07:21] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-09 08:07:21] [INFO ] Invariant cache hit.
[2023-03-09 08:07:21] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-09 08:07:21] [INFO ] Invariant cache hit.
[2023-03-09 08:07:22] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 451 ms. Remains : 224/224 places, 201/201 transitions.
Treatment of property AutoFlight-PT-12a-LTLFireability-04 finished in 8874 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(G(p0))||F(p1)) U X(p2)))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Applied a total of 10 rules in 35 ms. Remains 258 /263 variables (removed 5) and now considering 227/232 (removed 5) transitions.
// Phase 1: matrix 227 rows 258 cols
[2023-03-09 08:07:22] [INFO ] Computed 45 place invariants in 3 ms
[2023-03-09 08:07:22] [INFO ] Implicit Places using invariants in 157 ms returned [7, 14, 21, 47, 60, 89, 102]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 160 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 251/263 places, 227/232 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 203 ms. Remains : 251/263 places, 227/232 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s169 1), p2:(AND (EQ s37 1) (EQ s159 1)), p0:(AND (EQ s82 1) (EQ s220 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 136 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-05 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0 U (p1||G(p0))))))))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 208
Applied a total of 48 rules in 131 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-09 08:07:22] [INFO ] Computed 45 place invariants in 3 ms
[2023-03-09 08:07:22] [INFO ] Implicit Places using invariants in 179 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 180 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 231/263 places, 208/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 219 transition count 196
Applied a total of 24 rules in 30 ms. Remains 219 /231 variables (removed 12) and now considering 196/208 (removed 12) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-09 08:07:23] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-09 08:07:23] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 08:07:23] [INFO ] Invariant cache hit.
[2023-03-09 08:07:23] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 601 ms. Remains : 219/263 places, 196/232 transitions.
Stuttering acceptance computed with spot in 321 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) 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=[p1:(AND (NOT (AND (EQ s58 1) (EQ s167 1))) (NEQ s78 1)), p0:(NEQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 4 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-08 finished in 947 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(p0)&&X(X(F((p1&&F(p2)))))))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 210
Applied a total of 44 rules in 79 ms. Remains 241 /263 variables (removed 22) and now considering 210/232 (removed 22) transitions.
// Phase 1: matrix 210 rows 241 cols
[2023-03-09 08:07:23] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-09 08:07:23] [INFO ] Implicit Places using invariants in 168 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 169 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/263 places, 210/232 transitions.
Applied a total of 0 rules in 3 ms. Remains 233 /233 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 251 ms. Remains : 233/263 places, 210/232 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s197 1)), p1:(OR (EQ s24 0) (EQ s197 0)), p2:(EQ s120 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-09 finished in 560 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(G((p0||X(X(!p0)))))))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 208
Applied a total of 48 rules in 114 ms. Remains 239 /263 variables (removed 24) and now considering 208/232 (removed 24) transitions.
// Phase 1: matrix 208 rows 239 cols
[2023-03-09 08:07:24] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-09 08:07:24] [INFO ] Implicit Places using invariants in 363 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 365 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 231/263 places, 208/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 219 transition count 196
Applied a total of 24 rules in 51 ms. Remains 219 /231 variables (removed 12) and now considering 196/208 (removed 12) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-09 08:07:24] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-09 08:07:24] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-09 08:07:24] [INFO ] Invariant cache hit.
[2023-03-09 08:07:25] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/232 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 868 ms. Remains : 219/263 places, 196/232 transitions.
Stuttering acceptance computed with spot in 297 ms :[false, false, false, p0, p0, true]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16691 reset in 386 ms.
Product exploration explored 100000 steps with 16686 reset in 394 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 : [(NOT p0), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[false, false, false, p0, p0, true]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1699802 steps, run timeout after 3001 ms. (steps per millisecond=566 ) properties seen :{}
Probabilistic random walk after 1699802 steps, saw 194699 distinct states, run finished after 3007 ms. (steps per millisecond=565 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:07:29] [INFO ] Invariant cache hit.
[2023-03-09 08:07:29] [INFO ] [Real]Absence check using 37 positive place invariants in 12 ms returned sat
[2023-03-09 08:07:30] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:07:30] [INFO ] After 152ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 08:07:30] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(NOT p0), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[false, false, false, p0, p0, true]
Stuttering acceptance computed with spot in 392 ms :[false, false, false, p0, p0, true]
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-09 08:07:31] [INFO ] Invariant cache hit.
[2023-03-09 08:07:31] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-09 08:07:31] [INFO ] Invariant cache hit.
[2023-03-09 08:07:31] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-09 08:07:31] [INFO ] Invariant cache hit.
[2023-03-09 08:07:31] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 677 ms. Remains : 219/219 places, 196/196 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 : [(NOT p0), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[false, false, false, p0, p0, true]
Finished random walk after 3256 steps, including 64 resets, run visited all 1 properties in 22 ms. (steps per millisecond=148 )
Knowledge obtained : [(NOT p0), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 226 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[false, false, false, p0, p0, true]
Stuttering acceptance computed with spot in 335 ms :[false, false, false, p0, p0, true]
Stuttering acceptance computed with spot in 350 ms :[false, false, false, p0, p0, true]
Product exploration explored 100000 steps with 16691 reset in 369 ms.
Product exploration explored 100000 steps with 16675 reset in 321 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 323 ms :[false, false, false, p0, p0, true]
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 196/196 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 219 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 58 place count 219 transition count 196
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 219 transition count 196
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 114 place count 175 transition count 152
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 158 place count 175 transition count 152
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 184 place count 175 transition count 152
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 188 place count 171 transition count 148
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 192 place count 171 transition count 148
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 192 rules in 36 ms. Remains 171 /219 variables (removed 48) and now considering 148/196 (removed 48) transitions.
[2023-03-09 08:07:34] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 148 rows 171 cols
[2023-03-09 08:07:34] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-09 08:07:34] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/219 places, 148/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 171/219 places, 148/196 transitions.
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-09 08:07:34] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-09 08:07:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-09 08:07:34] [INFO ] Invariant cache hit.
[2023-03-09 08:07:35] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-09 08:07:35] [INFO ] Invariant cache hit.
[2023-03-09 08:07:35] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 219/219 places, 196/196 transitions.
Treatment of property AutoFlight-PT-12a-LTLFireability-10 finished in 11055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1))) U p2)))'
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 212
Applied a total of 40 rules in 69 ms. Remains 243 /263 variables (removed 20) and now considering 212/232 (removed 20) transitions.
// Phase 1: matrix 212 rows 243 cols
[2023-03-09 08:07:35] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-09 08:07:35] [INFO ] Implicit Places using invariants in 113 ms returned [7, 14, 21, 40, 47, 60, 89, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 117 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/263 places, 212/232 transitions.
Applied a total of 0 rules in 2 ms. Remains 235 /235 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 235/263 places, 212/232 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s118 1), p0:(EQ s33 1), p1:(OR (EQ s20 1) (EQ s21 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 371 ms.
Product exploration explored 100000 steps with 50000 reset in 382 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 p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 4 factoid took 394 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLFireability-11 finished in 1489 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(p0))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 263 transition count 174
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 205 transition count 174
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 116 place count 205 transition count 150
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 164 place count 181 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 180 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 180 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 179 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 179 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 178 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 178 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 177 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 177 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 176 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 176 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 175 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 175 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 174 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 174 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 173 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 173 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 172 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 172 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 171 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 171 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 170 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 170 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 169 transition count 138
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 169 transition count 138
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 236 place count 145 transition count 114
Applied a total of 236 rules in 58 ms. Remains 145 /263 variables (removed 118) and now considering 114/232 (removed 118) transitions.
// Phase 1: matrix 114 rows 145 cols
[2023-03-09 08:07:36] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-09 08:07:36] [INFO ] Implicit Places using invariants in 150 ms returned [5, 10, 15, 28, 33, 42, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 151 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/263 places, 114/232 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 125 transition count 89
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 100 transition count 89
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 52 place count 99 transition count 88
Applied a total of 52 rules in 4 ms. Remains 99 /125 variables (removed 26) and now considering 88/114 (removed 26) transitions.
// Phase 1: matrix 88 rows 99 cols
[2023-03-09 08:07:36] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-09 08:07:37] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-09 08:07:37] [INFO ] Invariant cache hit.
[2023-03-09 08:07:37] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-09 08:07:37] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/263 places, 88/232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 447 ms. Remains : 99/263 places, 88/232 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 253 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLFireability-12 finished in 1215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 263 transition count 176
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 207 transition count 176
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 112 place count 207 transition count 153
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 158 place count 184 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 183 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 183 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 182 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 182 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 181 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 181 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 180 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 180 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 179 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 179 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 178 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 178 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 177 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 177 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 176 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 176 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 175 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 175 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 174 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 174 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 173 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 173 transition count 142
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 230 place count 148 transition count 117
Applied a total of 230 rules in 49 ms. Remains 148 /263 variables (removed 115) and now considering 117/232 (removed 115) transitions.
// Phase 1: matrix 117 rows 148 cols
[2023-03-09 08:07:37] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-09 08:07:38] [INFO ] Implicit Places using invariants in 158 ms returned [5, 10, 15, 28, 33, 55, 56, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 163 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/263 places, 117/232 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 130 transition count 96
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 109 transition count 96
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 42 place count 109 transition count 95
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 44 place count 108 transition count 95
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 46 place count 107 transition count 94
Applied a total of 46 rules in 8 ms. Remains 107 /130 variables (removed 23) and now considering 94/117 (removed 23) transitions.
// Phase 1: matrix 94 rows 107 cols
[2023-03-09 08:07:38] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-09 08:07:38] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-09 08:07:38] [INFO ] Invariant cache hit.
[2023-03-09 08:07:38] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-09 08:07:38] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/263 places, 94/232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 493 ms. Remains : 107/263 places, 94/232 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s53 1)), p1:(AND (EQ s50 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-14 finished in 660 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||X(X(p2))))))))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 231
Applied a total of 2 rules in 5 ms. Remains 262 /263 variables (removed 1) and now considering 231/232 (removed 1) transitions.
// Phase 1: matrix 231 rows 262 cols
[2023-03-09 08:07:38] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-09 08:07:38] [INFO ] Implicit Places using invariants in 162 ms returned [7, 21, 40, 60, 89, 102]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 163 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 256/263 places, 231/232 transitions.
Applied a total of 0 rules in 3 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 256/263 places, 231/232 transitions.
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(EQ s43 1), p0:(AND (EQ s44 1) (EQ s189 1)), p2:(OR (AND (EQ s44 1) (EQ s189 1)) (EQ s13 0) (EQ s160 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7138 reset in 356 ms.
Product exploration explored 100000 steps with 7107 reset in 340 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 312 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 266 steps, including 4 resets, run visited all 3 properties in 9 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p0) (NOT p2))), (F p0)]
Knowledge based reduction with 3 factoid took 289 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 231/231 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 256 cols
[2023-03-09 08:07:41] [INFO ] Computed 39 place invariants in 2 ms
[2023-03-09 08:07:41] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-09 08:07:41] [INFO ] Invariant cache hit.
[2023-03-09 08:07:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:07:41] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-09 08:07:41] [INFO ] Invariant cache hit.
[2023-03-09 08:07:41] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 700 ms. Remains : 256/256 places, 231/231 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 281 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 646 steps, including 13 resets, run visited all 3 properties in 17 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p0) (NOT p2))), (F p0)]
Knowledge based reduction with 3 factoid took 318 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7244 reset in 308 ms.
Product exploration explored 100000 steps with 7132 reset in 304 ms.
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 231/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2023-03-09 08:07:44] [INFO ] Invariant cache hit.
[2023-03-09 08:07:44] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-09 08:07:44] [INFO ] Invariant cache hit.
[2023-03-09 08:07:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:07:45] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-09 08:07:45] [INFO ] Invariant cache hit.
[2023-03-09 08:07:45] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 623 ms. Remains : 256/256 places, 231/231 transitions.
Treatment of property AutoFlight-PT-12a-LTLFireability-15 finished in 6622 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(G((p0||F(p1)))))'
Found a Lengthening insensitive property : AutoFlight-PT-12a-LTLFireability-04
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 254 transition count 140
Reduce places removed 91 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 92 rules applied. Total rules applied 191 place count 163 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 192 place count 162 transition count 139
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 192 place count 162 transition count 126
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 230 place count 137 transition count 126
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 242 place count 137 transition count 114
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 254 place count 125 transition count 114
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 304 place count 100 transition count 89
Applied a total of 304 rules in 27 ms. Remains 100 /263 variables (removed 163) and now considering 89/232 (removed 143) transitions.
// Phase 1: matrix 89 rows 100 cols
[2023-03-09 08:07:45] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-09 08:07:45] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-09 08:07:45] [INFO ] Invariant cache hit.
[2023-03-09 08:07:45] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-09 08:07:45] [INFO ] Invariant cache hit.
[2023-03-09 08:07:45] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/263 places, 89/232 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 354 ms. Remains : 100/263 places, 89/232 transitions.
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s49 0), p1:(EQ s31 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3148 reset in 169 ms.
Product exploration explored 100000 steps with 3119 reset in 179 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 : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 321 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 322 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:07:46] [INFO ] Invariant cache hit.
[2023-03-09 08:07:46] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:07:46] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2023-03-09 08:07:46] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:07:46] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 08:07:46] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 89/89 transitions.
Free-agglomeration rule applied 38 times.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 100 transition count 51
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t84.t59.t217 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 44 edges and 38 vertex of which 11 / 38 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 23 rules applied. Total rules applied 61 place count 28 transition count 29
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 101 place count 8 transition count 9
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 7 transition count 8
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 7 transition count 8
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 105 place count 6 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 4 transition count 4
Applied a total of 110 rules in 12 ms. Remains 4 /100 variables (removed 96) and now considering 4/89 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 4/100 places, 4/89 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 327 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-09 08:07:47] [INFO ] Invariant cache hit.
[2023-03-09 08:07:47] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 08:07:47] [INFO ] Invariant cache hit.
[2023-03-09 08:07:47] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-09 08:07:47] [INFO ] Invariant cache hit.
[2023-03-09 08:07:48] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 100/100 places, 89/89 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 : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 260 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 315 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:07:48] [INFO ] Invariant cache hit.
[2023-03-09 08:07:48] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:07:48] [INFO ] [Nat]Absence check using 25 positive place invariants in 6 ms returned sat
[2023-03-09 08:07:48] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:07:48] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 08:07:48] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 89/89 transitions.
Free-agglomeration rule applied 38 times.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 100 transition count 51
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t84.t59.t217 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 44 edges and 38 vertex of which 11 / 38 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 23 rules applied. Total rules applied 61 place count 28 transition count 29
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 101 place count 8 transition count 9
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 7 transition count 8
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 7 transition count 8
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 105 place count 6 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 4 transition count 4
Applied a total of 110 rules in 5 ms. Remains 4 /100 variables (removed 96) and now considering 4/89 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 4/100 places, 4/89 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 254 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3137 reset in 206 ms.
Product exploration explored 100000 steps with 3147 reset in 215 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-09 08:07:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 08:07:50] [INFO ] Invariant cache hit.
[2023-03-09 08:07:50] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 100/100 places, 89/89 transitions.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-09 08:07:50] [INFO ] Invariant cache hit.
[2023-03-09 08:07:50] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 08:07:50] [INFO ] Invariant cache hit.
[2023-03-09 08:07:50] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-09 08:07:50] [INFO ] Invariant cache hit.
[2023-03-09 08:07:50] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 100/100 places, 89/89 transitions.
Treatment of property AutoFlight-PT-12a-LTLFireability-04 finished in 5751 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(G((p0||X(X(!p0)))))))'
Found a Lengthening insensitive property : AutoFlight-PT-12a-LTLFireability-10
Stuttering acceptance computed with spot in 315 ms :[false, false, false, p0, p0, true]
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 263/263 places, 232/232 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 254 transition count 137
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 196 place count 160 transition count 137
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 196 place count 160 transition count 125
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 232 place count 136 transition count 125
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 244 place count 136 transition count 113
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 256 place count 124 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 257 place count 123 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 258 place count 123 transition count 112
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 308 place count 98 transition count 87
Applied a total of 308 rules in 16 ms. Remains 98 /263 variables (removed 165) and now considering 87/232 (removed 145) transitions.
// Phase 1: matrix 87 rows 98 cols
[2023-03-09 08:07:51] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-09 08:07:51] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-09 08:07:51] [INFO ] Invariant cache hit.
[2023-03-09 08:07:51] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-09 08:07:51] [INFO ] Invariant cache hit.
[2023-03-09 08:07:51] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 98/263 places, 87/232 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 415 ms. Remains : 98/263 places, 87/232 transitions.
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 521 steps with 90 reset in 2 ms.
Treatment of property AutoFlight-PT-12a-LTLFireability-10 finished in 823 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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||X(X(p2))))))))'
[2023-03-09 08:07:51] [INFO ] Flatten gal took : 35 ms
[2023-03-09 08:07:51] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-09 08:07:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 263 places, 232 transitions and 680 arcs took 5 ms.
Total runtime 44405 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutoFlight-PT-12a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
LTLFireability

FORMULA AutoFlight-PT-12a-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678349397499

--------------------
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:
++ sed s/.jar//
++ 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
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 AutoFlight-PT-12a-LTLFireability-10
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1200 4/32 AutoFlight-PT-12a-LTLFireability-10 495989 m, 99197 m/sec, 3181405 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1200 7/32 AutoFlight-PT-12a-LTLFireability-10 961098 m, 93021 m/sec, 6268753 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
lola: FINISHED task # 4 (type EXCL) for AutoFlight-PT-12a-LTLFireability-10
lola: result : false
lola: markings : 1043559
lola: fired transitions : 6841766
lola: time used : 11.000000
lola: memory pages used : 7
lola: LAUNCH task # 7 (type EXCL) for 6 AutoFlight-PT-12a-LTLFireability-15
lola: time limit : 1794 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 4/1794 3/32 AutoFlight-PT-12a-LTLFireability-15 394641 m, 78928 m/sec, 2609900 t fired, .

Time elapsed: 15 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 9/1794 7/32 AutoFlight-PT-12a-LTLFireability-15 1080360 m, 137143 m/sec, 5509721 t fired, .

Time elapsed: 20 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 14/1794 11/32 AutoFlight-PT-12a-LTLFireability-15 1662387 m, 116405 m/sec, 8417253 t fired, .

Time elapsed: 25 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 19/1794 15/32 AutoFlight-PT-12a-LTLFireability-15 2239103 m, 115343 m/sec, 11338000 t fired, .

Time elapsed: 30 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 24/1794 18/32 AutoFlight-PT-12a-LTLFireability-15 2779605 m, 108100 m/sec, 14283507 t fired, .

Time elapsed: 35 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 29/1794 22/32 AutoFlight-PT-12a-LTLFireability-15 3329738 m, 110026 m/sec, 17227067 t fired, .

Time elapsed: 40 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 34/1794 25/32 AutoFlight-PT-12a-LTLFireability-15 3887114 m, 111475 m/sec, 20156716 t fired, .

Time elapsed: 45 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 39/1794 29/32 AutoFlight-PT-12a-LTLFireability-15 4399627 m, 102502 m/sec, 23086785 t fired, .

Time elapsed: 50 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 44/1794 32/32 AutoFlight-PT-12a-LTLFireability-15 4942326 m, 108539 m/sec, 26062757 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for AutoFlight-PT-12a-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 AutoFlight-PT-12a-LTLFireability-04
lola: time limit : 3540 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3540 4/32 AutoFlight-PT-12a-LTLFireability-04 488455 m, 97691 m/sec, 3369971 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3540 6/32 AutoFlight-PT-12a-LTLFireability-04 905540 m, 83417 m/sec, 6697213 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3540 9/32 AutoFlight-PT-12a-LTLFireability-04 1341835 m, 87259 m/sec, 9965231 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3540 12/32 AutoFlight-PT-12a-LTLFireability-04 1773525 m, 86338 m/sec, 13247912 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3540 15/32 AutoFlight-PT-12a-LTLFireability-04 2178943 m, 81083 m/sec, 16540662 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3540 17/32 AutoFlight-PT-12a-LTLFireability-04 2590398 m, 82291 m/sec, 19851693 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3540 20/32 AutoFlight-PT-12a-LTLFireability-04 2986473 m, 79215 m/sec, 23130789 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3540 22/32 AutoFlight-PT-12a-LTLFireability-04 3352339 m, 73173 m/sec, 26333254 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3540 25/32 AutoFlight-PT-12a-LTLFireability-04 3704640 m, 70460 m/sec, 29588791 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3540 27/32 AutoFlight-PT-12a-LTLFireability-04 4086209 m, 76313 m/sec, 32842682 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3540 29/32 AutoFlight-PT-12a-LTLFireability-04 4413106 m, 65379 m/sec, 36070121 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3540 31/32 AutoFlight-PT-12a-LTLFireability-04 4728226 m, 63024 m/sec, 39274628 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for AutoFlight-PT-12a-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLFireability-04: LTL unknown AGGR
AutoFlight-PT-12a-LTLFireability-10: LTL false LTL model checker
AutoFlight-PT-12a-LTLFireability-15: LTL unknown AGGR


Time elapsed: 125 secs. Pages in use: 32

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-12a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is AutoFlight-PT-12a, 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 r007-oct2-167813595600468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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