Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180100098.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r043-smll-171620180100098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 23:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 23:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 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 1716282689623

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 09:11:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 09:11:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:11:33] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-05-21 09:11:33] [INFO ] Transformed 307 places.
[2024-05-21 09:11:33] [INFO ] Transformed 305 transitions.
[2024-05-21 09:11:33] [INFO ] Found NUPN structural information;
[2024-05-21 09:11:33] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 390 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
FORMULA AutoFlight-PT-12a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 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 63 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2024-05-21 09:11:33] [INFO ] Computed 76 invariants in 28 ms
[2024-05-21 09:11:34] [INFO ] Implicit Places using invariants in 849 ms returned [7, 21, 35, 56, 63, 70, 77, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 182, 232, 238, 244, 256, 262, 268, 274, 280, 292, 298, 304, 306]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 905 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 275/307 places, 245/245 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 264 transition count 234
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 264 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 263 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 263 transition count 233
Applied a total of 24 rules in 47 ms. Remains 263 /275 variables (removed 12) and now considering 233/245 (removed 12) transitions.
// Phase 1: matrix 233 rows 263 cols
[2024-05-21 09:11:34] [INFO ] Computed 44 invariants in 4 ms
[2024-05-21 09:11:34] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-21 09:11:34] [INFO ] Invariant cache hit.
[2024-05-21 09:11:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:11:35] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/307 places, 233/245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1978 ms. Remains : 263/307 places, 233/245 transitions.
Support contains 50 out of 263 places after structural reductions.
[2024-05-21 09:11:35] [INFO ] Flatten gal took : 71 ms
[2024-05-21 09:11:35] [INFO ] Flatten gal took : 31 ms
[2024-05-21 09:11:36] [INFO ] Input system was already deterministic with 233 transitions.
Incomplete random walk after 10000 steps, including 194 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 37) seen :34
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 09:11:36] [INFO ] Invariant cache hit.
[2024-05-21 09:11:36] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2024-05-21 09:11:37] [INFO ] After 175ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-21 09:11:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:11:37] [INFO ] After 49ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1 real:2
[2024-05-21 09:11:37] [INFO ] After 102ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 09:11:37] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 09:11:37] [INFO ] [Nat]Absence check using 44 positive place invariants in 15 ms returned sat
[2024-05-21 09:11:37] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 09:11:37] [INFO ] After 42ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 09:11:37] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-21 09:11:37] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 71 steps, including 2 resets, run visited all 3 properties in 16 ms. (steps per millisecond=4 )
Parikh walk visited 3 properties in 19 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 6 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(X(F((p1 U (p2||G(p1)))))))||G(F((p1 U (p2||G(p1))))))))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 175 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 09:11:38] [INFO ] Computed 44 invariants in 10 ms
[2024-05-21 09:11:38] [INFO ] Implicit Places using invariants in 196 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 197 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/263 places, 209/233 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 221 transition count 198
Applied a total of 22 rules in 99 ms. Remains 221 /232 variables (removed 11) and now considering 198/209 (removed 11) transitions.
// Phase 1: matrix 198 rows 221 cols
[2024-05-21 09:11:38] [INFO ] Computed 37 invariants in 3 ms
[2024-05-21 09:11:39] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-21 09:11:39] [INFO ] Invariant cache hit.
[2024-05-21 09:11:39] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 221/263 places, 198/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1027 ms. Remains : 221/263 places, 198/233 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(NEQ s132 1), p2:(AND (NEQ s32 1) (EQ s0 1)), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 5 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-00 finished in 1482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(X(X(X((X(p1)&&F(p2)))))))))'
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Applied a total of 42 rules in 139 ms. Remains 242 /263 variables (removed 21) and now considering 212/233 (removed 21) transitions.
// Phase 1: matrix 212 rows 242 cols
[2024-05-21 09:11:40] [INFO ] Computed 44 invariants in 3 ms
[2024-05-21 09:11:40] [INFO ] Implicit Places using invariants in 326 ms returned [13, 26, 39, 46, 77, 202, 228]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 331 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/263 places, 212/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 233 transition count 210
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 233 transition count 210
Applied a total of 4 rules in 10 ms. Remains 233 /235 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 233 cols
[2024-05-21 09:11:40] [INFO ] Computed 37 invariants in 3 ms
[2024-05-21 09:11:40] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-21 09:11:40] [INFO ] Invariant cache hit.
[2024-05-21 09:11:41] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 233/263 places, 210/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1136 ms. Remains : 233/263 places, 210/233 transitions.
Stuttering acceptance computed with spot in 3286 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}, { cond=p0, acceptance={0} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 6}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 9}, { cond=p0, acceptance={} source=5 dest: 10}, { cond=p0, acceptance={0} source=5 dest: 11}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 12}, { cond=p0, acceptance={} source=6 dest: 13}, { cond=p0, acceptance={0} source=6 dest: 14}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 12}, { cond=p0, acceptance={} source=7 dest: 13}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 15}, { cond=p0, acceptance={} source=8 dest: 16}, { cond=p0, acceptance={0} source=8 dest: 17}], [{ cond=(NOT p0), acceptance={0} source=9 dest: 18}, { cond=p0, acceptance={} source=9 dest: 19}, { cond=p0, acceptance={0} source=9 dest: 20}], [{ cond=(NOT p0), acceptance={0} source=10 dest: 18}, { cond=p0, acceptance={} source=10 dest: 19}], [{ cond=(NOT p0), acceptance={0} source=11 dest: 21}, { cond=p0, acceptance={} source=11 dest: 22}, { cond=p0, acceptance={0} source=11 dest: 23}], [{ cond=(NOT p0), acceptance={0} source=12 dest: 24}, { cond=(NOT p2), acceptance={} source=12 dest: 25}, { cond=p0, acceptance={} source=12 dest: 26}, { cond=p0, acceptance={0} source=12 dest: 28}], [{ cond=(NOT p0), acceptance={0} source=13 dest: 24}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=13 dest: 25}, { cond=p0, acceptance={} source=13 dest: 26}, { cond=(AND p0 (NOT p2)), acceptance={} source=13 dest: 27}], [{ cond=(NOT p2), acceptance={} source=14 dest: 25}, { cond=(NOT p0), acceptance={0} source=14 dest: 29}, { cond=p0, acceptance={} source=14 dest: 30}, { cond=p0, acceptance={0} source=14 dest: 31}], [{ cond=(NOT p2), acceptance={} source=15 dest: 25}, { cond=(NOT p0), acceptance={0} source=15 dest: 32}, { cond=p0, acceptance={} source=15 dest: 33}, { cond=p0, acceptance={0} source=15 dest: 34}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=16 dest: 27}, { cond=(NOT p0), acceptance={0} source=16 dest: 32}, { cond=p0, acceptance={} source=16 dest: 33}], [{ cond=(NOT p2), acceptance={} source=17 dest: 25}, { cond=(NOT p0), acceptance={0} source=17 dest: 35}, { cond=p0, acceptance={} source=17 dest: 36}, { cond=p0, acceptance={0} source=17 dest: 37}], [{ cond=(NOT p2), acceptance={} source=18 dest: 25}, { cond=(NOT p0), acceptance={0} source=18 dest: 38}, { cond=p0, acceptance={} source=18 dest: 39}, { cond=p0, acceptance={0} source=18 dest: 40}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=19 dest: 25}, { cond=(AND p0 (NOT p2)), acceptance={} source=19 dest: 27}, { cond=(NOT p0), acceptance={0} source=19 dest: 38}, { cond=p0, acceptance={} source=19 dest: 39}], [{ cond=(NOT p2), acceptance={} source=20 dest: 25}, { cond=(NOT p0), acceptance={0} source=20 dest: 41}, { cond=p0, acceptance={} source=20 dest: 42}, { cond=p0, acceptance={0} source=20 dest: 43}], [{ cond=(NOT p2), acceptance={} source=21 dest: 25}, { cond=(NOT p0), acceptance={0} source=21 dest: 44}, { cond=p0, acceptance={} source=21 dest: 45}, { cond=p0, acceptance={0} source=21 dest: 46}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=22 dest: 27}, { cond=(NOT p0), acceptance={0} source=22 dest: 44}, { cond=p0, acceptance={} source=22 dest: 45}], [{ cond=(NOT p2), acceptance={} source=23 dest: 25}, { cond=(NOT p0), acceptance={0} source=23 dest: 47}, { cond=p0, acceptance={} source=23 dest: 48}, { cond=p0, acceptance={0} source=23 dest: 49}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=24 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=24 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=24 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=25 dest: 25}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=26 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=26 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=27 dest: 25}, { cond=(AND p0 (NOT p2)), acceptance={} source=27 dest: 27}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=28 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=28 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=28 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=29 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=29 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=29 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=30 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=30 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=31 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=31 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0} source=31 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=32 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={} source=32 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={0} source=32 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=33 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={} source=33 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=34 dest: 15}, { cond=(AND p0 (NOT p1)), acceptance={} source=34 dest: 16}, { cond=(AND p0 (NOT p1)), acceptance={0} source=34 dest: 17}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=35 dest: 18}, { cond=(AND p0 (NOT p1)), acceptance={} source=35 dest: 19}, { cond=(AND p0 (NOT p1)), acceptance={0} source=35 dest: 20}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=36 dest: 18}, { cond=(AND p0 (NOT p1)), acceptance={} source=36 dest: 19}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=37 dest: 21}, { cond=(AND p0 (NOT p1)), acceptance={} source=37 dest: 22}, { cond=(AND p0 (NOT p1)), acceptance={0} source=37 dest: 23}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=38 dest: 24}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=38 dest: 25}, { cond=(AND p0 (NOT p1)), acceptance={} source=38 dest: 26}, { cond=(AND p0 (NOT p1)), acceptance={0} source=38 dest: 28}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=39 dest: 24}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=39 dest: 25}, { cond=(AND p0 (NOT p1)), acceptance={} source=39 dest: 26}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=39 dest: 27}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=40 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=40 dest: 29}, { cond=(AND p0 (NOT p1)), acceptance={} source=40 dest: 30}, { cond=(AND p0 (NOT p1)), acceptance={0} source=40 dest: 31}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=41 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=41 dest: 32}, { cond=(AND p0 (NOT p1)), acceptance={} source=41 dest: 33}, { cond=(AND p0 (NOT p1)), acceptance={0} source=41 dest: 34}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=42 dest: 27}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=42 dest: 32}, { cond=(AND p0 (NOT p1)), acceptance={} source=42 dest: 33}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=43 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=43 dest: 35}, { cond=(AND p0 (NOT p1)), acceptance={} source=43 dest: 36}, { cond=(AND p0 (NOT p1)), acceptance={0} source=43 dest: 37}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=44 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=44 dest: 38}, { cond=(AND p0 (NOT p1)), acceptance={} source=44 dest: 39}, { cond=(AND p0 (NOT p1)), acceptance={0} source=44 dest: 40}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=45 dest: 25}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=45 dest: 27}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=45 dest: 38}, { cond=(AND p0 (NOT p1)), acceptance={} source=45 dest: 39}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=46 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=46 dest: 41}, { cond=(AND p0 (NOT p1)), acceptance={} source=46 dest: 42}, { cond=(AND p0 (NOT p1)), acceptance={0} source=46 dest: 43}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=47 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=47 dest: 44}, { cond=(AND p0 (NOT p1)), acceptance={} source=47 dest: 45}, { cond=(AND p0 (NOT p1)), acceptance={0} source=47 dest: 46}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=48 dest: 27}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=48 dest: 44}, { cond=(AND p0 (NOT p1)), acceptance={} source=48 dest: 45}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=49 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=49 dest: 47}, { cond=(AND p0 (NOT p1)), acceptance={} source=49 dest: 48}, { cond=(AND p0 (NOT p1)), acceptance={0} source=49 dest: 49}]], initial=0, aps=[p0:(EQ s63 0), p2:(EQ s120 0), p1:(AND (EQ s87 1) (EQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10085 steps with 187 reset in 123 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-02 finished in 4635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&X(G(p1)))) U p2))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Applied a total of 22 rules in 53 ms. Remains 252 /263 variables (removed 11) and now considering 222/233 (removed 11) transitions.
// Phase 1: matrix 222 rows 252 cols
[2024-05-21 09:11:44] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 09:11:44] [INFO ] Implicit Places using invariants in 148 ms returned [13, 26, 39, 46, 77, 212]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 151 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/263 places, 222/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 245 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 245 transition count 221
Applied a total of 2 rules in 17 ms. Remains 245 /246 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 245 cols
[2024-05-21 09:11:44] [INFO ] Computed 38 invariants in 3 ms
[2024-05-21 09:11:44] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 09:11:44] [INFO ] Invariant cache hit.
[2024-05-21 09:11:45] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 245/263 places, 221/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 551 ms. Remains : 245/263 places, 221/233 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p0), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s231 1) (EQ s244 1)), p0:(NEQ s110 1), p1:(AND (EQ s46 1) (EQ s189 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-03 finished in 721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U (F(p0)&&p1)))'
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 101 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 09:11:45] [INFO ] Computed 44 invariants in 10 ms
[2024-05-21 09:11:45] [INFO ] Implicit Places using invariants in 143 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 148 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/263 places, 209/233 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 219 transition count 196
Applied a total of 26 rules in 25 ms. Remains 219 /232 variables (removed 13) and now considering 196/209 (removed 13) transitions.
// Phase 1: matrix 196 rows 219 cols
[2024-05-21 09:11:45] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 09:11:45] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 09:11:45] [INFO ] Invariant cache hit.
[2024-05-21 09:11:45] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 629 ms. Remains : 219/263 places, 196/233 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), p0, (NOT p0), p0, true]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s81 1) (EQ s188 1)), p0:(AND (EQ s77 1) (EQ s180 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 1789 steps with 441 reset in 17 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-05 finished in 868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 257 transition count 143
Reduce places removed 89 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 90 rules applied. Total rules applied 184 place count 168 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 185 place count 167 transition count 142
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 185 place count 167 transition count 129
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 223 place count 142 transition count 129
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 235 place count 142 transition count 117
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 247 place count 130 transition count 117
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 305 place count 101 transition count 88
Applied a total of 305 rules in 35 ms. Remains 101 /263 variables (removed 162) and now considering 88/233 (removed 145) transitions.
// Phase 1: matrix 88 rows 101 cols
[2024-05-21 09:11:46] [INFO ] Computed 27 invariants in 1 ms
[2024-05-21 09:11:46] [INFO ] Implicit Places using invariants in 85 ms returned [80, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 87 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/263 places, 88/233 transitions.
Applied a total of 0 rules in 19 ms. Remains 99 /99 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 99/263 places, 88/233 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s60 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3148 reset in 294 ms.
Stack based approach found an accepted trace after 3928 steps with 124 reset with depth 78 and stack size 78 in 13 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-06 finished in 507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(p1&&F(p2)))))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 104 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 09:11:46] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 09:11:46] [INFO ] Implicit Places using invariants in 138 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 141 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/263 places, 209/233 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 219 transition count 196
Applied a total of 26 rules in 60 ms. Remains 219 /232 variables (removed 13) and now considering 196/209 (removed 13) transitions.
// Phase 1: matrix 196 rows 219 cols
[2024-05-21 09:11:46] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 09:11:47] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 09:11:47] [INFO ] Invariant cache hit.
[2024-05-21 09:11:47] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 613 ms. Remains : 219/263 places, 196/233 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (EQ s54 1) (EQ s203 1)), p1:(EQ s39 1), p0:(AND (EQ s31 1) (EQ s151 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-07 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1))&&(p2 U p3))))'
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 74 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 09:11:47] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 09:11:47] [INFO ] Implicit Places using invariants in 166 ms returned [13, 39, 46, 77, 225]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 170 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 234/263 places, 209/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 232 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 232 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 231 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 231 transition count 206
Applied a total of 6 rules in 8 ms. Remains 231 /234 variables (removed 3) and now considering 206/209 (removed 3) transitions.
// Phase 1: matrix 206 rows 231 cols
[2024-05-21 09:11:47] [INFO ] Computed 39 invariants in 1 ms
[2024-05-21 09:11:47] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 09:11:47] [INFO ] Invariant cache hit.
[2024-05-21 09:11:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 09:11:48] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 231/263 places, 206/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 633 ms. Remains : 231/263 places, 206/233 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s43 1), p3:(AND (EQ s193 1) (EQ s230 1)), p2:(AND (EQ s25 1) (EQ s138 1)), p1:(EQ s6 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 431 steps with 130 reset in 4 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-08 finished in 969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 85 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 09:11:48] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 09:11:48] [INFO ] Implicit Places using invariants in 152 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 154 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/263 places, 209/233 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 219 transition count 196
Applied a total of 26 rules in 33 ms. Remains 219 /232 variables (removed 13) and now considering 196/209 (removed 13) transitions.
// Phase 1: matrix 196 rows 219 cols
[2024-05-21 09:11:48] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 09:11:48] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 09:11:48] [INFO ] Invariant cache hit.
[2024-05-21 09:11:49] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 589 ms. Remains : 219/263 places, 196/233 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s30 1) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 115 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 761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&F(p2)&&p0)))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 247 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 247 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 246 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 246 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 245 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 245 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 244 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 244 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 243 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 243 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 242 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 242 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 241 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 241 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 240 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 240 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 239 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 239 transition count 209
Applied a total of 48 rules in 85 ms. Remains 239 /263 variables (removed 24) and now considering 209/233 (removed 24) transitions.
// Phase 1: matrix 209 rows 239 cols
[2024-05-21 09:11:49] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 09:11:49] [INFO ] Implicit Places using invariants in 137 ms returned [13, 26, 39, 46, 77, 199, 225]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 144 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/263 places, 209/233 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 229 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 219 transition count 196
Applied a total of 26 rules in 23 ms. Remains 219 /232 variables (removed 13) and now considering 196/209 (removed 13) transitions.
// Phase 1: matrix 196 rows 219 cols
[2024-05-21 09:11:49] [INFO ] Computed 37 invariants in 6 ms
[2024-05-21 09:11:49] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 09:11:49] [INFO ] Invariant cache hit.
[2024-05-21 09:11:49] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/263 places, 196/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 664 ms. Remains : 219/263 places, 196/233 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s43 1) (EQ s153 1)), p2:(EQ s0 0), p0:(AND (EQ s10 1) (EQ s159 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-11 finished in 881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(G(p0)) U p1))))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 252 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 252 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 251 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 251 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 250 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 250 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 249 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 249 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 248 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 248 transition count 218
Applied a total of 30 rules in 44 ms. Remains 248 /263 variables (removed 15) and now considering 218/233 (removed 15) transitions.
// Phase 1: matrix 218 rows 248 cols
[2024-05-21 09:11:50] [INFO ] Computed 44 invariants in 2 ms
[2024-05-21 09:11:50] [INFO ] Implicit Places using invariants in 173 ms returned [13, 26, 39, 46, 77, 208, 234]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 175 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 241/263 places, 218/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 216
Applied a total of 4 rules in 5 ms. Remains 239 /241 variables (removed 2) and now considering 216/218 (removed 2) transitions.
// Phase 1: matrix 216 rows 239 cols
[2024-05-21 09:11:50] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 09:11:50] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 09:11:50] [INFO ] Invariant cache hit.
[2024-05-21 09:11:50] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 239/263 places, 216/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 576 ms. Remains : 239/263 places, 216/233 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s71 1), p0:(EQ s114 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-12 finished in 832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)&&(X(p2)||G(p3)))))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 258 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 258 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 257 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 257 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 256 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 256 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 255 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 255 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 254 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 254 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 253 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 253 transition count 223
Applied a total of 20 rules in 42 ms. Remains 253 /263 variables (removed 10) and now considering 223/233 (removed 10) transitions.
// Phase 1: matrix 223 rows 253 cols
[2024-05-21 09:11:50] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 09:11:51] [INFO ] Implicit Places using invariants in 164 ms returned [13, 26, 39, 46, 213, 239]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 166 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/263 places, 223/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 245 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 245 transition count 221
Applied a total of 4 rules in 5 ms. Remains 245 /247 variables (removed 2) and now considering 221/223 (removed 2) transitions.
// Phase 1: matrix 221 rows 245 cols
[2024-05-21 09:11:51] [INFO ] Computed 38 invariants in 1 ms
[2024-05-21 09:11:51] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 09:11:51] [INFO ] Invariant cache hit.
[2024-05-21 09:11:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 09:11:51] [INFO ] Implicit Places using invariants and state equation in 266 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 : 245/263 places, 221/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 614 ms. Remains : 245/263 places, 221/233 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 p3) (AND p0 p3)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 1}], [{ cond=(OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={} source=5 dest: 1}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s118 1), p0:(OR (EQ s118 1) (AND (EQ s73 1) (EQ s110 1))), p3:(OR (EQ s73 0) (EQ s110 0)), p2:(AND (EQ s73 1) (EQ s110 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]]
Entered a terminal (fully accepting) state of product in 268 steps with 4 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-13 finished in 878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&(p2||G(p3)))))'
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 262 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 262 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 261 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 261 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 260 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 260 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 259 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 259 transition count 229
Applied a total of 8 rules in 13 ms. Remains 259 /263 variables (removed 4) and now considering 229/233 (removed 4) transitions.
// Phase 1: matrix 229 rows 259 cols
[2024-05-21 09:11:51] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 09:11:51] [INFO ] Implicit Places using invariants in 173 ms returned [13, 26, 46, 77, 219, 245]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 175 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 253/263 places, 229/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 251 transition count 227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 227
Applied a total of 4 rules in 5 ms. Remains 251 /253 variables (removed 2) and now considering 227/229 (removed 2) transitions.
// Phase 1: matrix 227 rows 251 cols
[2024-05-21 09:11:51] [INFO ] Computed 38 invariants in 1 ms
[2024-05-21 09:11:52] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-21 09:11:52] [INFO ] Invariant cache hit.
[2024-05-21 09:11:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 09:11:52] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 251/263 places, 227/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 591 ms. Remains : 251/263 places, 227/233 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-12a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s92 0) (EQ s240 0)), p2:(EQ s39 1), p3:(EQ s2 1), p1:(AND (EQ s37 1) (EQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLFireability-14 finished in 816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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, 233/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 263 /263 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 263 cols
[2024-05-21 09:11:52] [INFO ] Computed 44 invariants in 1 ms
[2024-05-21 09:11:52] [INFO ] Implicit Places using invariants in 160 ms returned [26, 39, 77, 223, 249]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 162 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/263 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 256 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 256 transition count 231
Applied a total of 4 rules in 5 ms. Remains 256 /258 variables (removed 2) and now considering 231/233 (removed 2) transitions.
// Phase 1: matrix 231 rows 256 cols
[2024-05-21 09:11:52] [INFO ] Computed 39 invariants in 1 ms
[2024-05-21 09:11:52] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 09:11:52] [INFO ] Invariant cache hit.
[2024-05-21 09:11:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 09:11:53] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 256/263 places, 231/233 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 576 ms. Remains : 256/263 places, 231/233 transitions.
Stuttering acceptance computed with spot in 271 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 6953 reset in 523 ms.
Product exploration explored 100000 steps with 7266 reset in 484 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 99 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 155 ms :[(AND (NOT p0) (NOT p1) (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 516 steps, including 10 resets, run visited all 3 properties in 12 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
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 p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 182 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 167 ms :[(AND (NOT p0) (NOT p1) (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 182 ms :[(AND (NOT p0) (NOT p1) (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 2 ms. Remains 256 /256 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-21 09:11:55] [INFO ] Invariant cache hit.
[2024-05-21 09:11:55] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 09:11:55] [INFO ] Invariant cache hit.
[2024-05-21 09:11:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 09:11:55] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-21 09:11:55] [INFO ] Invariant cache hit.
[2024-05-21 09:11:55] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 565 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 p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 151 ms :[(AND (NOT p0) (NOT p1) (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 222 steps, including 3 resets, run visited all 3 properties in 6 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 164 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 171 ms :[(AND (NOT p0) (NOT p1) (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 197 ms :[(AND (NOT p0) (NOT p1) (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 193 ms :[(AND (NOT p0) (NOT p1) (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 7080 reset in 593 ms.
Product exploration explored 100000 steps with 7061 reset in 516 ms.
Built C files in :
/tmp/ltsmin33758184380680906
[2024-05-21 09:11:58] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin33758184380680906
Running compilation step : cd /tmp/ltsmin33758184380680906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1816 ms.
Running link step : cd /tmp/ltsmin33758184380680906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin33758184380680906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12992398521799877681.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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.
[2024-05-21 09:12:13] [INFO ] Invariant cache hit.
[2024-05-21 09:12:14] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 09:12:14] [INFO ] Invariant cache hit.
[2024-05-21 09:12:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 09:12:14] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-21 09:12:14] [INFO ] Invariant cache hit.
[2024-05-21 09:12:14] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 682 ms. Remains : 256/256 places, 231/231 transitions.
Built C files in :
/tmp/ltsmin5459315984438204453
[2024-05-21 09:12:14] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5459315984438204453
Running compilation step : cd /tmp/ltsmin5459315984438204453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 779 ms.
Running link step : cd /tmp/ltsmin5459315984438204453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5459315984438204453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased660670724062457714.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:12:29] [INFO ] Flatten gal took : 34 ms
[2024-05-21 09:12:29] [INFO ] Flatten gal took : 29 ms
[2024-05-21 09:12:29] [INFO ] Time to serialize gal into /tmp/LTL15970893952535437904.gal : 9 ms
[2024-05-21 09:12:29] [INFO ] Time to serialize properties into /tmp/LTL817755493187672544.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15970893952535437904.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2706768099482817855.hoa' '-atoms' '/tmp/LTL817755493187672544.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL817755493187672544.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2706768099482817855.hoa
Detected timeout of ITS tools.
[2024-05-21 09:12:45] [INFO ] Flatten gal took : 16 ms
[2024-05-21 09:12:45] [INFO ] Flatten gal took : 16 ms
[2024-05-21 09:12:45] [INFO ] Time to serialize gal into /tmp/LTL17420764586968411981.gal : 7 ms
[2024-05-21 09:12:45] [INFO ] Time to serialize properties into /tmp/LTL7183502746533986268.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17420764586968411981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7183502746533986268.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G(("(p48==1)")||(X(X("((((p49==1)&&(p214==1))||(p14==0))||(p185==0))")))))||("((p49==1)&&(p214==1))")))))
Formula 0 simplified : G(F(!"(p48==1)" & XX!"((((p49==1)&&(p214==1))||(p14==0))||(p185==0))") & FG!"((p49==1)&&(p214==1))")
Detected timeout of ITS tools.
[2024-05-21 09:13:00] [INFO ] Flatten gal took : 16 ms
[2024-05-21 09:13:00] [INFO ] Applying decomposition
[2024-05-21 09:13:00] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4089182516017753174.txt' '-o' '/tmp/graph4089182516017753174.bin' '-w' '/tmp/graph4089182516017753174.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4089182516017753174.bin' '-l' '-1' '-v' '-w' '/tmp/graph4089182516017753174.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:13:00] [INFO ] Decomposing Gal with order
[2024-05-21 09:13:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:13:00] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-21 09:13:00] [INFO ] Flatten gal took : 79 ms
[2024-05-21 09:13:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-21 09:13:00] [INFO ] Time to serialize gal into /tmp/LTL12873310636660660422.gal : 12 ms
[2024-05-21 09:13:00] [INFO ] Time to serialize properties into /tmp/LTL17675783531009378914.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12873310636660660422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17675783531009378914.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((G(("(i16.u14.p48==1)")||(X(X("((((i9.u38.p49==1)&&(i11.u75.p214==1))||(i9.u4.p14==0))||(i9.u63.p185==0))")))))||("((i9.u38.p49...185
Formula 0 simplified : G(F(!"(i16.u14.p48==1)" & XX!"((((i9.u38.p49==1)&&(i11.u75.p214==1))||(i9.u4.p14==0))||(i9.u63.p185==0))") & FG!"((i9.u38.p49==1)&&(...174
Reverse transition relation is NOT exact ! Due to transitions i0.u9.t43, i0.u11.t39, i0.u13.t35, i0.u15.t31, i1.u10.t41, i1.u12.t37, i2.u20.t21, i2.u22.t17...480
Computing Next relation with stutter on 24 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5329967636918177357
[2024-05-21 09:13:15] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5329967636918177357
Running compilation step : cd /tmp/ltsmin5329967636918177357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 487 ms.
Running link step : cd /tmp/ltsmin5329967636918177357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5329967636918177357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([](((LTLAPp0==true)||X(X((LTLAPp1==true)))))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-12a-LTLFireability-15 finished in 97978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1||X(X(p2))))))))'
[2024-05-21 09:13:30] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13685677665549698792
[2024-05-21 09:13:30] [INFO ] Computing symmetric may disable matrix : 233 transitions.
[2024-05-21 09:13:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:13:30] [INFO ] Computing symmetric may enable matrix : 233 transitions.
[2024-05-21 09:13:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:13:30] [INFO ] Applying decomposition
[2024-05-21 09:13:30] [INFO ] Flatten gal took : 12 ms
[2024-05-21 09:13:30] [INFO ] Computing Do-Not-Accords matrix : 233 transitions.
[2024-05-21 09:13:30] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10126774980233436420.txt' '-o' '/tmp/graph10126774980233436420.bin' '-w' '/tmp/graph10126774980233436420.weights'
[2024-05-21 09:13:30] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13685677665549698792
Running compilation step : cd /tmp/ltsmin13685677665549698792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10126774980233436420.bin' '-l' '-1' '-v' '-w' '/tmp/graph10126774980233436420.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:13:30] [INFO ] Decomposing Gal with order
[2024-05-21 09:13:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:13:30] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-21 09:13:30] [INFO ] Flatten gal took : 36 ms
[2024-05-21 09:13:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-21 09:13:30] [INFO ] Time to serialize gal into /tmp/LTLFireability10805478893882585413.gal : 10 ms
[2024-05-21 09:13:30] [INFO ] Time to serialize properties into /tmp/LTLFireability16403028287426330897.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10805478893882585413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16403028287426330897.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i6.i0.u40.p49==1)&&(i9.i2.u75.p214==1))")||(G(("(i3.u14.p48==1)")||(X(X("((((i6.i0.u40.p49==1)&&(i9.i2.u75.p214==1))||(i6.i...200
Formula 0 simplified : G(F(!"(i3.u14.p48==1)" & XX!"((((i6.i0.u40.p49==1)&&(i9.i2.u75.p214==1))||(i6.i2.u4.p14==0))||(i6.i2.u63.p185==0))") & FG!"((i6.i0.u...189
Reverse transition relation is NOT exact ! Due to transitions i0.u10.t41, i1.u12.t37, i2.i0.u7.t47, i2.i0.u9.t43, i2.i1.u11.t39, i2.i1.u13.t35, i3.u14.t33,...525
Computing Next relation with stutter on 24 deadlock states
Compilation finished in 728 ms.
Running link step : cd /tmp/ltsmin13685677665549698792;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13685677665549698792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: LTL layer: formula: [](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))
pins2lts-mc-linux64( 2/ 8), 0.007: "[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.062: There are 237 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.062: State length is 264, there are 243 groups
pins2lts-mc-linux64( 0/ 8), 0.062: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.062: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.062: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.062: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.123: [Blue] ~42 levels ~960 states ~8040 transitions
pins2lts-mc-linux64( 3/ 8), 0.136: [Blue] ~42 levels ~1920 states ~11112 transitions
pins2lts-mc-linux64( 3/ 8), 0.161: [Blue] ~42 levels ~3840 states ~18304 transitions
pins2lts-mc-linux64( 3/ 8), 0.207: [Blue] ~42 levels ~7680 states ~35800 transitions
pins2lts-mc-linux64( 3/ 8), 0.356: [Blue] ~42 levels ~15360 states ~73320 transitions
pins2lts-mc-linux64( 3/ 8), 0.717: [Blue] ~42 levels ~30720 states ~156032 transitions
pins2lts-mc-linux64( 3/ 8), 1.434: [Blue] ~42 levels ~61440 states ~336272 transitions
pins2lts-mc-linux64( 5/ 8), 2.520: [Blue] ~41 levels ~122880 states ~733304 transitions
pins2lts-mc-linux64( 3/ 8), 4.421: [Blue] ~42 levels ~245760 states ~1572176 transitions
pins2lts-mc-linux64( 6/ 8), 7.254: [Blue] ~238 levels ~491520 states ~2919144 transitions
pins2lts-mc-linux64( 6/ 8), 11.657: [Blue] ~238 levels ~983040 states ~5711512 transitions
pins2lts-mc-linux64( 6/ 8), 19.340: [Blue] ~385 levels ~1966080 states ~11891176 transitions
pins2lts-mc-linux64( 6/ 8), 34.737: [Blue] ~680 levels ~3932160 states ~25124256 transitions
pins2lts-mc-linux64( 6/ 8), 65.863: [Blue] ~1124 levels ~7864320 states ~52720360 transitions
pins2lts-mc-linux64( 6/ 8), 128.426: [Blue] ~1938 levels ~15728640 states ~108932000 transitions
pins2lts-mc-linux64( 6/ 8), 256.185: [Blue] ~3417 levels ~31457280 states ~227214832 transitions
pins2lts-mc-linux64( 6/ 8), 520.683: [Blue] ~7191 levels ~62914560 states ~480264616 transitions
pins2lts-mc-linux64( 3/ 8), 810.918: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 811.235:
pins2lts-mc-linux64( 0/ 8), 811.235: Explored 83808922 states 820918826 transitions, fanout: 9.795
pins2lts-mc-linux64( 0/ 8), 811.235: Total exploration time 811.160 sec (810.840 sec minimum, 810.919 sec on average)
pins2lts-mc-linux64( 0/ 8), 811.235: States per second: 103320, Transitions per second: 1012031
pins2lts-mc-linux64( 0/ 8), 811.235:
pins2lts-mc-linux64( 0/ 8), 811.235: State space has 83799101 states, 34568289 are accepting
pins2lts-mc-linux64( 0/ 8), 811.235: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 811.235: blue states: 83808922 (100.01%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 811.235: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 811.235: all-red states: 61249020 (73.09%), bogus 9770 (0.01%)
pins2lts-mc-linux64( 0/ 8), 811.235:
pins2lts-mc-linux64( 0/ 8), 811.235: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 811.235:
pins2lts-mc-linux64( 0/ 8), 811.235: Queue width: 8B, total height: 25135, memory: 0.19MB
pins2lts-mc-linux64( 0/ 8), 811.235: Tree memory: 895.3MB, 11.2 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 811.235: Tree fill ratio (roots/leafs): 62.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 811.235: Stored 237 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 811.235: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 811.235: Est. total memory use: 895.5MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13685677665549698792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13685677665549698792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](((LTLAPp1==true)||X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 09:34:10] [INFO ] Applying decomposition
[2024-05-21 09:34:10] [INFO ] Flatten gal took : 17 ms
[2024-05-21 09:34:10] [INFO ] Decomposing Gal with order
[2024-05-21 09:34:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:34:10] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-21 09:34:10] [INFO ] Flatten gal took : 26 ms
[2024-05-21 09:34:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2024-05-21 09:34:10] [INFO ] Time to serialize gal into /tmp/LTLFireability14991050850931147493.gal : 4 ms
[2024-05-21 09:34:10] [INFO ] Time to serialize properties into /tmp/LTLFireability4599652487164097346.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14991050850931147493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4599652487164097346.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u21.p49==1)&&(u62.p214==1))")||(G(("(u20.p48==1)")||(X(X("((((u21.p49==1)&&(u62.p214==1))||(u6.p14==0))||(u62.p185==0))")))...161
Formula 0 simplified : G(F(!"(u20.p48==1)" & XX!"((((u21.p49==1)&&(u62.p214==1))||(u6.p14==0))||(u62.p185==0))") & FG!"((u21.p49==1)&&(u62.p214==1))")
Reverse transition relation is NOT exact ! Due to transitions t98, t121, u1.t59, u2.t57, u4.t55, u5.t53, u7.t51, u8.t49, u10.t47, u11.t45, u13.t43, u14.t41...392
Computing Next relation with stutter on 24 deadlock states
Detected timeout of ITS tools.
[2024-05-21 09:54:52] [INFO ] Flatten gal took : 460 ms
[2024-05-21 09:54:54] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-21 09:54:54] [INFO ] Transformed 263 places.
[2024-05-21 09:54:54] [INFO ] Transformed 233 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 09:54:55] [INFO ] Time to serialize gal into /tmp/LTLFireability1931989678791891299.gal : 8 ms
[2024-05-21 09:54:55] [INFO ] Time to serialize properties into /tmp/LTLFireability7861697064460665692.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1931989678791891299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7861697064460665692.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p49==1)&&(p214==1))")||(G(("(p48==1)")||(X(X("((((p49==1)&&(p214==1))||(p14==0))||(p185==0))")))))))))
Formula 0 simplified : G(F(!"(p48==1)" & XX!"((((p49==1)&&(p214==1))||(p14==0))||(p185==0))") & FG!"((p49==1)&&(p214==1))")
Reverse transition relation is NOT exact ! Due to transitions t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t39, t41, t43, t45, t47, t49...298
Computing Next relation with stutter on 24 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12129164 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16022520 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r043-smll-171620180100098"
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 ;