Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597900444.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is AutoFlight-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597900444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 113K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678628154336

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:35:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 13:35:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:35:58] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-12 13:35:58] [INFO ] Transformed 482 places.
[2023-03-12 13:35:58] [INFO ] Transformed 480 transitions.
[2023-03-12 13:35:58] [INFO ] Found NUPN structural information;
[2023-03-12 13:35:58] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-05b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 480/480 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 423 transition count 421
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 423 transition count 421
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 126 place count 423 transition count 413
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 150 place count 399 transition count 389
Iterating global reduction 1 with 24 rules applied. Total rules applied 174 place count 399 transition count 389
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 178 place count 395 transition count 385
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 395 transition count 385
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 184 place count 393 transition count 383
Iterating global reduction 1 with 2 rules applied. Total rules applied 186 place count 393 transition count 383
Applied a total of 186 rules in 144 ms. Remains 393 /482 variables (removed 89) and now considering 383/480 (removed 97) transitions.
// Phase 1: matrix 383 rows 393 cols
[2023-03-12 13:35:58] [INFO ] Computed 34 place invariants in 22 ms
[2023-03-12 13:35:59] [INFO ] Implicit Places using invariants in 590 ms returned []
[2023-03-12 13:35:59] [INFO ] Invariant cache hit.
[2023-03-12 13:36:00] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
[2023-03-12 13:36:00] [INFO ] Invariant cache hit.
[2023-03-12 13:36:00] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/482 places, 383/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2587 ms. Remains : 393/482 places, 383/480 transitions.
Support contains 31 out of 393 places after structural reductions.
[2023-03-12 13:36:01] [INFO ] Flatten gal took : 63 ms
[2023-03-12 13:36:01] [INFO ] Flatten gal took : 29 ms
[2023-03-12 13:36:01] [INFO ] Input system was already deterministic with 383 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 30) seen :25
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 13:36:02] [INFO ] Invariant cache hit.
[2023-03-12 13:36:02] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2023-03-12 13:36:02] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 13:36:02] [INFO ] After 239ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-12 13:36:02] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 7 ms to minimize.
[2023-03-12 13:36:03] [INFO ] Deduced a trap composed of 68 places in 314 ms of which 2 ms to minimize.
[2023-03-12 13:36:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 607 ms
[2023-03-12 13:36:03] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 23 ms to minimize.
[2023-03-12 13:36:03] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 1 ms to minimize.
[2023-03-12 13:36:04] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 2 ms to minimize.
[2023-03-12 13:36:04] [INFO ] Deduced a trap composed of 78 places in 237 ms of which 0 ms to minimize.
[2023-03-12 13:36:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1061 ms
[2023-03-12 13:36:04] [INFO ] After 2077ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 13:36:04] [INFO ] After 2426ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 13:36:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-12 13:36:04] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 13:36:05] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 13:36:05] [INFO ] Deduced a trap composed of 69 places in 235 ms of which 1 ms to minimize.
[2023-03-12 13:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-12 13:36:05] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 4 ms to minimize.
[2023-03-12 13:36:05] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 0 ms to minimize.
[2023-03-12 13:36:06] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 0 ms to minimize.
[2023-03-12 13:36:06] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 1 ms to minimize.
[2023-03-12 13:36:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 656 ms
[2023-03-12 13:36:06] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 1 ms to minimize.
[2023-03-12 13:36:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-12 13:36:06] [INFO ] Deduced a trap composed of 53 places in 250 ms of which 1 ms to minimize.
[2023-03-12 13:36:06] [INFO ] Deduced a trap composed of 80 places in 308 ms of which 13 ms to minimize.
[2023-03-12 13:36:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 657 ms
[2023-03-12 13:36:07] [INFO ] After 2070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-12 13:36:07] [INFO ] After 2740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 32 ms.
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 383/383 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 393 transition count 249
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 152 rules applied. Total rules applied 286 place count 259 transition count 231
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 296 place count 249 transition count 231
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 296 place count 249 transition count 182
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 394 place count 200 transition count 182
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 400 place count 194 transition count 176
Iterating global reduction 3 with 6 rules applied. Total rules applied 406 place count 194 transition count 176
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 406 place count 194 transition count 173
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 412 place count 191 transition count 173
Performed 72 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 556 place count 119 transition count 92
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 576 place count 119 transition count 72
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 596 place count 99 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 597 place count 98 transition count 71
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 46 rules applied. Total rules applied 643 place count 77 transition count 46
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 668 place count 52 transition count 46
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 668 place count 52 transition count 34
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 692 place count 40 transition count 34
Applied a total of 692 rules in 53 ms. Remains 40 /393 variables (removed 353) and now considering 34/383 (removed 349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 40/393 places, 34/383 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=21 )
Computed a total of 100 stabilizing places and 100 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 383 transition count 373
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 383 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 383 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 378 transition count 367
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 378 transition count 367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 377 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 377 transition count 366
Applied a total of 33 rules in 87 ms. Remains 377 /393 variables (removed 16) and now considering 366/383 (removed 17) transitions.
// Phase 1: matrix 366 rows 377 cols
[2023-03-12 13:36:08] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-12 13:36:08] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-12 13:36:08] [INFO ] Invariant cache hit.
[2023-03-12 13:36:08] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2023-03-12 13:36:08] [INFO ] Invariant cache hit.
[2023-03-12 13:36:09] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 377/393 places, 366/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 883 ms. Remains : 377/393 places, 366/383 transitions.
Stuttering acceptance computed with spot in 442 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s94 1), p1:(EQ s52 0), p2:(EQ s16 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 285 steps with 0 reset in 12 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-00 finished in 1491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (p1||X(p0))))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 382 transition count 370
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 377 transition count 365
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 377 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 376 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 376 transition count 364
Applied a total of 36 rules in 62 ms. Remains 376 /393 variables (removed 17) and now considering 364/383 (removed 19) transitions.
// Phase 1: matrix 364 rows 376 cols
[2023-03-12 13:36:09] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-12 13:36:09] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-12 13:36:09] [INFO ] Invariant cache hit.
[2023-03-12 13:36:09] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-12 13:36:09] [INFO ] Invariant cache hit.
[2023-03-12 13:36:10] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 376/393 places, 364/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1034 ms. Remains : 376/393 places, 364/383 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s320 1), p1:(EQ s129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-01 finished in 1229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 392 transition count 246
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 154 rules applied. Total rules applied 290 place count 256 transition count 228
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 300 place count 246 transition count 228
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 300 place count 246 transition count 181
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 394 place count 199 transition count 181
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 403 place count 190 transition count 172
Iterating global reduction 3 with 9 rules applied. Total rules applied 412 place count 190 transition count 172
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 412 place count 190 transition count 168
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 420 place count 186 transition count 168
Performed 72 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 564 place count 114 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 565 place count 113 transition count 86
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 13 rules applied. Total rules applied 578 place count 104 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 582 place count 100 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 582 place count 100 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 592 place count 95 transition count 77
Applied a total of 592 rules in 34 ms. Remains 95 /393 variables (removed 298) and now considering 77/383 (removed 306) transitions.
// Phase 1: matrix 77 rows 95 cols
[2023-03-12 13:36:10] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-12 13:36:10] [INFO ] Implicit Places using invariants in 180 ms returned [38, 55, 72, 76, 80, 84, 88, 94]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 184 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/393 places, 77/383 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 71
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 80 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 79 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 78 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 78 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 77 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 76 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 76 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 75 transition count 65
Applied a total of 24 rules in 10 ms. Remains 75 /87 variables (removed 12) and now considering 65/77 (removed 12) transitions.
// Phase 1: matrix 65 rows 75 cols
[2023-03-12 13:36:10] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-12 13:36:11] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-12 13:36:11] [INFO ] Invariant cache hit.
[2023-03-12 13:36:11] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/393 places, 65/383 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 510 ms. Remains : 75/393 places, 65/383 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s35 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 16 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-02 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(G(p1))) U X(X(G(p2)))))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 383 transition count 373
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 383 transition count 373
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 383 transition count 371
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 379 transition count 367
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 379 transition count 367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 378 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 378 transition count 366
Applied a total of 32 rules in 65 ms. Remains 378 /393 variables (removed 15) and now considering 366/383 (removed 17) transitions.
// Phase 1: matrix 366 rows 378 cols
[2023-03-12 13:36:11] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-12 13:36:11] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-12 13:36:11] [INFO ] Invariant cache hit.
[2023-03-12 13:36:12] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2023-03-12 13:36:12] [INFO ] Invariant cache hit.
[2023-03-12 13:36:12] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 378/393 places, 366/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1052 ms. Remains : 378/393 places, 366/383 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), true, (NOT p2), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s27 1), p2:(EQ s93 1), p0:(NEQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 204 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-03 finished in 1401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 392 transition count 248
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 152 rules applied. Total rules applied 286 place count 258 transition count 230
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 297 place count 248 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 298 place count 247 transition count 229
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 298 place count 247 transition count 180
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 396 place count 198 transition count 180
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 405 place count 189 transition count 171
Iterating global reduction 4 with 9 rules applied. Total rules applied 414 place count 189 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 414 place count 189 transition count 168
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 420 place count 186 transition count 168
Performed 71 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 562 place count 115 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 563 place count 114 transition count 87
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 13 rules applied. Total rules applied 576 place count 105 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 580 place count 101 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 580 place count 101 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 590 place count 96 transition count 78
Applied a total of 590 rules in 67 ms. Remains 96 /393 variables (removed 297) and now considering 78/383 (removed 305) transitions.
// Phase 1: matrix 78 rows 96 cols
[2023-03-12 13:36:12] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-12 13:36:12] [INFO ] Implicit Places using invariants in 76 ms returned [38, 55, 73, 77, 81, 85, 89, 95]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 78 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/393 places, 78/383 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 72
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 81 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 80 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 78 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 78 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 77 transition count 67
Applied a total of 22 rules in 28 ms. Remains 77 /88 variables (removed 11) and now considering 67/78 (removed 11) transitions.
// Phase 1: matrix 67 rows 77 cols
[2023-03-12 13:36:12] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-12 13:36:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-12 13:36:12] [INFO ] Invariant cache hit.
[2023-03-12 13:36:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:36:13] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/393 places, 67/383 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 399 ms. Remains : 77/393 places, 67/383 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-04 finished in 515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(F(p1))) U (G((p0||X(F(p1))))||(!p0&&X(F(p1))))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 381 transition count 371
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 381 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 381 transition count 369
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 376 transition count 364
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 376 transition count 364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 375 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 375 transition count 363
Applied a total of 38 rules in 34 ms. Remains 375 /393 variables (removed 18) and now considering 363/383 (removed 20) transitions.
// Phase 1: matrix 363 rows 375 cols
[2023-03-12 13:36:13] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-12 13:36:13] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-12 13:36:13] [INFO ] Invariant cache hit.
[2023-03-12 13:36:13] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2023-03-12 13:36:13] [INFO ] Invariant cache hit.
[2023-03-12 13:36:14] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 375/393 places, 363/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 938 ms. Remains : 375/393 places, 363/383 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s54 1), p0:(EQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 300 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-05 finished in 1082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 381 transition count 371
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 381 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 381 transition count 369
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 376 transition count 364
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 376 transition count 364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 375 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 375 transition count 363
Applied a total of 38 rules in 28 ms. Remains 375 /393 variables (removed 18) and now considering 363/383 (removed 20) transitions.
[2023-03-12 13:36:14] [INFO ] Invariant cache hit.
[2023-03-12 13:36:14] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-12 13:36:14] [INFO ] Invariant cache hit.
[2023-03-12 13:36: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.
[2023-03-12 13:36:14] [INFO ] Invariant cache hit.
[2023-03-12 13:36:15] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 375/393 places, 363/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 882 ms. Remains : 375/393 places, 363/383 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-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:(EQ s250 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-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-06 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0)||(X(p1)&&F(!p0))) U p2)))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 382 transition count 370
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 378 transition count 366
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 378 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 377 transition count 365
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 377 transition count 365
Applied a total of 34 rules in 53 ms. Remains 377 /393 variables (removed 16) and now considering 365/383 (removed 18) transitions.
// Phase 1: matrix 365 rows 377 cols
[2023-03-12 13:36:15] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-12 13:36:15] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-12 13:36:15] [INFO ] Invariant cache hit.
[2023-03-12 13:36:15] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2023-03-12 13:36:16] [INFO ] Invariant cache hit.
[2023-03-12 13:36:16] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 377/393 places, 365/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 984 ms. Remains : 377/393 places, 365/383 transitions.
Stuttering acceptance computed with spot in 380 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s115 1), p0:(EQ s149 1), p1:(EQ s315 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]]
Product exploration explored 100000 steps with 404 reset in 313 ms.
Product exploration explored 100000 steps with 405 reset in 371 ms.
Computed a total of 92 stabilizing places and 92 stable transitions
Computed a total of 92 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), true, (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1316 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 13:36:19] [INFO ] Invariant cache hit.
[2023-03-12 13:36:19] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-12 13:36:19] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-12 13:36:19] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 13:36:19] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 1 ms to minimize.
[2023-03-12 13:36:20] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 1 ms to minimize.
[2023-03-12 13:36:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2023-03-12 13:36:20] [INFO ] After 520ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:36:20] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:36:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-12 13:36:20] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:36:21] [INFO ] After 879ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:36:22] [INFO ] Deduced a trap composed of 72 places in 1150 ms of which 36 ms to minimize.
[2023-03-12 13:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1204 ms
[2023-03-12 13:36:22] [INFO ] After 2237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-12 13:36:22] [INFO ] After 2628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 365/365 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 377 transition count 235
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 145 rules applied. Total rules applied 275 place count 247 transition count 220
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 285 place count 237 transition count 220
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 285 place count 237 transition count 173
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 379 place count 190 transition count 173
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 527 place count 116 transition count 89
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 547 place count 116 transition count 69
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 567 place count 96 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 568 place count 95 transition count 68
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 56 rules applied. Total rules applied 624 place count 72 transition count 35
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 657 place count 39 transition count 35
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 657 place count 39 transition count 23
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 681 place count 27 transition count 23
Applied a total of 681 rules in 23 ms. Remains 27 /377 variables (removed 350) and now considering 23/365 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 27/377 places, 23/365 transitions.
Finished random walk after 197 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), true, (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0), (F (AND (NOT p1) p0)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 1373 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 430 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 365/365 transitions.
Applied a total of 0 rules in 20 ms. Remains 377 /377 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2023-03-12 13:36:25] [INFO ] Invariant cache hit.
[2023-03-12 13:36:25] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-12 13:36:25] [INFO ] Invariant cache hit.
[2023-03-12 13:36:25] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2023-03-12 13:36:25] [INFO ] Invariant cache hit.
[2023-03-12 13:36:26] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1630 ms. Remains : 377/377 places, 365/365 transitions.
Computed a total of 92 stabilizing places and 92 stable transitions
Computed a total of 92 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1272 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 41 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 13:36:28] [INFO ] Invariant cache hit.
[2023-03-12 13:36:28] [INFO ] [Real]Absence check using 33 positive place invariants in 58 ms returned sat
[2023-03-12 13:36:28] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-12 13:36:29] [INFO ] After 889ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 13:36:29] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 0 ms to minimize.
[2023-03-12 13:36:30] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 1 ms to minimize.
[2023-03-12 13:36:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 443 ms
[2023-03-12 13:36:30] [INFO ] After 1356ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:36:30] [INFO ] After 1616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:36:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-12 13:36:30] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 13:36:30] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:36:30] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 13 ms to minimize.
[2023-03-12 13:36:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-12 13:36:30] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-12 13:36:30] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 2 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 365/365 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 377 transition count 235
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 145 rules applied. Total rules applied 275 place count 247 transition count 220
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 285 place count 237 transition count 220
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 285 place count 237 transition count 173
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 379 place count 190 transition count 173
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 527 place count 116 transition count 89
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 547 place count 116 transition count 69
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 567 place count 96 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 568 place count 95 transition count 68
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 56 rules applied. Total rules applied 624 place count 72 transition count 35
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 657 place count 39 transition count 35
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 657 place count 39 transition count 23
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 681 place count 27 transition count 23
Applied a total of 681 rules in 37 ms. Remains 27 /377 variables (removed 350) and now considering 23/365 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 27/377 places, 23/365 transitions.
Finished random walk after 239 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0), (F (AND (NOT p1) p0)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 1518 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 352 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 459 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Product exploration explored 100000 steps with 405 reset in 260 ms.
Product exploration explored 100000 steps with 405 reset in 192 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 371 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 377/377 places, 365/365 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 377 transition count 365
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 10 rules applied. Total rules applied 126 place count 377 transition count 360
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 126 place count 377 transition count 360
Deduced a syphon composed of 170 places in 1 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 175 place count 377 transition count 360
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 272 place count 280 transition count 263
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 369 place count 280 transition count 263
Performed 90 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 2 with 90 rules applied. Total rules applied 459 place count 280 transition count 253
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 516 place count 223 transition count 196
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 573 place count 223 transition count 196
Deduced a syphon composed of 106 places in 0 ms
Applied a total of 573 rules in 70 ms. Remains 223 /377 variables (removed 154) and now considering 196/365 (removed 169) transitions.
[2023-03-12 13:36:34] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 196 rows 223 cols
[2023-03-12 13:36:34] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-12 13:36:35] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 223/377 places, 196/365 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 359 ms. Remains : 223/377 places, 196/365 transitions.
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 365/365 transitions.
Applied a total of 0 rules in 8 ms. Remains 377 /377 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 377 cols
[2023-03-12 13:36:35] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-12 13:36:35] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-12 13:36:35] [INFO ] Invariant cache hit.
[2023-03-12 13:36:35] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2023-03-12 13:36:35] [INFO ] Invariant cache hit.
[2023-03-12 13:36:35] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 801 ms. Remains : 377/377 places, 365/365 transitions.
Treatment of property AutoFlight-PT-05b-LTLFireability-07 finished in 20730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 382 transition count 370
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 378 transition count 366
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 378 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 377 transition count 365
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 377 transition count 365
Applied a total of 34 rules in 43 ms. Remains 377 /393 variables (removed 16) and now considering 365/383 (removed 18) transitions.
// Phase 1: matrix 365 rows 377 cols
[2023-03-12 13:36:36] [INFO ] Computed 34 place invariants in 11 ms
[2023-03-12 13:36:36] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-12 13:36:36] [INFO ] Invariant cache hit.
[2023-03-12 13:36:36] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-12 13:36:36] [INFO ] Invariant cache hit.
[2023-03-12 13:36:36] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 377/393 places, 365/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 780 ms. Remains : 377/393 places, 365/383 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s81 1), p0:(EQ s248 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-08 finished in 1019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p0))||(p1&&F(p0)&&G(F(!p0))))))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 382 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 379 transition count 367
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 379 transition count 367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 378 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 378 transition count 366
Applied a total of 32 rules in 21 ms. Remains 378 /393 variables (removed 15) and now considering 366/383 (removed 17) transitions.
// Phase 1: matrix 366 rows 378 cols
[2023-03-12 13:36:37] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-12 13:36:37] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-12 13:36:37] [INFO ] Invariant cache hit.
[2023-03-12 13:36:37] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-12 13:36:37] [INFO ] Invariant cache hit.
[2023-03-12 13:36:37] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 378/393 places, 366/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 792 ms. Remains : 378/393 places, 366/383 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s87 1), p0:(NEQ s121 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 724 reset in 285 ms.
Product exploration explored 100000 steps with 724 reset in 237 ms.
Computed a total of 94 stabilizing places and 94 stable transitions
Computed a total of 94 stabilizing places and 94 stable transitions
Detected a total of 94/378 stabilizing places and 94/366 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 282 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 153 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 439 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 366/366 transitions.
Applied a total of 0 rules in 21 ms. Remains 378 /378 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2023-03-12 13:36:40] [INFO ] Invariant cache hit.
[2023-03-12 13:36:40] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-12 13:36:40] [INFO ] Invariant cache hit.
[2023-03-12 13:36:40] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2023-03-12 13:36:40] [INFO ] Invariant cache hit.
[2023-03-12 13:36:40] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 672 ms. Remains : 378/378 places, 366/366 transitions.
Computed a total of 94 stabilizing places and 94 stable transitions
Computed a total of 94 stabilizing places and 94 stable transitions
Detected a total of 94/378 stabilizing places and 94/366 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 325 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 108 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 468 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 722 reset in 189 ms.
Product exploration explored 100000 steps with 729 reset in 171 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 378/378 places, 366/366 transitions.
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 378 transition count 366
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 378 transition count 361
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 127 place count 378 transition count 361
Deduced a syphon composed of 173 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 178 place count 378 transition count 361
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 277 place count 279 transition count 262
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 99 rules applied. Total rules applied 376 place count 279 transition count 262
Performed 89 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 465 place count 279 transition count 252
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 522 place count 222 transition count 195
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 579 place count 222 transition count 195
Deduced a syphon composed of 106 places in 0 ms
Applied a total of 579 rules in 33 ms. Remains 222 /378 variables (removed 156) and now considering 195/366 (removed 171) transitions.
[2023-03-12 13:36:43] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 195 rows 222 cols
[2023-03-12 13:36:43] [INFO ] Computed 34 place invariants in 14 ms
[2023-03-12 13:36:43] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 222/378 places, 195/366 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 222/378 places, 195/366 transitions.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 366/366 transitions.
Applied a total of 0 rules in 5 ms. Remains 378 /378 variables (removed 0) and now considering 366/366 (removed 0) transitions.
// Phase 1: matrix 366 rows 378 cols
[2023-03-12 13:36:43] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-12 13:36:43] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-12 13:36:43] [INFO ] Invariant cache hit.
[2023-03-12 13:36:44] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-12 13:36:44] [INFO ] Invariant cache hit.
[2023-03-12 13:36:44] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 828 ms. Remains : 378/378 places, 366/366 transitions.
Treatment of property AutoFlight-PT-05b-LTLFireability-09 finished in 7346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X((G(p1)&&F(p2)))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 382 transition count 370
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 377 transition count 365
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 377 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 376 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 376 transition count 364
Applied a total of 36 rules in 33 ms. Remains 376 /393 variables (removed 17) and now considering 364/383 (removed 19) transitions.
// Phase 1: matrix 364 rows 376 cols
[2023-03-12 13:36:44] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-12 13:36:44] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-12 13:36:44] [INFO ] Invariant cache hit.
[2023-03-12 13:36:44] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-12 13:36:44] [INFO ] Invariant cache hit.
[2023-03-12 13:36:45] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 376/393 places, 364/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 376/393 places, 364/383 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s338 1) (EQ s107 1)), p1:(EQ s107 1), p2:(NEQ s338 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 85 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-12 finished in 1063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(G(p0)||X(G(p1))))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 382 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 382 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 382 transition count 371
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 377 transition count 366
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 377 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 376 transition count 365
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 376 transition count 365
Applied a total of 35 rules in 27 ms. Remains 376 /393 variables (removed 17) and now considering 365/383 (removed 18) transitions.
// Phase 1: matrix 365 rows 376 cols
[2023-03-12 13:36:45] [INFO ] Computed 34 place invariants in 24 ms
[2023-03-12 13:36:45] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-12 13:36:45] [INFO ] Invariant cache hit.
[2023-03-12 13:36:46] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2023-03-12 13:36:46] [INFO ] Invariant cache hit.
[2023-03-12 13:36:46] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 376/393 places, 365/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1272 ms. Remains : 376/393 places, 365/383 transitions.
Stuttering acceptance computed with spot in 295 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s302 0), p1:(EQ s107 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 92 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-13 finished in 1593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F(p1)))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 381 transition count 371
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 381 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 381 transition count 369
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 376 transition count 364
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 376 transition count 364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 375 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 375 transition count 363
Applied a total of 38 rules in 22 ms. Remains 375 /393 variables (removed 18) and now considering 363/383 (removed 20) transitions.
// Phase 1: matrix 363 rows 375 cols
[2023-03-12 13:36:47] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-12 13:36:47] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-12 13:36:47] [INFO ] Invariant cache hit.
[2023-03-12 13:36:47] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2023-03-12 13:36:47] [INFO ] Invariant cache hit.
[2023-03-12 13:36:47] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 375/393 places, 363/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 803 ms. Remains : 375/393 places, 363/383 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-14 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=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s208 1), p0:(EQ s17 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 768 reset in 205 ms.
Product exploration explored 100000 steps with 798 reset in 180 ms.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Detected a total of 91/375 stabilizing places and 91/363 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 410 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 139 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p1) p0), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 534 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 13:36:50] [INFO ] Invariant cache hit.
[2023-03-12 13:36:50] [INFO ] [Real]Absence check using 33 positive place invariants in 115 ms returned sat
[2023-03-12 13:36:50] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:36:51] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2023-03-12 13:36:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:36:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-12 13:36:52] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:36:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:36:52] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2023-03-12 13:36:52] [INFO ] Computed and/alt/rep : 362/517/362 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-12 13:36:55] [INFO ] Added : 278 causal constraints over 56 iterations in 2380 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 363/363 transitions.
Applied a total of 0 rules in 6 ms. Remains 375 /375 variables (removed 0) and now considering 363/363 (removed 0) transitions.
[2023-03-12 13:36:55] [INFO ] Invariant cache hit.
[2023-03-12 13:36:55] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-12 13:36:55] [INFO ] Invariant cache hit.
[2023-03-12 13:36:55] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-12 13:36:55] [INFO ] Invariant cache hit.
[2023-03-12 13:36:56] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 742 ms. Remains : 375/375 places, 363/363 transitions.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Detected a total of 91/375 stabilizing places and 91/363 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 107 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 408 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-12 13:36:57] [INFO ] Invariant cache hit.
[2023-03-12 13:36:58] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-12 13:36:58] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:36:58] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-12 13:36:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:36:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-12 13:36:58] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-12 13:36:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:36:58] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-12 13:36:58] [INFO ] Computed and/alt/rep : 362/517/362 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-12 13:37:01] [INFO ] Added : 278 causal constraints over 56 iterations in 2550 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 785 reset in 252 ms.
Product exploration explored 100000 steps with 824 reset in 187 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 363/363 transitions.
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 375 transition count 363
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 375 transition count 358
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 127 place count 375 transition count 358
Deduced a syphon composed of 173 places in 1 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 178 place count 375 transition count 358
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 277 place count 276 transition count 259
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 99 rules applied. Total rules applied 376 place count 276 transition count 259
Performed 86 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 2 with 86 rules applied. Total rules applied 462 place count 276 transition count 249
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 519 place count 219 transition count 192
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 576 place count 219 transition count 192
Deduced a syphon composed of 103 places in 0 ms
Applied a total of 576 rules in 75 ms. Remains 219 /375 variables (removed 156) and now considering 192/363 (removed 171) transitions.
[2023-03-12 13:37:02] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 192 rows 219 cols
[2023-03-12 13:37:02] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-12 13:37:03] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 219/375 places, 192/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 461 ms. Remains : 219/375 places, 192/363 transitions.
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 363/363 transitions.
Applied a total of 0 rules in 5 ms. Remains 375 /375 variables (removed 0) and now considering 363/363 (removed 0) transitions.
// Phase 1: matrix 363 rows 375 cols
[2023-03-12 13:37:03] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-12 13:37:03] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-12 13:37:03] [INFO ] Invariant cache hit.
[2023-03-12 13:37:03] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-12 13:37:03] [INFO ] Invariant cache hit.
[2023-03-12 13:37:03] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 722 ms. Remains : 375/375 places, 363/363 transitions.
Treatment of property AutoFlight-PT-05b-LTLFireability-14 finished in 16734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U G(p2))))))'
Support contains 2 out of 393 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 392 transition count 250
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 150 rules applied. Total rules applied 282 place count 260 transition count 232
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 293 place count 250 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 294 place count 249 transition count 231
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 294 place count 249 transition count 182
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 392 place count 200 transition count 182
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 400 place count 192 transition count 174
Iterating global reduction 4 with 8 rules applied. Total rules applied 408 place count 192 transition count 174
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 408 place count 192 transition count 171
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 414 place count 189 transition count 171
Performed 72 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 558 place count 117 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 559 place count 116 transition count 89
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 570 place count 108 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 573 place count 105 transition count 86
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 573 place count 105 transition count 82
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 581 place count 101 transition count 82
Applied a total of 581 rules in 21 ms. Remains 101 /393 variables (removed 292) and now considering 82/383 (removed 301) transitions.
// Phase 1: matrix 82 rows 101 cols
[2023-03-12 13:37:03] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-12 13:37:03] [INFO ] Implicit Places using invariants in 84 ms returned [42, 59, 76, 82, 86, 90, 94, 100]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 85 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/393 places, 82/383 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 87 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 87 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 86 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 86 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 85 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 85 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 84 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 84 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 83 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 83 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 82 transition count 71
Applied a total of 22 rules in 7 ms. Remains 82 /93 variables (removed 11) and now considering 71/82 (removed 11) transitions.
// Phase 1: matrix 71 rows 82 cols
[2023-03-12 13:37:03] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-12 13:37:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-12 13:37:04] [INFO ] Invariant cache hit.
[2023-03-12 13:37:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:37:04] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/393 places, 71/383 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 342 ms. Remains : 82/393 places, 71/383 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s35 1), p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 119 steps with 9 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-15 finished in 467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0)||(X(p1)&&F(!p0))) U p2)))'
Found a Lengthening insensitive property : AutoFlight-PT-05b-LTLFireability-07
Stuttering acceptance computed with spot in 308 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 392 transition count 248
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 152 rules applied. Total rules applied 286 place count 258 transition count 230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 296 place count 248 transition count 230
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 296 place count 248 transition count 183
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 390 place count 201 transition count 183
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 398 place count 193 transition count 175
Iterating global reduction 3 with 8 rules applied. Total rules applied 406 place count 193 transition count 175
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 406 place count 193 transition count 171
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 414 place count 189 transition count 171
Performed 71 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 556 place count 118 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 557 place count 117 transition count 90
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 567 place count 109 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 569 place count 107 transition count 88
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 569 place count 107 transition count 83
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 579 place count 102 transition count 83
Applied a total of 579 rules in 15 ms. Remains 102 /393 variables (removed 291) and now considering 83/383 (removed 300) transitions.
// Phase 1: matrix 83 rows 102 cols
[2023-03-12 13:37:04] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-12 13:37:04] [INFO ] Implicit Places using invariants in 76 ms returned [42, 59, 76, 81, 87, 91, 95, 101]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 87 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 94/393 places, 83/383 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 88 transition count 77
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 88 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 87 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 87 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 86 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 86 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 85 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 85 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 84 transition count 73
Applied a total of 20 rules in 5 ms. Remains 84 /94 variables (removed 10) and now considering 73/83 (removed 10) transitions.
// Phase 1: matrix 73 rows 84 cols
[2023-03-12 13:37:04] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-12 13:37:04] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-12 13:37:04] [INFO ] Invariant cache hit.
[2023-03-12 13:37:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:37:05] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 84/393 places, 73/383 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 329 ms. Remains : 84/393 places, 73/383 transitions.
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s27 1), p0:(EQ s39 1), p1:(EQ s74 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4234 reset in 141 ms.
Product exploration explored 100000 steps with 4203 reset in 226 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 1214 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 423 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 13:37:07] [INFO ] Invariant cache hit.
[2023-03-12 13:37:07] [INFO ] [Real]Absence check using 18 positive place invariants in 143 ms returned sat
[2023-03-12 13:37:07] [INFO ] After 99ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 13:37:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:37:07] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:37:07] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:37:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 113 ms returned sat
[2023-03-12 13:37:08] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:37:08] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 13:37:08] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-12 13:37:08] [INFO ] After 609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 73/73 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 82 transition count 71
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 31 place count 82 transition count 44
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t282.t276.t311.t277.t275.t31.t115.t372.t32 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 31 edges and 40 vertex of which 3 / 40 are part of one of the 1 SCC in 17 ms
Free SCC test removed 2 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 23 rules applied. Total rules applied 54 place count 38 transition count 22
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 78 place count 18 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 78 place count 18 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 82 place count 16 transition count 16
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 14 transition count 14
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 14 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 13 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 19 edges and 13 vertex of which 11 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 11 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 11 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 93 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 95 place count 9 transition count 9
Applied a total of 95 rules in 33 ms. Remains 9 /84 variables (removed 75) and now considering 9/73 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 9/84 places, 9/73 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0), (F (AND (NOT p1) p0)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 1540 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 407 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-12 13:37:10] [INFO ] Invariant cache hit.
[2023-03-12 13:37:11] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-12 13:37:11] [INFO ] Invariant cache hit.
[2023-03-12 13:37:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:37:11] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-12 13:37:11] [INFO ] Invariant cache hit.
[2023-03-12 13:37:11] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 84/84 places, 73/73 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 1116 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 418 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 13:37:13] [INFO ] Invariant cache hit.
[2023-03-12 13:37:13] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-12 13:37:13] [INFO ] After 247ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 13:37:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:37:13] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:37:13] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:37:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 72 ms returned sat
[2023-03-12 13:37:13] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:37:13] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 13:37:13] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-12 13:37:13] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 73/73 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 82 transition count 71
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 31 place count 82 transition count 44
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t282.t276.t311.t277.t275.t31.t115.t372.t32 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 31 edges and 40 vertex of which 3 / 40 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 23 rules applied. Total rules applied 54 place count 38 transition count 22
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 78 place count 18 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 78 place count 18 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 82 place count 16 transition count 16
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 14 transition count 14
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 14 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 13 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 19 edges and 13 vertex of which 11 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 11 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 11 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 93 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 95 place count 9 transition count 9
Applied a total of 95 rules in 5 ms. Remains 9 /84 variables (removed 75) and now considering 9/73 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 9/84 places, 9/73 transitions.
Finished random walk after 25 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0), (F (AND (NOT p1) p0)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 1418 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 341 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 419 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Product exploration explored 100000 steps with 4194 reset in 205 ms.
Product exploration explored 100000 steps with 4196 reset in 169 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 311 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-12 13:37:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 13:37:17] [INFO ] Invariant cache hit.
[2023-03-12 13:37:17] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 84/84 places, 73/73 transitions.
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 73/73 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-12 13:37:17] [INFO ] Invariant cache hit.
[2023-03-12 13:37:17] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 13:37:17] [INFO ] Invariant cache hit.
[2023-03-12 13:37:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:37:17] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-12 13:37:17] [INFO ] Invariant cache hit.
[2023-03-12 13:37:17] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 84/84 places, 73/73 transitions.
Treatment of property AutoFlight-PT-05b-LTLFireability-07 finished in 13351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p0))||(p1&&F(p0)&&G(F(!p0))))))))'
Found a Shortening insensitive property : AutoFlight-PT-05b-LTLFireability-09
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 392 transition count 246
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 154 rules applied. Total rules applied 290 place count 256 transition count 228
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 300 place count 246 transition count 228
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 300 place count 246 transition count 180
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 396 place count 198 transition count 180
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 404 place count 190 transition count 172
Iterating global reduction 3 with 8 rules applied. Total rules applied 412 place count 190 transition count 172
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 412 place count 190 transition count 168
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 420 place count 186 transition count 168
Performed 69 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 558 place count 117 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 116 transition count 89
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 13 rules applied. Total rules applied 572 place count 107 transition count 85
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 576 place count 103 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 576 place count 103 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 586 place count 98 transition count 80
Applied a total of 586 rules in 71 ms. Remains 98 /393 variables (removed 295) and now considering 80/383 (removed 303) transitions.
// Phase 1: matrix 80 rows 98 cols
[2023-03-12 13:37:18] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-12 13:37:18] [INFO ] Implicit Places using invariants in 142 ms returned [41, 58, 75, 79, 83, 87, 91, 97]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 143 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 90/393 places, 80/383 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 84 transition count 74
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 84 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 79 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 78 transition count 68
Applied a total of 24 rules in 5 ms. Remains 78 /90 variables (removed 12) and now considering 68/80 (removed 12) transitions.
// Phase 1: matrix 68 rows 78 cols
[2023-03-12 13:37:18] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-12 13:37:18] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-12 13:37:18] [INFO ] Invariant cache hit.
[2023-03-12 13:37:18] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 13:37:18] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 78/393 places, 68/383 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 593 ms. Remains : 78/393 places, 68/383 transitions.
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s19 1), p0:(NEQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12074 reset in 166 ms.
Product exploration explored 100000 steps with 12063 reset in 146 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/78 stabilizing places and 5/68 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 323 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 449 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-12 13:37:20] [INFO ] Invariant cache hit.
[2023-03-12 13:37:20] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 13:37:20] [INFO ] Invariant cache hit.
[2023-03-12 13:37:20] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 13:37:20] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-12 13:37:20] [INFO ] Invariant cache hit.
[2023-03-12 13:37:20] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 78/78 places, 68/68 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/78 stabilizing places and 5/68 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 301 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 525 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 311 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12073 reset in 158 ms.
Stack based approach found an accepted trace after 48219 steps with 5861 reset with depth 12 and stack size 12 in 167 ms.
Treatment of property AutoFlight-PT-05b-LTLFireability-09 finished in 5657 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F(p1)))))'
Found a Shortening insensitive property : AutoFlight-PT-05b-LTLFireability-14
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 393/393 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 392 transition count 245
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 155 rules applied. Total rules applied 292 place count 255 transition count 227
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 302 place count 245 transition count 227
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 302 place count 245 transition count 179
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 398 place count 197 transition count 179
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 407 place count 188 transition count 170
Iterating global reduction 3 with 9 rules applied. Total rules applied 416 place count 188 transition count 170
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 416 place count 188 transition count 166
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 424 place count 184 transition count 166
Performed 67 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 558 place count 117 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 116 transition count 89
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 13 rules applied. Total rules applied 572 place count 107 transition count 85
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 576 place count 103 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 576 place count 103 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 586 place count 98 transition count 80
Applied a total of 586 rules in 20 ms. Remains 98 /393 variables (removed 295) and now considering 80/383 (removed 303) transitions.
// Phase 1: matrix 80 rows 98 cols
[2023-03-12 13:37:23] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-12 13:37:24] [INFO ] Implicit Places using invariants in 463 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 464 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 97/393 places, 80/383 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 90 transition count 73
Applied a total of 14 rules in 12 ms. Remains 90 /97 variables (removed 7) and now considering 73/80 (removed 7) transitions.
// Phase 1: matrix 73 rows 90 cols
[2023-03-12 13:37:24] [INFO ] Computed 24 place invariants in 0 ms
[2023-03-12 13:37:24] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-12 13:37:24] [INFO ] Invariant cache hit.
[2023-03-12 13:37:24] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 13:37:24] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 90/393 places, 73/383 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 904 ms. Remains : 90/393 places, 73/383 transitions.
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-14 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=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s40 1), p0:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2683 steps with 131 reset in 3 ms.
Treatment of property AutoFlight-PT-05b-LTLFireability-14 finished in 1377 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-12 13:37:24] [INFO ] Flatten gal took : 27 ms
[2023-03-12 13:37:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 13:37:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 393 places, 383 transitions and 926 arcs took 37 ms.
Total runtime 86918 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2670/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2670/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2670/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-05b-LTLFireability-07
Could not compute solution for formula : AutoFlight-PT-05b-LTLFireability-09
Could not compute solution for formula : AutoFlight-PT-05b-LTLFireability-14

BK_STOP 1678628245811

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutoFlight-PT-05b-LTLFireability-07
ltl formula formula --ltl=/tmp/2670/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 393 places, 383 transitions and 926 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2670/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2670/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2670/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2670/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name AutoFlight-PT-05b-LTLFireability-09
ltl formula formula --ltl=/tmp/2670/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 393 places, 383 transitions and 926 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.040 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2670/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2670/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2670/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2670/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutoFlight-PT-05b-LTLFireability-14
ltl formula formula --ltl=/tmp/2670/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 393 places, 383 transitions and 926 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2670/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2670/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2670/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2670/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-05b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813597900444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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