Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 18:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 18:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 18:04 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.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 18:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 18:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 956K 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-48b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-48b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678634441484

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:20:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 15:20:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:20:44] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2023-03-12 15:20:44] [INFO ] Transformed 3950 places.
[2023-03-12 15:20:44] [INFO ] Transformed 3936 transitions.
[2023-03-12 15:20:44] [INFO ] Found NUPN structural information;
[2023-03-12 15:20:44] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA AutoFlight-PT-48b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 3950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Discarding 503 places :
Symmetric choice reduction at 0 with 503 rule applications. Total rules 503 place count 3447 transition count 3433
Iterating global reduction 0 with 503 rules applied. Total rules applied 1006 place count 3447 transition count 3433
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 1078 place count 3447 transition count 3361
Discarding 237 places :
Symmetric choice reduction at 1 with 237 rule applications. Total rules 1315 place count 3210 transition count 3124
Iterating global reduction 1 with 237 rules applied. Total rules applied 1552 place count 3210 transition count 3124
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 1588 place count 3174 transition count 3088
Iterating global reduction 1 with 36 rules applied. Total rules applied 1624 place count 3174 transition count 3088
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 1659 place count 3139 transition count 3053
Iterating global reduction 1 with 35 rules applied. Total rules applied 1694 place count 3139 transition count 3053
Applied a total of 1694 rules in 2427 ms. Remains 3139 /3950 variables (removed 811) and now considering 3053/3936 (removed 883) transitions.
// Phase 1: matrix 3053 rows 3139 cols
[2023-03-12 15:20:47] [INFO ] Computed 258 place invariants in 81 ms
[2023-03-12 15:20:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 15:20:48] [INFO ] Implicit Places using invariants in 1824 ms returned []
[2023-03-12 15:20:48] [INFO ] Invariant cache hit.
[2023-03-12 15:20:54] [INFO ] Implicit Places using invariants and state equation in 5343 ms returned []
Implicit Place search using SMT with State Equation took 7234 ms to find 0 implicit places.
[2023-03-12 15:20:54] [INFO ] Invariant cache hit.
[2023-03-12 15:20:57] [INFO ] Dead Transitions using invariants and state equation in 2946 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3139/3950 places, 3053/3936 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12626 ms. Remains : 3139/3950 places, 3053/3936 transitions.
Support contains 25 out of 3139 places after structural reductions.
[2023-03-12 15:20:57] [INFO ] Flatten gal took : 200 ms
[2023-03-12 15:20:57] [INFO ] Flatten gal took : 113 ms
[2023-03-12 15:20:58] [INFO ] Input system was already deterministic with 3053 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 21) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-12 15:20:59] [INFO ] Invariant cache hit.
[2023-03-12 15:21:00] [INFO ] After 1214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 15:21:02] [INFO ] [Nat]Absence check using 257 positive place invariants in 335 ms returned sat
[2023-03-12 15:21:02] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 21 ms returned sat
[2023-03-12 15:21:07] [INFO ] After 4005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-12 15:21:08] [INFO ] Deduced a trap composed of 69 places in 1268 ms of which 15 ms to minimize.
[2023-03-12 15:21:09] [INFO ] Deduced a trap composed of 97 places in 1241 ms of which 5 ms to minimize.
[2023-03-12 15:21:11] [INFO ] Deduced a trap composed of 227 places in 1241 ms of which 8 ms to minimize.
[2023-03-12 15:21:12] [INFO ] Deduced a trap composed of 142 places in 616 ms of which 1 ms to minimize.
[2023-03-12 15:21:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5164 ms
[2023-03-12 15:21:13] [INFO ] Deduced a trap composed of 67 places in 611 ms of which 1 ms to minimize.
[2023-03-12 15:21:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 976 ms
[2023-03-12 15:21:16] [INFO ] Deduced a trap composed of 241 places in 1299 ms of which 7 ms to minimize.
[2023-03-12 15:21:17] [INFO ] Deduced a trap composed of 241 places in 1335 ms of which 3 ms to minimize.
[2023-03-12 15:21:19] [INFO ] Deduced a trap composed of 241 places in 1453 ms of which 2 ms to minimize.
[2023-03-12 15:21:20] [INFO ] Deduced a trap composed of 241 places in 1260 ms of which 2 ms to minimize.
[2023-03-12 15:21:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 6215 ms
[2023-03-12 15:21:23] [INFO ] After 20079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1833 ms.
[2023-03-12 15:21:25] [INFO ] After 24584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 10 properties in 1050 ms.
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Drop transitions removed 1276 transitions
Trivial Post-agglo rules discarded 1276 transitions
Performed 1276 trivial Post agglomeration. Transition count delta: 1276
Iterating post reduction 0 with 1276 rules applied. Total rules applied 1276 place count 3139 transition count 1777
Reduce places removed 1276 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1421 rules applied. Total rules applied 2697 place count 1863 transition count 1632
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2793 place count 1767 transition count 1632
Performed 349 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 349 Pre rules applied. Total rules applied 2793 place count 1767 transition count 1283
Deduced a syphon composed of 349 places in 10 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 3 with 698 rules applied. Total rules applied 3491 place count 1418 transition count 1283
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 3496 place count 1413 transition count 1278
Iterating global reduction 3 with 5 rules applied. Total rules applied 3501 place count 1413 transition count 1278
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3501 place count 1413 transition count 1276
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3505 place count 1411 transition count 1276
Performed 568 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 568 places in 1 ms
Reduce places removed 568 places and 0 transitions.
Iterating global reduction 3 with 1136 rules applied. Total rules applied 4641 place count 843 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 144 times.
Iterating global reduction 3 with 144 rules applied. Total rules applied 4785 place count 843 transition count 493
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 4929 place count 699 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4930 place count 698 transition count 492
Reduce places removed 203 places and 0 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 4 with 534 rules applied. Total rules applied 5464 place count 495 transition count 161
Reduce places removed 331 places and 0 transitions.
Iterating post reduction 5 with 331 rules applied. Total rules applied 5795 place count 164 transition count 161
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 52 Pre rules applied. Total rules applied 5795 place count 164 transition count 109
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 6 with 104 rules applied. Total rules applied 5899 place count 112 transition count 109
Applied a total of 5899 rules in 912 ms. Remains 112 /3139 variables (removed 3027) and now considering 109/3053 (removed 2944) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 912 ms. Remains : 112/3139 places, 109/3053 transitions.
Finished random walk after 186 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=31 )
FORMULA AutoFlight-PT-48b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 797 stabilizing places and 797 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' '!(G(F(p0)))'
Support contains 1 out of 3139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1273 transitions
Trivial Post-agglo rules discarded 1273 transitions
Performed 1273 trivial Post agglomeration. Transition count delta: 1273
Iterating post reduction 0 with 1273 rules applied. Total rules applied 1273 place count 3138 transition count 1779
Reduce places removed 1273 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1418 rules applied. Total rules applied 2691 place count 1865 transition count 1634
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2787 place count 1769 transition count 1634
Performed 352 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 352 Pre rules applied. Total rules applied 2787 place count 1769 transition count 1282
Deduced a syphon composed of 352 places in 22 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 3 with 704 rules applied. Total rules applied 3491 place count 1417 transition count 1282
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3497 place count 1411 transition count 1276
Iterating global reduction 3 with 6 rules applied. Total rules applied 3503 place count 1411 transition count 1276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3503 place count 1411 transition count 1274
Deduced a syphon composed of 2 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3507 place count 1409 transition count 1274
Performed 567 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 567 places in 0 ms
Reduce places removed 567 places and 0 transitions.
Iterating global reduction 3 with 1134 rules applied. Total rules applied 4641 place count 842 transition count 636
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4642 place count 841 transition count 635
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 3 with 140 rules applied. Total rules applied 4782 place count 747 transition count 589
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 4828 place count 701 transition count 589
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4828 place count 701 transition count 541
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4924 place count 653 transition count 541
Applied a total of 4924 rules in 557 ms. Remains 653 /3139 variables (removed 2486) and now considering 541/3053 (removed 2512) transitions.
// Phase 1: matrix 541 rows 653 cols
[2023-03-12 15:21:28] [INFO ] Computed 164 place invariants in 9 ms
[2023-03-12 15:21:28] [INFO ] Implicit Places using invariants in 389 ms returned [257, 331, 369, 443, 481, 485, 489, 493, 497, 501, 505, 509, 513, 517, 521, 525, 529, 533, 537, 541, 545, 549, 553, 557, 561, 565, 569, 573, 577, 579, 582, 584, 587, 589, 591, 593, 595, 597, 599, 601, 603, 607, 611, 615, 619, 623, 627, 631, 635, 639, 643, 647, 652]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 396 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/3139 places, 541/3053 transitions.
Graph (trivial) has 248 edges and 600 vertex of which 11 / 600 are part of one of the 1 SCC in 8 ms
Free SCC test removed 10 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 42 place count 549 transition count 481
Iterating global reduction 0 with 41 rules applied. Total rules applied 83 place count 549 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 547 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 547 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 545 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 545 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 543 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 543 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 541 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 541 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 539 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 539 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 537 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 537 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 535 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 533 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 533 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 531 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 531 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 529 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 529 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 527 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 527 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 129 place count 525 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 131 place count 525 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 524 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 524 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 523 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 523 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 522 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 521 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 520 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 519 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 518 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 517 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 516 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 515 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 514 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 154 place count 513 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 155 place count 513 transition count 445
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 157 place count 512 transition count 444
Applied a total of 157 rules in 457 ms. Remains 512 /600 variables (removed 88) and now considering 444/541 (removed 97) transitions.
// Phase 1: matrix 444 rows 512 cols
[2023-03-12 15:21:29] [INFO ] Computed 111 place invariants in 6 ms
[2023-03-12 15:21:29] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-12 15:21:29] [INFO ] Invariant cache hit.
[2023-03-12 15:21:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:21:30] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/3139 places, 444/3053 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2353 ms. Remains : 512/3139 places, 444/3053 transitions.
Stuttering acceptance computed with spot in 337 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-00 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:(EQ s256 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 0 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-00 finished in 2839 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((G(p0)&&X((G(p1)||X(p2))))))'
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3131 transition count 3045
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3131 transition count 3045
Applied a total of 16 rules in 857 ms. Remains 3131 /3139 variables (removed 8) and now considering 3045/3053 (removed 8) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2023-03-12 15:21:31] [INFO ] Computed 258 place invariants in 50 ms
[2023-03-12 15:21:32] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2023-03-12 15:21:32] [INFO ] Invariant cache hit.
[2023-03-12 15:21:38] [INFO ] Implicit Places using invariants and state equation in 6129 ms returned []
Implicit Place search using SMT with State Equation took 7228 ms to find 0 implicit places.
[2023-03-12 15:21:38] [INFO ] Invariant cache hit.
[2023-03-12 15:21:40] [INFO ] Dead Transitions using invariants and state equation in 2117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3139 places, 3045/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10204 ms. Remains : 3131/3139 places, 3045/3053 transitions.
Stuttering acceptance computed with spot in 872 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=8 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=8 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=9 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s2044 0), p1:(EQ s1363 0), p2:(EQ s2458 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 116 reset in 615 ms.
Product exploration explored 100000 steps with 123 reset in 653 ms.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Detected a total of 791/3131 stabilizing places and 791/3045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1802 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 817 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 15:21:46] [INFO ] Invariant cache hit.
[2023-03-12 15:21:47] [INFO ] After 936ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 15:21:48] [INFO ] [Nat]Absence check using 257 positive place invariants in 263 ms returned sat
[2023-03-12 15:21:48] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-12 15:21:52] [INFO ] After 2912ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 15:21:53] [INFO ] Deduced a trap composed of 31 places in 1206 ms of which 3 ms to minimize.
[2023-03-12 15:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1586 ms
[2023-03-12 15:21:55] [INFO ] Deduced a trap composed of 141 places in 1126 ms of which 15 ms to minimize.
[2023-03-12 15:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1560 ms
[2023-03-12 15:21:57] [INFO ] Deduced a trap composed of 59 places in 1164 ms of which 2 ms to minimize.
[2023-03-12 15:21:58] [INFO ] Deduced a trap composed of 67 places in 1111 ms of which 2 ms to minimize.
[2023-03-12 15:21:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2807 ms
[2023-03-12 15:22:00] [INFO ] After 11257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1178 ms.
[2023-03-12 15:22:01] [INFO ] After 14486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 1504 steps, including 1 resets, run visited all 3 properties in 21 ms. (steps per millisecond=71 )
Parikh walk visited 8 properties in 226 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 18 factoid took 1728 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 749 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 840 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Applied a total of 0 rules in 307 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
[2023-03-12 15:22:05] [INFO ] Invariant cache hit.
[2023-03-12 15:22:07] [INFO ] Implicit Places using invariants in 1327 ms returned []
[2023-03-12 15:22:07] [INFO ] Invariant cache hit.
[2023-03-12 15:22:12] [INFO ] Implicit Places using invariants and state equation in 5016 ms returned []
Implicit Place search using SMT with State Equation took 6372 ms to find 0 implicit places.
[2023-03-12 15:22:12] [INFO ] Invariant cache hit.
[2023-03-12 15:22:14] [INFO ] Dead Transitions using invariants and state equation in 2797 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9489 ms. Remains : 3131/3131 places, 3045/3045 transitions.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Detected a total of 791/3131 stabilizing places and 791/3045 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1259 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 764 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 15:22:17] [INFO ] Invariant cache hit.
[2023-03-12 15:22:18] [INFO ] After 977ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 15:22:20] [INFO ] [Nat]Absence check using 257 positive place invariants in 358 ms returned sat
[2023-03-12 15:22:20] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-12 15:22:23] [INFO ] After 3135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 15:22:25] [INFO ] Deduced a trap composed of 31 places in 1306 ms of which 3 ms to minimize.
[2023-03-12 15:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1691 ms
[2023-03-12 15:22:26] [INFO ] Deduced a trap composed of 141 places in 1002 ms of which 1 ms to minimize.
[2023-03-12 15:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1382 ms
[2023-03-12 15:22:28] [INFO ] Deduced a trap composed of 59 places in 1252 ms of which 2 ms to minimize.
[2023-03-12 15:22:29] [INFO ] Deduced a trap composed of 67 places in 1057 ms of which 2 ms to minimize.
[2023-03-12 15:22:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2823 ms
[2023-03-12 15:22:32] [INFO ] After 11437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1266 ms.
[2023-03-12 15:22:33] [INFO ] After 14600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 1514 steps, including 1 resets, run visited all 3 properties in 20 ms. (steps per millisecond=75 )
Parikh walk visited 8 properties in 234 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 18 factoid took 1752 ms. Reduced automaton from 10 states, 42 edges and 3 AP (stutter sensitive) to 10 states, 42 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 826 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 805 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 775 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 143 reset in 594 ms.
Product exploration explored 100000 steps with 118 reset in 631 ms.
Support contains 3 out of 3131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3131/3131 places, 3045/3045 transitions.
Applied a total of 0 rules in 299 ms. Remains 3131 /3131 variables (removed 0) and now considering 3045/3045 (removed 0) transitions.
[2023-03-12 15:22:39] [INFO ] Invariant cache hit.
[2023-03-12 15:22:40] [INFO ] Implicit Places using invariants in 1281 ms returned []
[2023-03-12 15:22:41] [INFO ] Invariant cache hit.
[2023-03-12 15:22:47] [INFO ] Implicit Places using invariants and state equation in 6029 ms returned []
Implicit Place search using SMT with State Equation took 7319 ms to find 0 implicit places.
[2023-03-12 15:22:47] [INFO ] Invariant cache hit.
[2023-03-12 15:22:50] [INFO ] Dead Transitions using invariants and state equation in 3029 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10649 ms. Remains : 3131/3131 places, 3045/3045 transitions.
Treatment of property AutoFlight-PT-48b-LTLFireability-01 finished in 80012 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(G(p0)))'
Support contains 2 out of 3139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1275 transitions
Trivial Post-agglo rules discarded 1275 transitions
Performed 1275 trivial Post agglomeration. Transition count delta: 1275
Iterating post reduction 0 with 1275 rules applied. Total rules applied 1275 place count 3138 transition count 1777
Reduce places removed 1275 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1420 rules applied. Total rules applied 2695 place count 1863 transition count 1632
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2791 place count 1767 transition count 1632
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 351 Pre rules applied. Total rules applied 2791 place count 1767 transition count 1281
Deduced a syphon composed of 351 places in 7 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 3 with 702 rules applied. Total rules applied 3493 place count 1416 transition count 1281
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3499 place count 1410 transition count 1275
Iterating global reduction 3 with 6 rules applied. Total rules applied 3505 place count 1410 transition count 1275
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3505 place count 1410 transition count 1273
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3509 place count 1408 transition count 1273
Performed 567 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 567 places in 1 ms
Reduce places removed 567 places and 0 transitions.
Iterating global reduction 3 with 1134 rules applied. Total rules applied 4643 place count 841 transition count 635
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4644 place count 840 transition count 634
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 3 with 140 rules applied. Total rules applied 4784 place count 746 transition count 588
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 4830 place count 700 transition count 588
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 4830 place count 700 transition count 540
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 4926 place count 652 transition count 540
Applied a total of 4926 rules in 392 ms. Remains 652 /3139 variables (removed 2487) and now considering 540/3053 (removed 2513) transitions.
// Phase 1: matrix 540 rows 652 cols
[2023-03-12 15:22:50] [INFO ] Computed 164 place invariants in 11 ms
[2023-03-12 15:22:51] [INFO ] Implicit Places using invariants in 408 ms returned [256, 330, 368, 442, 480, 484, 488, 492, 496, 500, 504, 508, 512, 516, 520, 524, 528, 532, 536, 540, 544, 548, 552, 556, 560, 564, 568, 572, 576, 578, 581, 583, 585, 587, 589, 591, 593, 595, 598, 600, 602, 606, 610, 614, 618, 622, 626, 630, 634, 638, 642, 646, 651]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 409 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 599/3139 places, 540/3053 transitions.
Graph (trivial) has 247 edges and 599 vertex of which 11 / 599 are part of one of the 1 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 42 place count 548 transition count 480
Iterating global reduction 0 with 41 rules applied. Total rules applied 83 place count 548 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 546 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 546 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 544 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 544 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 93 place count 542 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 95 place count 542 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 540 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 540 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 538 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 538 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 536 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 536 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 534 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 532 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 530 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 530 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 528 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 528 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 125 place count 526 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 526 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 129 place count 524 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 131 place count 524 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 523 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 523 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 522 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 521 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 138 place count 520 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 519 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 142 place count 518 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 143 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 144 place count 517 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 146 place count 516 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 515 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 514 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 513 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 513 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 154 place count 512 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 155 place count 512 transition count 444
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 157 place count 511 transition count 443
Applied a total of 157 rules in 211 ms. Remains 511 /599 variables (removed 88) and now considering 443/540 (removed 97) transitions.
// Phase 1: matrix 443 rows 511 cols
[2023-03-12 15:22:51] [INFO ] Computed 111 place invariants in 5 ms
[2023-03-12 15:22:51] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-12 15:22:51] [INFO ] Invariant cache hit.
[2023-03-12 15:22:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:22:52] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 511/3139 places, 443/3053 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2088 ms. Remains : 511/3139 places, 443/3053 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s255 0) (EQ s485 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 861 reset in 639 ms.
Product exploration explored 100000 steps with 861 reset in 664 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 85 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Finished Best-First random walk after 375 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=187 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 244 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 443/443 transitions.
Applied a total of 0 rules in 26 ms. Remains 511 /511 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2023-03-12 15:22:54] [INFO ] Invariant cache hit.
[2023-03-12 15:22:54] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-12 15:22:54] [INFO ] Invariant cache hit.
[2023-03-12 15:22:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:22:55] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2023-03-12 15:22:55] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-12 15:22:55] [INFO ] Invariant cache hit.
[2023-03-12 15:22:56] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1504 ms. Remains : 511/511 places, 443/443 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 292 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=41 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Product exploration explored 100000 steps with 855 reset in 605 ms.
Product exploration explored 100000 steps with 863 reset in 611 ms.
Support contains 2 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 443/443 transitions.
Applied a total of 0 rules in 11 ms. Remains 511 /511 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2023-03-12 15:22:58] [INFO ] Invariant cache hit.
[2023-03-12 15:22:58] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-12 15:22:58] [INFO ] Invariant cache hit.
[2023-03-12 15:22:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:22:59] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2023-03-12 15:22:59] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-12 15:22:59] [INFO ] Invariant cache hit.
[2023-03-12 15:22:59] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1466 ms. Remains : 511/511 places, 443/443 transitions.
Treatment of property AutoFlight-PT-48b-LTLFireability-03 finished in 9220 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)&&X(G(p1)))))'
Support contains 2 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3132 transition count 3046
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3132 transition count 3046
Applied a total of 14 rules in 879 ms. Remains 3132 /3139 variables (removed 7) and now considering 3046/3053 (removed 7) transitions.
// Phase 1: matrix 3046 rows 3132 cols
[2023-03-12 15:23:00] [INFO ] Computed 258 place invariants in 39 ms
[2023-03-12 15:23:01] [INFO ] Implicit Places using invariants in 1373 ms returned []
[2023-03-12 15:23:01] [INFO ] Invariant cache hit.
[2023-03-12 15:23:07] [INFO ] Implicit Places using invariants and state equation in 5424 ms returned []
Implicit Place search using SMT with State Equation took 6819 ms to find 0 implicit places.
[2023-03-12 15:23:07] [INFO ] Invariant cache hit.
[2023-03-12 15:23:09] [INFO ] Dead Transitions using invariants and state equation in 2534 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3132/3139 places, 3046/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10237 ms. Remains : 3132/3139 places, 3046/3053 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-48b-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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s365 1), p1:(EQ s950 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, 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-48b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-06 finished in 10508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&F(p2)))))'
Support contains 4 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3131 transition count 3045
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3131 transition count 3045
Applied a total of 16 rules in 887 ms. Remains 3131 /3139 variables (removed 8) and now considering 3045/3053 (removed 8) transitions.
// Phase 1: matrix 3045 rows 3131 cols
[2023-03-12 15:23:11] [INFO ] Computed 258 place invariants in 29 ms
[2023-03-12 15:23:12] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2023-03-12 15:23:12] [INFO ] Invariant cache hit.
[2023-03-12 15:23:17] [INFO ] Implicit Places using invariants and state equation in 5322 ms returned []
Implicit Place search using SMT with State Equation took 6625 ms to find 0 implicit places.
[2023-03-12 15:23:17] [INFO ] Invariant cache hit.
[2023-03-12 15:23:20] [INFO ] Dead Transitions using invariants and state equation in 2440 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3131/3139 places, 3045/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9968 ms. Remains : 3131/3139 places, 3045/3053 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s3031 1), p1:(EQ s48 1), p2:(AND (EQ s2488 1) (EQ s3129 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1858 steps with 0 reset in 20 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-07 finished in 10340 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(X((F(X(!(p0 U p1)))||!(p1 U X((p1 U p2)))))))'
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3133 transition count 3047
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3133 transition count 3047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3132 transition count 3046
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3132 transition count 3046
Applied a total of 14 rules in 935 ms. Remains 3132 /3139 variables (removed 7) and now considering 3046/3053 (removed 7) transitions.
// Phase 1: matrix 3046 rows 3132 cols
[2023-03-12 15:23:21] [INFO ] Computed 258 place invariants in 15 ms
[2023-03-12 15:23:22] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2023-03-12 15:23:22] [INFO ] Invariant cache hit.
[2023-03-12 15:23:27] [INFO ] Implicit Places using invariants and state equation in 5029 ms returned []
Implicit Place search using SMT with State Equation took 6171 ms to find 0 implicit places.
[2023-03-12 15:23:27] [INFO ] Invariant cache hit.
[2023-03-12 15:23:30] [INFO ] Dead Transitions using invariants and state equation in 2891 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3132/3139 places, 3046/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10000 ms. Remains : 3132/3139 places, 3046/3053 transitions.
Stuttering acceptance computed with spot in 313 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), false]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={1, 2} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1, 2} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1967 1), p2:(EQ s524 1), p0:(EQ s1125 1)], nbAcceptance=3, 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 33333 reset in 1591 ms.
Product exploration explored 100000 steps with 33333 reset in 1570 ms.
Computed a total of 791 stabilizing places and 791 stable transitions
Computed a total of 791 stabilizing places and 791 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p2) (NOT p0))
Knowledge based reduction with 6 factoid took 311 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLFireability-10 finished in 13989 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) U G((p0 U p1))))'
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3132 transition count 3046
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3132 transition count 3046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 3130 transition count 3044
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 3130 transition count 3044
Applied a total of 18 rules in 927 ms. Remains 3130 /3139 variables (removed 9) and now considering 3044/3053 (removed 9) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2023-03-12 15:23:35] [INFO ] Computed 258 place invariants in 42 ms
[2023-03-12 15:23:36] [INFO ] Implicit Places using invariants in 1144 ms returned []
[2023-03-12 15:23:36] [INFO ] Invariant cache hit.
[2023-03-12 15:23:42] [INFO ] Implicit Places using invariants and state equation in 5748 ms returned []
Implicit Place search using SMT with State Equation took 6896 ms to find 0 implicit places.
[2023-03-12 15:23:42] [INFO ] Invariant cache hit.
[2023-03-12 15:23:45] [INFO ] Dead Transitions using invariants and state equation in 3015 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3139 places, 3044/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10839 ms. Remains : 3130/3139 places, 3044/3053 transitions.
Stuttering acceptance computed with spot in 448 ms :[(NOT p1), p0, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s250 1), p0:(AND (EQ s2831 1) (EQ s3126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33363 reset in 1598 ms.
Product exploration explored 100000 steps with 33466 reset in 1621 ms.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 825 ms. Reduced automaton from 8 states, 18 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 15:23:50] [INFO ] Invariant cache hit.
[2023-03-12 15:23:51] [INFO ] [Real]Absence check using 257 positive place invariants in 197 ms returned sat
[2023-03-12 15:23:51] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-12 15:23:51] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:23:52] [INFO ] [Nat]Absence check using 257 positive place invariants in 391 ms returned sat
[2023-03-12 15:23:52] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-12 15:23:54] [INFO ] After 2314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:23:56] [INFO ] Deduced a trap composed of 37 places in 1317 ms of which 2 ms to minimize.
[2023-03-12 15:23:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1669 ms
[2023-03-12 15:23:56] [INFO ] After 4437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 411 ms.
[2023-03-12 15:23:57] [INFO ] After 5982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 155 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=25 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p0), (F (OR p1 p0)), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 11 factoid took 787 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
[2023-03-12 15:23:58] [INFO ] Invariant cache hit.
[2023-03-12 15:24:00] [INFO ] [Real]Absence check using 257 positive place invariants in 501 ms returned sat
[2023-03-12 15:24:00] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 30 ms returned sat
[2023-03-12 15:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:24:13] [INFO ] [Real]Absence check using state equation in 12938 ms returned unknown
Could not prove EG (NOT p1)
Support contains 3 out of 3130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3130/3130 places, 3044/3044 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1269 transitions
Trivial Post-agglo rules discarded 1269 transitions
Performed 1269 trivial Post agglomeration. Transition count delta: 1269
Iterating post reduction 0 with 1269 rules applied. Total rules applied 1269 place count 3129 transition count 1774
Reduce places removed 1269 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1413 rules applied. Total rules applied 2682 place count 1860 transition count 1630
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2779 place count 1764 transition count 1629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2780 place count 1763 transition count 1629
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 350 Pre rules applied. Total rules applied 2780 place count 1763 transition count 1279
Deduced a syphon composed of 350 places in 6 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 4 with 700 rules applied. Total rules applied 3480 place count 1413 transition count 1279
Performed 570 Post agglomeration using F-continuation condition with reduction of 72 identical transitions.
Deduced a syphon composed of 570 places in 0 ms
Reduce places removed 570 places and 0 transitions.
Iterating global reduction 4 with 1140 rules applied. Total rules applied 4620 place count 843 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4621 place count 842 transition count 636
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 4 with 144 rules applied. Total rules applied 4765 place count 746 transition count 588
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 4813 place count 698 transition count 588
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 4813 place count 698 transition count 540
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 4909 place count 650 transition count 540
Applied a total of 4909 rules in 349 ms. Remains 650 /3130 variables (removed 2480) and now considering 540/3044 (removed 2504) transitions.
// Phase 1: matrix 540 rows 650 cols
[2023-03-12 15:24:14] [INFO ] Computed 162 place invariants in 2 ms
[2023-03-12 15:24:14] [INFO ] Implicit Places using invariants in 613 ms returned [254, 328, 366, 440, 478, 482, 486, 490, 494, 498, 502, 506, 510, 514, 518, 522, 526, 530, 534, 538, 542, 546, 550, 554, 558, 562, 566, 570, 574, 576, 578, 580, 582, 587, 589, 591, 593, 595, 597, 599, 603, 607, 611, 615, 619, 623, 627, 631, 635, 639, 643, 649]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 618 ms to find 52 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 598/3130 places, 540/3044 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 598 transition count 528
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 34 place count 586 transition count 518
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 73 place count 547 transition count 479
Iterating global reduction 2 with 39 rules applied. Total rules applied 112 place count 547 transition count 479
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 545 transition count 477
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 545 transition count 477
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 543 transition count 475
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 543 transition count 475
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 541 transition count 473
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 541 transition count 473
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 539 transition count 471
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 539 transition count 471
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 537 transition count 469
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 537 transition count 469
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 535 transition count 467
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 533 transition count 465
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 533 transition count 465
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 142 place count 531 transition count 463
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 531 transition count 463
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 529 transition count 461
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 529 transition count 461
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 527 transition count 459
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 527 transition count 459
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 525 transition count 457
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 525 transition count 457
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 523 transition count 455
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 523 transition count 455
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 522 transition count 454
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 522 transition count 454
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 521 transition count 453
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 521 transition count 453
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 520 transition count 452
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 520 transition count 452
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 519 transition count 451
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 519 transition count 451
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 518 transition count 450
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 518 transition count 450
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 517 transition count 449
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 517 transition count 449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 516 transition count 448
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 516 transition count 448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 515 transition count 447
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 515 transition count 447
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 514 transition count 446
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 514 transition count 446
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 513 transition count 445
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 513 transition count 445
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 512 transition count 444
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 512 transition count 444
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 511 transition count 443
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 511 transition count 443
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 186 place count 510 transition count 442
Applied a total of 186 rules in 328 ms. Remains 510 /598 variables (removed 88) and now considering 442/540 (removed 98) transitions.
// Phase 1: matrix 442 rows 510 cols
[2023-03-12 15:24:15] [INFO ] Computed 110 place invariants in 4 ms
[2023-03-12 15:24:15] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-12 15:24:15] [INFO ] Invariant cache hit.
[2023-03-12 15:24:16] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1608 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 510/3130 places, 442/3044 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2903 ms. Remains : 510/3130 places, 442/3044 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true]
False Knowledge obtained : [(X (OR p1 p0)), (X (NOT (OR p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 768 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 3147 steps, including 25 resets, run visited all 5 properties in 42 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true]
False Knowledge obtained : [(X (OR p1 p0)), (X (NOT (OR p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F (AND p1 (NOT p0))), (F p0), (F (OR p1 p0)), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 830 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
[2023-03-12 15:24:19] [INFO ] Invariant cache hit.
[2023-03-12 15:24:19] [INFO ] [Real]Absence check using 110 positive place invariants in 52 ms returned sat
[2023-03-12 15:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:24:20] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2023-03-12 15:24:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:24:20] [INFO ] [Nat]Absence check using 110 positive place invariants in 73 ms returned sat
[2023-03-12 15:24:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:24:21] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2023-03-12 15:24:21] [INFO ] Computed and/alt/rep : 297/488/297 causal constraints (skipped 1 transitions) in 35 ms.
[2023-03-12 15:24:21] [INFO ] Added : 3 causal constraints over 2 iterations in 156 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 319 ms :[(NOT p1), p0, true, (NOT p1), (AND (NOT p1) (NOT p0))]
Entered a terminal (fully accepting) state of product in 6751 steps with 2046 reset in 78 ms.
FORMULA AutoFlight-PT-48b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-48b-LTLFireability-13 finished in 47923 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(p0)||X(F(p1))))'
Support contains 2 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3132 transition count 3046
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3132 transition count 3046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 3130 transition count 3044
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 3130 transition count 3044
Applied a total of 18 rules in 947 ms. Remains 3130 /3139 variables (removed 9) and now considering 3044/3053 (removed 9) transitions.
// Phase 1: matrix 3044 rows 3130 cols
[2023-03-12 15:24:23] [INFO ] Computed 258 place invariants in 28 ms
[2023-03-12 15:24:24] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2023-03-12 15:24:24] [INFO ] Invariant cache hit.
[2023-03-12 15:24:30] [INFO ] Implicit Places using invariants and state equation in 5615 ms returned []
Implicit Place search using SMT with State Equation took 6895 ms to find 0 implicit places.
[2023-03-12 15:24:30] [INFO ] Invariant cache hit.
[2023-03-12 15:24:33] [INFO ] Dead Transitions using invariants and state equation in 3221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3130/3139 places, 3044/3053 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11067 ms. Remains : 3130/3139 places, 3044/3053 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-14 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: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s1699 1), p0:(EQ s2436 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2148 ms.
Product exploration explored 100000 steps with 50000 reset in 2087 ms.
Computed a total of 790 stabilizing places and 790 stable transitions
Computed a total of 790 stabilizing places and 790 stable transitions
Detected a total of 790/3130 stabilizing places and 790/3044 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 9 factoid took 350 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-48b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-48b-LTLFireability-14 finished in 15947 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((G(p0)&&X((G(p1)||X(p2))))))'
Found a Shortening insensitive property : AutoFlight-PT-48b-LTLFireability-01
Stuttering acceptance computed with spot in 842 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3139 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3139/3139 places, 3053/3053 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1272 transitions
Trivial Post-agglo rules discarded 1272 transitions
Performed 1272 trivial Post agglomeration. Transition count delta: 1272
Iterating post reduction 0 with 1272 rules applied. Total rules applied 1272 place count 3138 transition count 1780
Reduce places removed 1272 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1417 rules applied. Total rules applied 2689 place count 1866 transition count 1635
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 2786 place count 1770 transition count 1634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2787 place count 1769 transition count 1634
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 350 Pre rules applied. Total rules applied 2787 place count 1769 transition count 1284
Deduced a syphon composed of 350 places in 9 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 4 with 700 rules applied. Total rules applied 3487 place count 1419 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 3492 place count 1414 transition count 1279
Iterating global reduction 4 with 5 rules applied. Total rules applied 3497 place count 1414 transition count 1279
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3497 place count 1414 transition count 1277
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3501 place count 1412 transition count 1277
Performed 569 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 569 places in 0 ms
Reduce places removed 569 places and 0 transitions.
Iterating global reduction 4 with 1138 rules applied. Total rules applied 4639 place count 843 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4640 place count 842 transition count 636
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 4 with 142 rules applied. Total rules applied 4782 place count 747 transition count 589
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 4829 place count 700 transition count 589
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 4829 place count 700 transition count 541
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 4925 place count 652 transition count 541
Applied a total of 4925 rules in 403 ms. Remains 652 /3139 variables (removed 2487) and now considering 541/3053 (removed 2512) transitions.
// Phase 1: matrix 541 rows 652 cols
[2023-03-12 15:24:39] [INFO ] Computed 163 place invariants in 3 ms
[2023-03-12 15:24:40] [INFO ] Implicit Places using invariants in 462 ms returned [254, 368, 442, 480, 484, 488, 492, 496, 500, 504, 509, 513, 517, 521, 525, 529, 533, 537, 541, 545, 549, 553, 557, 561, 565, 569, 573, 577, 579, 582, 584, 586, 588, 590, 592, 594, 596, 598, 600, 602, 606, 610, 614, 618, 622, 626, 630, 634, 638, 642, 646, 651]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 472 ms to find 52 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 600/3139 places, 541/3053 transitions.
Graph (trivial) has 246 edges and 600 vertex of which 12 / 600 are part of one of the 1 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 589 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 588 transition count 519
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 41 place count 550 transition count 481
Iterating global reduction 2 with 38 rules applied. Total rules applied 79 place count 550 transition count 481
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 549 transition count 480
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 549 transition count 480
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 548 transition count 479
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 548 transition count 479
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 547 transition count 478
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 547 transition count 478
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 546 transition count 477
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 546 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 545 transition count 476
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 545 transition count 476
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 544 transition count 475
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 544 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 543 transition count 474
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 543 transition count 474
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 542 transition count 473
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 542 transition count 473
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 541 transition count 472
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 541 transition count 472
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 540 transition count 471
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 540 transition count 471
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 539 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 539 transition count 470
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 538 transition count 469
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 538 transition count 469
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 537 transition count 468
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 537 transition count 468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 536 transition count 467
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 536 transition count 467
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 535 transition count 466
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 535 transition count 466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 534 transition count 465
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 534 transition count 465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 533 transition count 464
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 533 transition count 464
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 532 transition count 463
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 532 transition count 463
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 531 transition count 462
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 531 transition count 462
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 530 transition count 461
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 530 transition count 461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 529 transition count 460
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 529 transition count 460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 528 transition count 459
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 528 transition count 459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 527 transition count 458
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 527 transition count 458
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 526 transition count 457
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 526 transition count 457
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 131 place count 524 transition count 455
Applied a total of 131 rules in 194 ms. Remains 524 /600 variables (removed 76) and now considering 455/541 (removed 86) transitions.
// Phase 1: matrix 455 rows 524 cols
[2023-03-12 15:24:40] [INFO ] Computed 111 place invariants in 5 ms
[2023-03-12 15:24:40] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-12 15:24:40] [INFO ] Invariant cache hit.
[2023-03-12 15:24:41] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 524/3139 places, 455/3053 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2032 ms. Remains : 524/3139 places, 455/3053 transitions.
Running random walk in product with property : AutoFlight-PT-48b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=8 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=8 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=9 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s364 0), p1:(EQ s253 0), p2:(EQ s461 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 355 steps with 11 reset in 2 ms.
Treatment of property AutoFlight-PT-48b-LTLFireability-01 finished in 3053 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' '!(F(G(p0)))'
[2023-03-12 15:24:41] [INFO ] Flatten gal took : 86 ms
[2023-03-12 15:24:41] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 15:24:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3139 places, 3053 transitions and 7338 arcs took 23 ms.
Total runtime 237779 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1925/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1925/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-48b-LTLFireability-01
Could not compute solution for formula : AutoFlight-PT-48b-LTLFireability-03

BK_STOP 1678634686156

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name AutoFlight-PT-48b-LTLFireability-03
ltl formula formula --ltl=/tmp/1925/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3139 places, 3053 transitions and 7338 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.190 user 0.370 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1925/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1925/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1925/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1925/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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