Execution Chart

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

Trace from the execution

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

--------------------
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 1678348859816

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:01:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:01:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:01:02] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-09 08:01:02] [INFO ] Transformed 482 places.
[2023-03-09 08:01:02] [INFO ] Transformed 480 transitions.
[2023-03-09 08:01:02] [INFO ] Found NUPN structural information;
[2023-03-09 08:01:02] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 176 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 137 ms. Remains 393 /482 variables (removed 89) and now considering 383/480 (removed 97) transitions.
// Phase 1: matrix 383 rows 393 cols
[2023-03-09 08:01:02] [INFO ] Computed 34 place invariants in 24 ms
[2023-03-09 08:01:03] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-09 08:01:03] [INFO ] Invariant cache hit.
[2023-03-09 08:01:03] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2023-03-09 08:01:03] [INFO ] Invariant cache hit.
[2023-03-09 08:01:04] [INFO ] Dead Transitions using invariants and state equation in 505 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 1517 ms. Remains : 393/482 places, 383/480 transitions.
Support contains 31 out of 393 places after structural reductions.
[2023-03-09 08:01:04] [INFO ] Flatten gal took : 51 ms
[2023-03-09 08:01:04] [INFO ] Flatten gal took : 21 ms
[2023-03-09 08:01:04] [INFO ] Input system was already deterministic with 383 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 30) seen :25
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-09 08:01:05] [INFO ] Invariant cache hit.
[2023-03-09 08:01:05] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-09 08:01:05] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-09 08:01:05] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-09 08:01:05] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 6 ms to minimize.
[2023-03-09 08:01:05] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 0 ms to minimize.
[2023-03-09 08:01:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 267 ms
[2023-03-09 08:01:05] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 1 ms to minimize.
[2023-03-09 08:01:06] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 1 ms to minimize.
[2023-03-09 08:01:06] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 1 ms to minimize.
[2023-03-09 08:01:06] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 1 ms to minimize.
[2023-03-09 08:01:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 615 ms
[2023-03-09 08:01:06] [INFO ] After 1196ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 08:01:06] [INFO ] After 1344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 08:01:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-09 08:01:06] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-09 08:01:06] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 08:01:07] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 0 ms to minimize.
[2023-03-09 08:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-09 08:01:07] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 1 ms to minimize.
[2023-03-09 08:01:07] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 0 ms to minimize.
[2023-03-09 08:01:07] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2023-03-09 08:01:07] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 0 ms to minimize.
[2023-03-09 08:01:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 622 ms
[2023-03-09 08:01:07] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 1 ms to minimize.
[2023-03-09 08:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-09 08:01:08] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 1 ms to minimize.
[2023-03-09 08:01:08] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 1 ms to minimize.
[2023-03-09 08:01:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2023-03-09 08:01:08] [INFO ] After 1696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-09 08:01:08] [INFO ] After 2066ms 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 1 properties in 68 ms.
Support contains 4 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 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 399 place count 195 transition count 177
Iterating global reduction 3 with 5 rules applied. Total rules applied 404 place count 195 transition count 177
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 404 place count 195 transition count 175
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 408 place count 193 transition count 175
Performed 73 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 554 place count 120 transition count 93
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 574 place count 120 transition count 73
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 594 place count 100 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 595 place count 99 transition count 72
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 641 place count 78 transition count 47
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 666 place count 53 transition count 47
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 666 place count 53 transition count 35
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 690 place count 41 transition count 35
Applied a total of 690 rules in 71 ms. Remains 41 /393 variables (removed 352) and now considering 35/383 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 41/393 places, 35/383 transitions.
Finished random walk after 70 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=23 )
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 57 ms. Remains 377 /393 variables (removed 16) and now considering 366/383 (removed 17) transitions.
// Phase 1: matrix 366 rows 377 cols
[2023-03-09 08:01:09] [INFO ] Computed 34 place invariants in 9 ms
[2023-03-09 08:01:09] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-09 08:01:09] [INFO ] Invariant cache hit.
[2023-03-09 08:01:09] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2023-03-09 08:01:09] [INFO ] Invariant cache hit.
[2023-03-09 08:01:10] [INFO ] Dead Transitions using invariants and state equation in 296 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 911 ms. Remains : 377/393 places, 366/383 transitions.
Stuttering acceptance computed with spot in 561 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 245 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-00 finished in 1599 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 61 ms. Remains 376 /393 variables (removed 17) and now considering 364/383 (removed 19) transitions.
// Phase 1: matrix 364 rows 376 cols
[2023-03-09 08:01:10] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-09 08:01:11] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-09 08:01:11] [INFO ] Invariant cache hit.
[2023-03-09 08:01:11] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-03-09 08:01:11] [INFO ] Invariant cache hit.
[2023-03-09 08:01:11] [INFO ] Dead Transitions using invariants and state equation in 217 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 958 ms. Remains : 376/393 places, 364/383 transitions.
Stuttering acceptance computed with spot in 159 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 1145 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 47 ms. Remains 95 /393 variables (removed 298) and now considering 77/383 (removed 306) transitions.
// Phase 1: matrix 77 rows 95 cols
[2023-03-09 08:01:11] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-09 08:01:12] [INFO ] Implicit Places using invariants in 92 ms returned [38, 55, 72, 76, 80, 84, 88, 94]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 121 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 9 ms. Remains 75 /87 variables (removed 12) and now considering 65/77 (removed 12) transitions.
// Phase 1: matrix 65 rows 75 cols
[2023-03-09 08:01:12] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-09 08:01:12] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 08:01:12] [INFO ] Invariant cache hit.
[2023-03-09 08:01:12] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 191 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 388 ms. Remains : 75/393 places, 65/383 transitions.
Stuttering acceptance computed with spot in 26 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 442 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 50 ms. Remains 378 /393 variables (removed 15) and now considering 366/383 (removed 17) transitions.
// Phase 1: matrix 366 rows 378 cols
[2023-03-09 08:01:12] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-09 08:01:12] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-09 08:01:12] [INFO ] Invariant cache hit.
[2023-03-09 08:01:13] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2023-03-09 08:01:13] [INFO ] Invariant cache hit.
[2023-03-09 08:01:13] [INFO ] Dead Transitions using invariants and state equation in 254 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 925 ms. Remains : 378/393 places, 366/383 transitions.
Stuttering acceptance computed with spot in 239 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]]
Stuttering criterion allowed to conclude after 285 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 1203 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 56 ms. Remains 96 /393 variables (removed 297) and now considering 78/383 (removed 305) transitions.
// Phase 1: matrix 78 rows 96 cols
[2023-03-09 08:01:13] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-09 08:01:13] [INFO ] Implicit Places using invariants in 130 ms returned [38, 55, 73, 77, 81, 85, 89, 95]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 134 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 81 ms. Remains 77 /88 variables (removed 11) and now considering 67/78 (removed 11) transitions.
// Phase 1: matrix 67 rows 77 cols
[2023-03-09 08:01:13] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-09 08:01:13] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-09 08:01:13] [INFO ] Invariant cache hit.
[2023-03-09 08:01:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:01:14] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 229 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 500 ms. Remains : 77/393 places, 67/383 transitions.
Stuttering acceptance computed with spot in 84 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 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-04 finished in 617 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 38 ms. Remains 375 /393 variables (removed 18) and now considering 363/383 (removed 20) transitions.
// Phase 1: matrix 363 rows 375 cols
[2023-03-09 08:01:14] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-09 08:01:14] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-09 08:01:14] [INFO ] Invariant cache hit.
[2023-03-09 08:01:14] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-03-09 08:01:14] [INFO ] Invariant cache hit.
[2023-03-09 08:01:14] [INFO ] Dead Transitions using invariants and state equation in 199 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 664 ms. Remains : 375/393 places, 363/383 transitions.
Stuttering acceptance computed with spot in 58 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 261 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 751 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 33 ms. Remains 375 /393 variables (removed 18) and now considering 363/383 (removed 20) transitions.
[2023-03-09 08:01:14] [INFO ] Invariant cache hit.
[2023-03-09 08:01:15] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-09 08:01:15] [INFO ] Invariant cache hit.
[2023-03-09 08:01:15] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-09 08:01:15] [INFO ] Invariant cache hit.
[2023-03-09 08:01:15] [INFO ] Dead Transitions using invariants and state equation in 180 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 619 ms. Remains : 375/393 places, 363/383 transitions.
Stuttering acceptance computed with spot in 75 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 707 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 59 ms. Remains 377 /393 variables (removed 16) and now considering 365/383 (removed 18) transitions.
// Phase 1: matrix 365 rows 377 cols
[2023-03-09 08:01:15] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-09 08:01:15] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-09 08:01:15] [INFO ] Invariant cache hit.
[2023-03-09 08:01:16] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-03-09 08:01:16] [INFO ] Invariant cache hit.
[2023-03-09 08:01:16] [INFO ] Dead Transitions using invariants and state equation in 223 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 1152 ms. Remains : 377/393 places, 365/383 transitions.
Stuttering acceptance computed with spot in 292 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 405 reset in 350 ms.
Product exploration explored 100000 steps with 406 reset in 361 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 (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 947 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 316 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 244 ms. (steps per millisecond=40 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 08:01:19] [INFO ] Invariant cache hit.
[2023-03-09 08:01:19] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned sat
[2023-03-09 08:01:19] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-09 08:01:19] [INFO ] After 135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 08:01:19] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 1 ms to minimize.
[2023-03-09 08:01:20] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 0 ms to minimize.
[2023-03-09 08:01:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2023-03-09 08:01:20] [INFO ] After 503ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:01:20] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:01:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2023-03-09 08:01:20] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-09 08:01:20] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 08:01:20] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 1 ms to minimize.
[2023-03-09 08:01:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-09 08:01:20] [INFO ] After 515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-09 08:01:20] [INFO ] After 796ms 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 23 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 26 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 27 ms. Remains : 27/377 places, 23/365 transitions.
Finished random walk after 66 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 1269 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)]
Stuttering acceptance computed with spot in 372 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 12 ms. Remains 377 /377 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2023-03-09 08:01:23] [INFO ] Invariant cache hit.
[2023-03-09 08:01:23] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-09 08:01:23] [INFO ] Invariant cache hit.
[2023-03-09 08:01:23] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2023-03-09 08:01:23] [INFO ] Invariant cache hit.
[2023-03-09 08:01:23] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 846 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 632 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 207 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 08:01:24] [INFO ] Invariant cache hit.
[2023-03-09 08:01:24] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-09 08:01:24] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-09 08:01:25] [INFO ] After 97ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 08:01:25] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 1 ms to minimize.
[2023-03-09 08:01:25] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 0 ms to minimize.
[2023-03-09 08:01:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2023-03-09 08:01:25] [INFO ] After 350ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:01:25] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:01:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-09 08:01:25] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-09 08:01:25] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 08:01:25] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 14 ms to minimize.
[2023-03-09 08:01:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-09 08:01:25] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-09 08:01:25] [INFO ] After 529ms 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 36 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 24 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 24 ms. Remains : 27/377 places, 23/365 transitions.
Finished random walk after 300 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=150 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 1269 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 360 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 321 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)]
Product exploration explored 100000 steps with 404 reset in 227 ms.
Product exploration explored 100000 steps with 404 reset in 197 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 391 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 86 ms. Remains 223 /377 variables (removed 154) and now considering 196/365 (removed 169) transitions.
[2023-03-09 08:01:29] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 196 rows 223 cols
[2023-03-09 08:01:29] [INFO ] Computed 34 place invariants in 5 ms
[2023-03-09 08:01:29] [INFO ] Dead Transitions using invariants and state equation in 282 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 406 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 12 ms. Remains 377 /377 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 377 cols
[2023-03-09 08:01:29] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-09 08:01:29] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-09 08:01:29] [INFO ] Invariant cache hit.
[2023-03-09 08:01:30] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2023-03-09 08:01:30] [INFO ] Invariant cache hit.
[2023-03-09 08:01:30] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 892 ms. Remains : 377/377 places, 365/365 transitions.
Treatment of property AutoFlight-PT-05b-LTLFireability-07 finished in 15013 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 39 ms. Remains 377 /393 variables (removed 16) and now considering 365/383 (removed 18) transitions.
// Phase 1: matrix 365 rows 377 cols
[2023-03-09 08:01:30] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-09 08:01:30] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-09 08:01:30] [INFO ] Invariant cache hit.
[2023-03-09 08:01:31] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-09 08:01:31] [INFO ] Invariant cache hit.
[2023-03-09 08:01:31] [INFO ] Dead Transitions using invariants and state equation in 220 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 743 ms. Remains : 377/393 places, 365/383 transitions.
Stuttering acceptance computed with spot in 116 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 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-08 finished in 882 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 35 ms. Remains 378 /393 variables (removed 15) and now considering 366/383 (removed 17) transitions.
// Phase 1: matrix 366 rows 378 cols
[2023-03-09 08:01:31] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-09 08:01:31] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-09 08:01:31] [INFO ] Invariant cache hit.
[2023-03-09 08:01:33] [INFO ] Implicit Places using invariants and state equation in 1381 ms returned []
Implicit Place search using SMT with State Equation took 1580 ms to find 0 implicit places.
[2023-03-09 08:01:33] [INFO ] Invariant cache hit.
[2023-03-09 08:01:33] [INFO ] Dead Transitions using invariants and state equation in 197 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 1813 ms. Remains : 378/393 places, 366/383 transitions.
Stuttering acceptance computed with spot in 167 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 714 reset in 179 ms.
Product exploration explored 100000 steps with 719 reset in 243 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 337 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 268 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 137 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=45 )
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 318 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 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 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 11 ms. Remains 378 /378 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2023-03-09 08:01:35] [INFO ] Invariant cache hit.
[2023-03-09 08:01:35] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-09 08:01:35] [INFO ] Invariant cache hit.
[2023-03-09 08:01:36] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
[2023-03-09 08:01:36] [INFO ] Invariant cache hit.
[2023-03-09 08:01:36] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1347 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 254 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 156 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=39 )
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 333 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)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 723 reset in 171 ms.
Product exploration explored 100000 steps with 724 reset in 173 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 208 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 2 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 46 ms. Remains 222 /378 variables (removed 156) and now considering 195/366 (removed 171) transitions.
[2023-03-09 08:01:38] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 195 rows 222 cols
[2023-03-09 08:01:38] [INFO ] Computed 34 place invariants in 14 ms
[2023-03-09 08:01:38] [INFO ] Dead Transitions using invariants and state equation in 146 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 235 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-09 08:01:38] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-09 08:01:39] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-09 08:01:39] [INFO ] Invariant cache hit.
[2023-03-09 08:01:39] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-09 08:01:39] [INFO ] Invariant cache hit.
[2023-03-09 08:01:39] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 378/378 places, 366/366 transitions.
Treatment of property AutoFlight-PT-05b-LTLFireability-09 finished in 8010 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 22 ms. Remains 376 /393 variables (removed 17) and now considering 364/383 (removed 19) transitions.
// Phase 1: matrix 364 rows 376 cols
[2023-03-09 08:01:39] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-09 08:01:39] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-09 08:01:39] [INFO ] Invariant cache hit.
[2023-03-09 08:01:40] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2023-03-09 08:01:40] [INFO ] Invariant cache hit.
[2023-03-09 08:01:40] [INFO ] Dead Transitions using invariants and state equation in 217 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 1157 ms. Remains : 376/393 places, 364/383 transitions.
Stuttering acceptance computed with spot in 362 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 16 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-12 finished in 1538 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 53 ms. Remains 376 /393 variables (removed 17) and now considering 365/383 (removed 18) transitions.
// Phase 1: matrix 365 rows 376 cols
[2023-03-09 08:01:41] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-09 08:01:41] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-09 08:01:41] [INFO ] Invariant cache hit.
[2023-03-09 08:01:41] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-09 08:01:41] [INFO ] Invariant cache hit.
[2023-03-09 08:01:41] [INFO ] Dead Transitions using invariants and state equation in 188 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 671 ms. Remains : 376/393 places, 365/383 transitions.
Stuttering acceptance computed with spot in 134 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 82 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-13 finished in 835 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 36 ms. Remains 375 /393 variables (removed 18) and now considering 363/383 (removed 20) transitions.
// Phase 1: matrix 363 rows 375 cols
[2023-03-09 08:01:41] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-09 08:01:42] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-09 08:01:42] [INFO ] Invariant cache hit.
[2023-03-09 08:01:42] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-09 08:01:42] [INFO ] Invariant cache hit.
[2023-03-09 08:01:42] [INFO ] Dead Transitions using invariants and state equation in 183 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 570 ms. Remains : 375/393 places, 363/383 transitions.
Stuttering acceptance computed with spot in 187 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 755 reset in 139 ms.
Product exploration explored 100000 steps with 789 reset in 160 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 288 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 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 114 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=114 )
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 213 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 222 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 226 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-09 08:01:44] [INFO ] Invariant cache hit.
[2023-03-09 08:01:44] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2023-03-09 08:01:44] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:44] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2023-03-09 08:01:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:01:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-09 08:01:44] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:01:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:45] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-09 08:01:45] [INFO ] Computed and/alt/rep : 362/517/362 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-09 08:01:46] [INFO ] Added : 278 causal constraints over 56 iterations in 1866 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 9 ms. Remains 375 /375 variables (removed 0) and now considering 363/363 (removed 0) transitions.
[2023-03-09 08:01:46] [INFO ] Invariant cache hit.
[2023-03-09 08:01:47] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-09 08:01:47] [INFO ] Invariant cache hit.
[2023-03-09 08:01:47] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-09 08:01:47] [INFO ] Invariant cache hit.
[2023-03-09 08:01:47] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 683 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 131 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 223 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 144 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=20 )
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 170 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 259 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 295 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-09 08:01:48] [INFO ] Invariant cache hit.
[2023-03-09 08:01:48] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-09 08:01:48] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:49] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-09 08:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:01:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-09 08:01:49] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:01:49] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-09 08:01:49] [INFO ] Computed and/alt/rep : 362/517/362 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-09 08:01:51] [INFO ] Added : 278 causal constraints over 56 iterations in 2242 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 337 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 784 reset in 208 ms.
Product exploration explored 100000 steps with 752 reset in 216 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 269 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 0 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 1 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 38 ms. Remains 219 /375 variables (removed 156) and now considering 192/363 (removed 171) transitions.
[2023-03-09 08:01:52] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 192 rows 219 cols
[2023-03-09 08:01:52] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-09 08:01:53] [INFO ] Dead Transitions using invariants and state equation in 154 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 233 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-09 08:01:53] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-09 08:01:53] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-09 08:01:53] [INFO ] Invariant cache hit.
[2023-03-09 08:01:53] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-09 08:01:53] [INFO ] Invariant cache hit.
[2023-03-09 08:01:53] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 521 ms. Remains : 375/375 places, 363/363 transitions.
Treatment of property AutoFlight-PT-05b-LTLFireability-14 finished in 11680 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 25 ms. Remains 101 /393 variables (removed 292) and now considering 82/383 (removed 301) transitions.
// Phase 1: matrix 82 rows 101 cols
[2023-03-09 08:01:53] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-09 08:01:53] [INFO ] Implicit Places using invariants in 111 ms returned [42, 59, 76, 82, 86, 90, 94, 100]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 124 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 8 ms. Remains 82 /93 variables (removed 11) and now considering 71/82 (removed 11) transitions.
// Phase 1: matrix 71 rows 82 cols
[2023-03-09 08:01:53] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-09 08:01:53] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-09 08:01:53] [INFO ] Invariant cache hit.
[2023-03-09 08:01:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:01:53] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 183 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 340 ms. Remains : 82/393 places, 71/383 transitions.
Stuttering acceptance computed with spot in 52 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 19 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-15 finished in 404 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 142 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 0 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 0 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 36 ms. Remains 102 /393 variables (removed 291) and now considering 83/383 (removed 300) transitions.
// Phase 1: matrix 83 rows 102 cols
[2023-03-09 08:01:54] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-09 08:01:54] [INFO ] Implicit Places using invariants in 74 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 3 ms. Remains 84 /94 variables (removed 10) and now considering 73/83 (removed 10) transitions.
// Phase 1: matrix 73 rows 84 cols
[2023-03-09 08:01:54] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-09 08:01:54] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-09 08:01:54] [INFO ] Invariant cache hit.
[2023-03-09 08:01:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:01:54] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 167 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 293 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 4208 reset in 140 ms.
Product exploration explored 100000 steps with 4183 reset in 228 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 (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2))]
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 (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 9 factoid took 597 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 163 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 422 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 08:01:55] [INFO ] Invariant cache hit.
[2023-03-09 08:01:55] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-09 08:01:55] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 08:01:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:01:55] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:01:55] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:01:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-09 08:01:55] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 08:01:56] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 08:01:56] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 08:01:56] [INFO ] After 159ms 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 5 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 12 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 12 ms. Remains : 9/84 places, 9/73 transitions.
Finished random walk after 37 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2))]
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 (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 1108 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 242 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 272 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 0 ms. Remains 84 /84 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-09 08:01:57] [INFO ] Invariant cache hit.
[2023-03-09 08:01:57] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 08:01:57] [INFO ] Invariant cache hit.
[2023-03-09 08:01:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:01:57] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-09 08:01:57] [INFO ] Invariant cache hit.
[2023-03-09 08:01:57] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 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 (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
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 (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 9 factoid took 775 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 325 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 422 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 08:01:59] [INFO ] Invariant cache hit.
[2023-03-09 08:01:59] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-09 08:01:59] [INFO ] After 459ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 08:01:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:01:59] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:01:59] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:01:59] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-09 08:01:59] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 08:01:59] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 08:02:00] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 08:02:00] [INFO ] After 297ms 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 5 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 4 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 26 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
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 (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 779 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 168 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 376 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Product exploration explored 100000 steps with 4202 reset in 166 ms.
Product exploration explored 100000 steps with 4199 reset in 212 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 190 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 7 ms. Remains 84 /84 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-09 08:02:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 08:02:02] [INFO ] Invariant cache hit.
[2023-03-09 08:02:02] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 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-09 08:02:02] [INFO ] Invariant cache hit.
[2023-03-09 08:02:02] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-09 08:02:02] [INFO ] Invariant cache hit.
[2023-03-09 08:02:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:02:02] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-09 08:02:02] [INFO ] Invariant cache hit.
[2023-03-09 08:02:02] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 84/84 places, 73/73 transitions.
Treatment of property AutoFlight-PT-05b-LTLFireability-07 finished in 8660 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 137 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 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 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 15 ms. Remains 98 /393 variables (removed 295) and now considering 80/383 (removed 303) transitions.
// Phase 1: matrix 80 rows 98 cols
[2023-03-09 08:02:02] [INFO ] Computed 25 place invariants in 7 ms
[2023-03-09 08:02:03] [INFO ] Implicit Places using invariants in 173 ms returned [41, 58, 75, 79, 83, 87, 91, 97]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 188 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-09 08:02:03] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-09 08:02:03] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-09 08:02:03] [INFO ] Invariant cache hit.
[2023-03-09 08:02:03] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-09 08:02:03] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 267 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 475 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 12121 reset in 154 ms.
Stack based approach found an accepted trace after 9867 steps with 1133 reset with depth 17 and stack size 17 in 15 ms.
Treatment of property AutoFlight-PT-05b-LTLFireability-09 finished in 869 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 193 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 31 ms. Remains 98 /393 variables (removed 295) and now considering 80/383 (removed 303) transitions.
// Phase 1: matrix 80 rows 98 cols
[2023-03-09 08:02:03] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-09 08:02:03] [INFO ] Implicit Places using invariants in 133 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 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 2 ms. Remains 90 /97 variables (removed 7) and now considering 73/80 (removed 7) transitions.
// Phase 1: matrix 73 rows 90 cols
[2023-03-09 08:02:04] [INFO ] Computed 24 place invariants in 0 ms
[2023-03-09 08:02:04] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-09 08:02:04] [INFO ] Invariant cache hit.
[2023-03-09 08:02:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-09 08:02:04] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 197 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 378 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 633 steps with 33 reset in 1 ms.
Treatment of property AutoFlight-PT-05b-LTLFireability-14 finished in 688 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-09 08:02:04] [INFO ] Flatten gal took : 13 ms
[2023-03-09 08:02:04] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-09 08:02:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 393 places, 383 transitions and 926 arcs took 3 ms.
Total runtime 61912 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutoFlight-PT-05b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/364
LTLFireability

