Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689300467.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-12a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 7.5K Apr 30 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 01:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 30 01:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 85K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652663004049

Running Version 202205111006
[2022-05-16 01:03:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 01:03:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:03:25] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2022-05-16 01:03:25] [INFO ] Transformed 307 places.
[2022-05-16 01:03:25] [INFO ] Transformed 305 transitions.
[2022-05-16 01:03:25] [INFO ] Found NUPN structural information;
[2022-05-16 01:03:25] [INFO ] Parsed PT model containing 307 places and 305 transitions in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
FORMULA AutoFlight-PT-12a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 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 39 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2022-05-16 01:03:25] [INFO ] Computed 76 place invariants in 20 ms
[2022-05-16 01:03:25] [INFO ] Implicit Places using invariants in 386 ms returned [7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 84, 87, 90, 93, 96, 99, 102, 105, 111, 114, 117, 182, 232, 238, 244, 250, 256, 262, 268, 274, 286, 292, 298, 306]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 417 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 272/307 places, 245/245 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 261 transition count 234
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 261 transition count 234
Applied a total of 22 rules in 18 ms. Remains 261 /272 variables (removed 11) and now considering 234/245 (removed 11) transitions.
// Phase 1: matrix 234 rows 261 cols
[2022-05-16 01:03:26] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-16 01:03:26] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 234 rows 261 cols
[2022-05-16 01:03:26] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-16 01:03:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:03:26] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/307 places, 234/245 transitions.
Finished structural reductions, in 2 iterations. Remains : 261/307 places, 234/245 transitions.
Support contains 34 out of 261 places after structural reductions.
[2022-05-16 01:03:26] [INFO ] Flatten gal took : 40 ms
[2022-05-16 01:03:26] [INFO ] Flatten gal took : 16 ms
[2022-05-16 01:03:26] [INFO ] Input system was already deterministic with 234 transitions.
Incomplete random walk after 10000 steps, including 183 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 234 rows 261 cols
[2022-05-16 01:03:27] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-16 01:03:27] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:03:27] [INFO ] [Nat]Absence check using 41 positive place invariants in 8 ms returned sat
[2022-05-16 01:03:27] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-05-16 01:03:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:03:27] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2022-05-16 01:03:27] [INFO ] Deduced a trap composed of 114 places in 61 ms of which 4 ms to minimize.
[2022-05-16 01:03:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-05-16 01:03:27] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-16 01:03:27] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 88 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=44 )
Parikh walk visited 2 properties in 3 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA AutoFlight-PT-12a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(F((p0||X(p1))))))&&F(G(p2))))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 234/234 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 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 91 rules applied. Total rules applied 91 place count 258 transition count 144
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 181 place count 169 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 168 transition count 143
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 182 place count 168 transition count 130
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 220 place count 143 transition count 130
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 232 place count 143 transition count 118
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 244 place count 131 transition count 118
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 300 place count 103 transition count 90
Applied a total of 300 rules in 31 ms. Remains 103 /261 variables (removed 158) and now considering 90/234 (removed 144) transitions.
// Phase 1: matrix 90 rows 103 cols
[2022-05-16 01:03:27] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-16 01:03:27] [INFO ] Implicit Places using invariants in 53 ms returned [92, 101]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/261 places, 90/234 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 101/261 places, 90/234 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s36 1), p0:(AND (NEQ s62 0) (NEQ s60 1)), p1:(EQ s36 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-00 finished in 359 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X((X(X((F(p0) U p1)))&&p1)) U p1)))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 260 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 260 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 259 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 259 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 258 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 258 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 257 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 257 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 224
Applied a total of 20 rules in 50 ms. Remains 251 /261 variables (removed 10) and now considering 224/234 (removed 10) transitions.
// Phase 1: matrix 224 rows 251 cols
[2022-05-16 01:03:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-16 01:03:28] [INFO ] Implicit Places using invariants in 106 ms returned [89, 98, 231, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 115 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/261 places, 224/234 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 245 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 245 transition count 222
Applied a total of 4 rules in 11 ms. Remains 245 /247 variables (removed 2) and now considering 222/224 (removed 2) transitions.
// Phase 1: matrix 222 rows 245 cols
[2022-05-16 01:03:28] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:03:28] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 222 rows 245 cols
[2022-05-16 01:03:28] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 01:03:28] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 245/261 places, 222/234 transitions.
Finished structural reductions, in 2 iterations. Remains : 245/261 places, 222/234 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, p1, p0, (AND p0 p1), p1, p1, p1, p1]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 1}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 4}]], initial=7, aps=[p1:(OR (EQ s92 0) (EQ s14 1)), p0:(OR (EQ s5 0) (EQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 6 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-01 finished in 579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))||F(p1)||F(X(X(X(p1)))))))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 260 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 260 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 259 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 259 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 258 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 258 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 257 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 257 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 250 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 250 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 249 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 249 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 248 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 248 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 247 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 247 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 246 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 246 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 245 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 245 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 244 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 244 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 215
Applied a total of 38 rules in 65 ms. Remains 242 /261 variables (removed 19) and now considering 215/234 (removed 19) transitions.
// Phase 1: matrix 215 rows 242 cols
[2022-05-16 01:03:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-16 01:03:28] [INFO ] Implicit Places using invariants in 72 ms returned [89, 98, 222, 240]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 73 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 238/261 places, 215/234 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 236 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 236 transition count 213
Applied a total of 4 rules in 8 ms. Remains 236 /238 variables (removed 2) and now considering 213/215 (removed 2) transitions.
// Phase 1: matrix 213 rows 236 cols
[2022-05-16 01:03:28] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 01:03:28] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 213 rows 236 cols
[2022-05-16 01:03:28] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:03:28] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 236/261 places, 213/234 transitions.
Finished structural reductions, in 2 iterations. Remains : 236/261 places, 213/234 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}]], initial=1, aps=[p1:(AND (EQ s5 0) (EQ s81 1)), p0:(OR (EQ s60 0) (EQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6483 reset in 328 ms.
Product exploration explored 100000 steps with 6472 reset in 309 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 236 cols
[2022-05-16 01:03:30] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 01:03:30] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 213 rows 236 cols
[2022-05-16 01:03:30] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-16 01:03:30] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 236 cols
[2022-05-16 01:03:30] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:03:30] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 213/213 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6432 reset in 277 ms.
Product exploration explored 100000 steps with 6418 reset in 282 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 213/213 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 236 transition count 213
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 72 place count 236 transition count 213
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 236 transition count 213
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 142 place count 178 transition count 155
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 200 place count 178 transition count 155
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 225 place count 178 transition count 155
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 229 place count 174 transition count 151
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 233 place count 174 transition count 151
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 233 rules in 54 ms. Remains 174 /236 variables (removed 62) and now considering 151/213 (removed 62) transitions.
[2022-05-16 01:03:32] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 151 rows 174 cols
[2022-05-16 01:03:32] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:03:32] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/236 places, 151/213 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/236 places, 151/213 transitions.
Product exploration explored 100000 steps with 8238 reset in 549 ms.
Product exploration explored 100000 steps with 8262 reset in 451 ms.
Built C files in :
/tmp/ltsmin14648680694870233158
[2022-05-16 01:03:33] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14648680694870233158
Running compilation step : cd /tmp/ltsmin14648680694870233158;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 891 ms.
Running link step : cd /tmp/ltsmin14648680694870233158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin14648680694870233158;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17026002148173884186.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 213/213 transitions.
Applied a total of 0 rules in 10 ms. Remains 236 /236 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 236 cols
[2022-05-16 01:03:48] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:03:48] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 213 rows 236 cols
[2022-05-16 01:03:48] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:03:48] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 236 cols
[2022-05-16 01:03:48] [INFO ] Computed 37 place invariants in 9 ms
[2022-05-16 01:03:48] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 213/213 transitions.
Built C files in :
/tmp/ltsmin3320361242415089071
[2022-05-16 01:03:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3320361242415089071
Running compilation step : cd /tmp/ltsmin3320361242415089071;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 376 ms.
Running link step : cd /tmp/ltsmin3320361242415089071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3320361242415089071;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14423145696608712732.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:04:03] [INFO ] Flatten gal took : 12 ms
[2022-05-16 01:04:03] [INFO ] Flatten gal took : 11 ms
[2022-05-16 01:04:03] [INFO ] Time to serialize gal into /tmp/LTL10925469640713466123.gal : 3 ms
[2022-05-16 01:04:03] [INFO ] Time to serialize properties into /tmp/LTL10076745803207560107.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10925469640713466123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10076745803207560107.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1092546...268
Read 1 LTL properties
Checking formula 0 : !((F(((X(X("((p69==0)||(p141==1))")))||(F("((p5==0)&&(p97==1))")))||(F(X(X(X("((p5==0)&&(p97==1))"))))))))
Formula 0 simplified : !F(XX"((p69==0)||(p141==1))" | F"((p5==0)&&(p97==1))" | FXXX"((p5==0)&&(p97==1))")
Detected timeout of ITS tools.
[2022-05-16 01:04:18] [INFO ] Flatten gal took : 26 ms
[2022-05-16 01:04:18] [INFO ] Applying decomposition
[2022-05-16 01:04:18] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10271549399058937388.txt' '-o' '/tmp/graph10271549399058937388.bin' '-w' '/tmp/graph10271549399058937388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10271549399058937388.bin' '-l' '-1' '-v' '-w' '/tmp/graph10271549399058937388.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:04:19] [INFO ] Decomposing Gal with order
[2022-05-16 01:04:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:04:19] [INFO ] Removed a total of 25 redundant transitions.
[2022-05-16 01:04:19] [INFO ] Flatten gal took : 118 ms
[2022-05-16 01:04:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-16 01:04:19] [INFO ] Time to serialize gal into /tmp/LTL18418264376778254276.gal : 22 ms
[2022-05-16 01:04:19] [INFO ] Time to serialize properties into /tmp/LTL12944709689952954013.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18418264376778254276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12944709689952954013.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1841826...247
Read 1 LTL properties
Checking formula 0 : !((F(((X(X("((i18.u19.p69==0)||(i7.i1.u44.p141==1))")))||(F("((i15.u1.p5==0)&&(i17.i0.u28.p97==1))")))||(F(X(X(X("((i15.u1.p5==0)&&(i1...181
Formula 0 simplified : !F(XX"((i18.u19.p69==0)||(i7.i1.u44.p141==1))" | F"((i15.u1.p5==0)&&(i17.i0.u28.p97==1))" | FXXX"((i15.u1.p5==0)&&(i17.i0.u28.p97==1...159
Reverse transition relation is NOT exact ! Due to transitions i0.u6.t47, i0.u8.t43, i1.u10.t39, i1.u11.t37, i2.u15.t29, i3.u20.t19, i3.u22.t15, i4.u21.t17,...514
Computing Next relation with stutter on 24 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1395 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.0073,345080,1,0,566789,182,2634,1.32608e+06,121,279,100865
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-12a-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-12a-LTLCardinality-02 finished in 65048 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 234/234 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 258 transition count 145
Reduce places removed 88 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 170 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 182 place count 168 transition count 143
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 182 place count 168 transition count 129
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 222 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 234 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 246 place count 130 transition count 117
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 300 place count 103 transition count 90
Applied a total of 300 rules in 24 ms. Remains 103 /261 variables (removed 158) and now considering 90/234 (removed 144) transitions.
// Phase 1: matrix 90 rows 103 cols
[2022-05-16 01:04:33] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-16 01:04:33] [INFO ] Implicit Places using invariants in 181 ms returned [92, 101]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 183 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/261 places, 90/234 transitions.
Applied a total of 0 rules in 11 ms. Remains 101 /101 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 101/261 places, 90/234 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s62 1), p1:(OR (EQ s14 0) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-04 finished in 393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(p0))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 260 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 260 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 259 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 259 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 258 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 258 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 257 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 257 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 250 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 250 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 249 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 249 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 248 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 248 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 247 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 247 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 246 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 246 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 245 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 245 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 244 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 244 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 241 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 241 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 237 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 237 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 236 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 236 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 235 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 235 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 234 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 234 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 233 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 233 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 232 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 232 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 231 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 231 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 230 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 230 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 229 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 229 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 228 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 228 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 227 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 227 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 226 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 226 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 225 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 225 transition count 198
Applied a total of 72 rules in 192 ms. Remains 225 /261 variables (removed 36) and now considering 198/234 (removed 36) transitions.
// Phase 1: matrix 198 rows 225 cols
[2022-05-16 01:04:34] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-16 01:04:34] [INFO ] Implicit Places using invariants in 160 ms returned [89, 98, 205, 223]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 166 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 221/261 places, 198/234 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 219 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 219 transition count 196
Applied a total of 4 rules in 4 ms. Remains 219 /221 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 219 cols
[2022-05-16 01:04:34] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:04:34] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 196 rows 219 cols
[2022-05-16 01:04:34] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-16 01:04:34] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/261 places, 196/234 transitions.
Finished structural reductions, in 2 iterations. Remains : 219/261 places, 196/234 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s148 0) (EQ s146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 242 steps with 3 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-06 finished in 692 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 234/234 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 258 transition count 140
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 188 place count 165 transition count 140
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 188 place count 165 transition count 128
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 224 place count 141 transition count 128
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 235 place count 141 transition count 117
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 247 place count 130 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 248 place count 129 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 249 place count 128 transition count 115
Iterating global reduction 5 with 1 rules applied. Total rules applied 250 place count 128 transition count 115
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 306 place count 100 transition count 87
Applied a total of 306 rules in 22 ms. Remains 100 /261 variables (removed 161) and now considering 87/234 (removed 147) transitions.
// Phase 1: matrix 87 rows 100 cols
[2022-05-16 01:04:34] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-16 01:04:34] [INFO ] Implicit Places using invariants in 50 ms returned [89, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/261 places, 87/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 98/261 places, 87/234 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-07 finished in 114 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!X(G(X(p0)))) U !p1)))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 234/234 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 261 transition count 142
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 184 place count 169 transition count 142
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 184 place count 169 transition count 132
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 204 place count 159 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 205 place count 158 transition count 131
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 158 transition count 131
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 260 place count 131 transition count 104
Applied a total of 260 rules in 15 ms. Remains 131 /261 variables (removed 130) and now considering 104/234 (removed 130) transitions.
// Phase 1: matrix 104 rows 131 cols
[2022-05-16 01:04:34] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-16 01:04:34] [INFO ] Implicit Places using invariants in 118 ms returned [49, 50, 51, 52, 53, 56, 59, 60, 61, 62, 63, 64, 114]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 120 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/261 places, 104/234 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 118 transition count 93
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 107 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 106 transition count 92
Applied a total of 24 rules in 3 ms. Remains 106 /118 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 106 cols
[2022-05-16 01:04:34] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-16 01:04:34] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 92 rows 106 cols
[2022-05-16 01:04:34] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 01:04:35] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-16 01:04:35] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/261 places, 92/234 transitions.
Finished structural reductions, in 2 iterations. Remains : 106/261 places, 92/234 transitions.
Stuttering acceptance computed with spot in 115 ms :[p1, p0, p0, p1]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s50 0) (EQ s104 1)), p0:(OR (EQ s102 0) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-09 finished in 416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||G(p1)||p1)))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 260 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 260 transition count 233
Applied a total of 2 rules in 5 ms. Remains 260 /261 variables (removed 1) and now considering 233/234 (removed 1) transitions.
// Phase 1: matrix 233 rows 260 cols
[2022-05-16 01:04:35] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-16 01:04:35] [INFO ] Implicit Places using invariants in 117 ms returned [89, 98, 240, 258]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 119 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 256/261 places, 233/234 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 254 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 254 transition count 231
Applied a total of 4 rules in 5 ms. Remains 254 /256 variables (removed 2) and now considering 231/233 (removed 2) transitions.
// Phase 1: matrix 231 rows 254 cols
[2022-05-16 01:04:35] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-16 01:04:35] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 231 rows 254 cols
[2022-05-16 01:04:35] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-16 01:04:35] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 254/261 places, 231/234 transitions.
Finished structural reductions, in 2 iterations. Remains : 254/261 places, 231/234 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s129 0) (EQ s158 1)), p0:(EQ s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-10 finished in 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 6 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 234/234 transitions.
Applied a total of 0 rules in 3 ms. Remains 261 /261 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 261 cols
[2022-05-16 01:04:35] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-16 01:04:35] [INFO ] Implicit Places using invariants in 81 ms returned [89, 241, 259]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 83 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/261 places, 234/234 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 256 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 256 transition count 232
Applied a total of 4 rules in 7 ms. Remains 256 /258 variables (removed 2) and now considering 232/234 (removed 2) transitions.
// Phase 1: matrix 232 rows 256 cols
[2022-05-16 01:04:35] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-16 01:04:35] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 232 rows 256 cols
[2022-05-16 01:04:35] [INFO ] Computed 38 place invariants in 7 ms
[2022-05-16 01:04:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:04:36] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 256/261 places, 232/234 transitions.
Finished structural reductions, in 2 iterations. Remains : 256/261 places, 232/234 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (OR (EQ s97 0) (EQ s99 1))) (NOT (OR (EQ s131 0) (EQ s6 1)))), p0:(AND (OR (EQ s131 0) (EQ s6 1)) (OR (EQ s38 0) (EQ s91 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-12 finished in 448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(true U p0)))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 234/234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 260 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 260 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 259 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 259 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 258 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 258 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 257 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 257 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 256 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 255 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 255 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 254 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 254 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 253 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 253 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 252 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 252 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 251 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 251 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 250 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 250 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 249 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 249 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 248 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 248 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 247 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 247 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 246 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 246 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 245 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 245 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 244 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 244 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 241 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 241 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 237 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 237 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 236 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 236 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 235 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 235 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 234 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 234 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 233 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 233 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 232 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 232 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 231 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 231 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 230 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 230 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 229 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 229 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 228 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 228 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 227 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 227 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 226 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 226 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 225 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 225 transition count 198
Applied a total of 72 rules in 86 ms. Remains 225 /261 variables (removed 36) and now considering 198/234 (removed 36) transitions.
// Phase 1: matrix 198 rows 225 cols
[2022-05-16 01:04:36] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-16 01:04:36] [INFO ] Implicit Places using invariants in 69 ms returned [89, 98, 205, 223]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 221/261 places, 198/234 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 219 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 219 transition count 196
Applied a total of 4 rules in 5 ms. Remains 219 /221 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 219 cols
[2022-05-16 01:04:36] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-16 01:04:36] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 196 rows 219 cols
[2022-05-16 01:04:36] [INFO ] Computed 37 place invariants in 9 ms
[2022-05-16 01:04:36] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/261 places, 196/234 transitions.
Finished structural reductions, in 2 iterations. Remains : 219/261 places, 196/234 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, p0, p0]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s135 0) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-13 finished in 493 ms.
All properties solved by simple procedures.
Total runtime 71421 ms.

BK_STOP 1652663076688

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-12a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689300467"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;