FORMULA AutoFlight-PT-05b-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678349019852

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/364/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/364/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/364/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 3 (type EXCL) for 0 AutoFlight-PT-05b-LTLFireability-07
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type EXCL) for AutoFlight-PT-05b-LTLFireability-07
lola: result : false
lola: markings : 885967
lola: fired transitions : 3433148
lola: time used : 4.000000
lola: memory pages used : 6
lola: LAUNCH task # 11 (type EXCL) for 10 AutoFlight-PT-05b-LTLFireability-14
lola: time limit : 1798 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 1/1798 2/32 AutoFlight-PT-05b-LTLFireability-14 152588 m, 30517 m/sec, 477444 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 6/1798 6/32 AutoFlight-PT-05b-LTLFireability-14 729558 m, 115394 m/sec, 2500230 t fired, .

Time elapsed: 10 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 11/1798 9/32 AutoFlight-PT-05b-LTLFireability-14 1229704 m, 100029 m/sec, 4468372 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 16/1798 13/32 AutoFlight-PT-05b-LTLFireability-14 1732918 m, 100642 m/sec, 6437836 t fired, .

Time elapsed: 20 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 21/1798 16/32 AutoFlight-PT-05b-LTLFireability-14 2191102 m, 91636 m/sec, 8391780 t fired, .

Time elapsed: 25 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 26/1798 19/32 AutoFlight-PT-05b-LTLFireability-14 2665533 m, 94886 m/sec, 10334579 t fired, .

Time elapsed: 30 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 31/1798 22/32 AutoFlight-PT-05b-LTLFireability-14 3149135 m, 96720 m/sec, 12283457 t fired, .

Time elapsed: 35 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 36/1798 25/32 AutoFlight-PT-05b-LTLFireability-14 3579733 m, 86119 m/sec, 14204993 t fired, .

Time elapsed: 40 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 41/1798 29/32 AutoFlight-PT-05b-LTLFireability-14 4076850 m, 99423 m/sec, 16164955 t fired, .

Time elapsed: 45 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 46/1798 32/32 AutoFlight-PT-05b-LTLFireability-14 4545256 m, 93681 m/sec, 18108641 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 11 (type EXCL) for AutoFlight-PT-05b-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 8 (type EXCL) for 7 AutoFlight-PT-05b-LTLFireability-09
lola: time limit : 3545 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/3545 5/32 AutoFlight-PT-05b-LTLFireability-09 590142 m, 118028 m/sec, 1898621 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/3545 9/32 AutoFlight-PT-05b-LTLFireability-09 1139605 m, 109892 m/sec, 3817325 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/3545 14/32 AutoFlight-PT-05b-LTLFireability-09 1685258 m, 109130 m/sec, 5711878 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/3545 18/32 AutoFlight-PT-05b-LTLFireability-09 2225000 m, 107948 m/sec, 7586384 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/3545 22/32 AutoFlight-PT-05b-LTLFireability-09 2773591 m, 109718 m/sec, 9491806 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/3545 26/32 AutoFlight-PT-05b-LTLFireability-09 3259688 m, 97219 m/sec, 11378281 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/3545 30/32 AutoFlight-PT-05b-LTLFireability-09 3720981 m, 92258 m/sec, 13218528 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 8 (type EXCL) for AutoFlight-PT-05b-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-05b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-05b-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-05b-LTLFireability-07: CONJ false LTL model checker
AutoFlight-PT-05b-LTLFireability-09: LTL unknown AGGR
AutoFlight-PT-05b-LTLFireability-14: LTL unknown AGGR


Time elapsed: 95 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is AutoFlight-PT-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 r007-oct2-167813595500444"
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 ;