Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 8.0K Apr 30 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 01:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 538K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652663387652

Running Version 202205111006
[2022-05-16 01:09:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 01:09:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:09:49] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2022-05-16 01:09:49] [INFO ] Transformed 2230 places.
[2022-05-16 01:09:49] [INFO ] Transformed 2228 transitions.
[2022-05-16 01:09:49] [INFO ] Found NUPN structural information;
[2022-05-16 01:09:49] [INFO ] Parsed PT model containing 2230 places and 2228 transitions in 312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutoFlight-PT-24b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules 302 place count 1928 transition count 1926
Iterating global reduction 0 with 302 rules applied. Total rules applied 604 place count 1928 transition count 1926
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 652 place count 1928 transition count 1878
Discarding 130 places :
Symmetric choice reduction at 1 with 130 rule applications. Total rules 782 place count 1798 transition count 1748
Iterating global reduction 1 with 130 rules applied. Total rules applied 912 place count 1798 transition count 1748
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 931 place count 1779 transition count 1729
Iterating global reduction 1 with 19 rules applied. Total rules applied 950 place count 1779 transition count 1729
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 969 place count 1760 transition count 1710
Iterating global reduction 1 with 19 rules applied. Total rules applied 988 place count 1760 transition count 1710
Applied a total of 988 rules in 1138 ms. Remains 1760 /2230 variables (removed 470) and now considering 1710/2228 (removed 518) transitions.
// Phase 1: matrix 1710 rows 1760 cols
[2022-05-16 01:09:50] [INFO ] Computed 148 place invariants in 57 ms
[2022-05-16 01:09:51] [INFO ] Implicit Places using invariants in 767 ms returned []
// Phase 1: matrix 1710 rows 1760 cols
[2022-05-16 01:09:51] [INFO ] Computed 148 place invariants in 26 ms
[2022-05-16 01:09:53] [INFO ] Implicit Places using invariants and state equation in 2285 ms returned []
Implicit Place search using SMT with State Equation took 3124 ms to find 0 implicit places.
// Phase 1: matrix 1710 rows 1760 cols
[2022-05-16 01:09:53] [INFO ] Computed 148 place invariants in 8 ms
[2022-05-16 01:09:54] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1760/2230 places, 1710/2228 transitions.
Finished structural reductions, in 1 iterations. Remains : 1760/2230 places, 1710/2228 transitions.
Support contains 33 out of 1760 places after structural reductions.
[2022-05-16 01:09:55] [INFO ] Flatten gal took : 139 ms
[2022-05-16 01:09:55] [INFO ] Flatten gal took : 65 ms
[2022-05-16 01:09:55] [INFO ] Input system was already deterministic with 1710 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 824 ms. (steps per millisecond=12 ) properties (out of 19) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) 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 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 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 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 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1710 rows 1760 cols
[2022-05-16 01:09:56] [INFO ] Computed 148 place invariants in 15 ms
[2022-05-16 01:09:57] [INFO ] [Real]Absence check using 147 positive place invariants in 130 ms returned sat
[2022-05-16 01:09:57] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2022-05-16 01:09:57] [INFO ] After 749ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-16 01:09:57] [INFO ] [Nat]Absence check using 147 positive place invariants in 100 ms returned sat
[2022-05-16 01:09:57] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-16 01:09:59] [INFO ] After 1559ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-05-16 01:10:00] [INFO ] Deduced a trap composed of 23 places in 577 ms of which 6 ms to minimize.
[2022-05-16 01:10:00] [INFO ] Deduced a trap composed of 232 places in 480 ms of which 2 ms to minimize.
[2022-05-16 01:10:01] [INFO ] Deduced a trap composed of 250 places in 535 ms of which 3 ms to minimize.
[2022-05-16 01:10:02] [INFO ] Deduced a trap composed of 61 places in 562 ms of which 2 ms to minimize.
[2022-05-16 01:10:02] [INFO ] Deduced a trap composed of 148 places in 523 ms of which 1 ms to minimize.
[2022-05-16 01:10:03] [INFO ] Deduced a trap composed of 159 places in 488 ms of which 2 ms to minimize.
[2022-05-16 01:10:03] [INFO ] Deduced a trap composed of 250 places in 471 ms of which 1 ms to minimize.
[2022-05-16 01:10:04] [INFO ] Deduced a trap composed of 116 places in 539 ms of which 2 ms to minimize.
[2022-05-16 01:10:04] [INFO ] Deduced a trap composed of 142 places in 421 ms of which 1 ms to minimize.
[2022-05-16 01:10:05] [INFO ] Deduced a trap composed of 281 places in 421 ms of which 1 ms to minimize.
[2022-05-16 01:10:06] [INFO ] Deduced a trap composed of 214 places in 495 ms of which 1 ms to minimize.
[2022-05-16 01:10:06] [INFO ] Deduced a trap composed of 215 places in 431 ms of which 1 ms to minimize.
[2022-05-16 01:10:07] [INFO ] Deduced a trap composed of 214 places in 419 ms of which 1 ms to minimize.
[2022-05-16 01:10:07] [INFO ] Deduced a trap composed of 214 places in 413 ms of which 3 ms to minimize.
[2022-05-16 01:10:08] [INFO ] Deduced a trap composed of 279 places in 443 ms of which 1 ms to minimize.
[2022-05-16 01:10:08] [INFO ] Deduced a trap composed of 188 places in 451 ms of which 1 ms to minimize.
[2022-05-16 01:10:09] [INFO ] Deduced a trap composed of 200 places in 487 ms of which 2 ms to minimize.
[2022-05-16 01:10:09] [INFO ] Deduced a trap composed of 131 places in 429 ms of which 2 ms to minimize.
[2022-05-16 01:10:10] [INFO ] Deduced a trap composed of 228 places in 471 ms of which 1 ms to minimize.
[2022-05-16 01:10:10] [INFO ] Deduced a trap composed of 214 places in 541 ms of which 1 ms to minimize.
[2022-05-16 01:10:11] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 11334 ms
[2022-05-16 01:10:11] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 1 ms to minimize.
[2022-05-16 01:10:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 522 ms
[2022-05-16 01:10:12] [INFO ] Deduced a trap composed of 325 places in 465 ms of which 2 ms to minimize.
[2022-05-16 01:10:12] [INFO ] Deduced a trap composed of 328 places in 519 ms of which 1 ms to minimize.
[2022-05-16 01:10:13] [INFO ] Deduced a trap composed of 323 places in 474 ms of which 1 ms to minimize.
[2022-05-16 01:10:13] [INFO ] Deduced a trap composed of 317 places in 439 ms of which 1 ms to minimize.
[2022-05-16 01:10:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2290 ms
[2022-05-16 01:10:14] [INFO ] Deduced a trap composed of 134 places in 413 ms of which 1 ms to minimize.
[2022-05-16 01:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 643 ms
[2022-05-16 01:10:15] [INFO ] Deduced a trap composed of 281 places in 481 ms of which 2 ms to minimize.
[2022-05-16 01:10:15] [INFO ] Deduced a trap composed of 281 places in 483 ms of which 1 ms to minimize.
[2022-05-16 01:10:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1318 ms
[2022-05-16 01:10:17] [INFO ] Deduced a trap composed of 153 places in 509 ms of which 2 ms to minimize.
[2022-05-16 01:10:17] [INFO ] Deduced a trap composed of 214 places in 468 ms of which 1 ms to minimize.
[2022-05-16 01:10:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1264 ms
[2022-05-16 01:10:17] [INFO ] After 19745ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 1025 ms.
[2022-05-16 01:10:18] [INFO ] After 21526ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 2 properties in 317 ms.
Support contains 11 out of 1760 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1760/1760 places, 1710/1710 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 1760 transition count 1080
Reduce places removed 630 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 696 rules applied. Total rules applied 1326 place count 1130 transition count 1014
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 45 rules applied. Total rules applied 1371 place count 1086 transition count 1013
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1372 place count 1085 transition count 1013
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 206 Pre rules applied. Total rules applied 1372 place count 1085 transition count 807
Deduced a syphon composed of 206 places in 3 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 4 with 412 rules applied. Total rules applied 1784 place count 879 transition count 807
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1789 place count 874 transition count 802
Iterating global reduction 4 with 5 rules applied. Total rules applied 1794 place count 874 transition count 802
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1794 place count 874 transition count 798
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1802 place count 870 transition count 798
Performed 342 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 4 with 684 rules applied. Total rules applied 2486 place count 528 transition count 408
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 2488 place count 528 transition count 406
Free-agglomeration rule applied 96 times.
Iterating global reduction 4 with 96 rules applied. Total rules applied 2584 place count 528 transition count 310
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 2680 place count 432 transition count 310
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2681 place count 431 transition count 309
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 5 with 277 rules applied. Total rules applied 2958 place count 321 transition count 142
Reduce places removed 167 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 170 rules applied. Total rules applied 3128 place count 154 transition count 139
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 3131 place count 151 transition count 139
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 43 Pre rules applied. Total rules applied 3131 place count 151 transition count 96
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 3217 place count 108 transition count 96
Applied a total of 3217 rules in 603 ms. Remains 108 /1760 variables (removed 1652) and now considering 96/1710 (removed 1614) transitions.
Finished structural reductions, in 1 iterations. Remains : 108/1760 places, 96/1710 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :4
Finished Best-First random walk after 350 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=175 )
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA AutoFlight-PT-24b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 443 stabilizing places and 443 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((X(p0)||F(p1)))))))'
Support contains 3 out of 1760 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1760/1760 places, 1710/1710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 636 transitions
Trivial Post-agglo rules discarded 636 transitions
Performed 636 trivial Post agglomeration. Transition count delta: 636
Iterating post reduction 0 with 636 rules applied. Total rules applied 636 place count 1759 transition count 1073
Reduce places removed 636 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 1 with 708 rules applied. Total rules applied 1344 place count 1123 transition count 1001
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1392 place count 1075 transition count 1001
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 1392 place count 1075 transition count 800
Deduced a syphon composed of 201 places in 5 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 1794 place count 874 transition count 800
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1803 place count 865 transition count 791
Iterating global reduction 3 with 9 rules applied. Total rules applied 1812 place count 865 transition count 791
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1812 place count 865 transition count 784
Deduced a syphon composed of 7 places in 27 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1826 place count 858 transition count 784
Performed 340 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 340 places in 1 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 2506 place count 518 transition count 397
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2507 place count 518 transition count 396
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 2508 place count 517 transition count 395
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 66 rules applied. Total rules applied 2574 place count 472 transition count 374
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 2595 place count 451 transition count 374
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2595 place count 451 transition count 350
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2643 place count 427 transition count 350
Applied a total of 2643 rules in 224 ms. Remains 427 /1760 variables (removed 1333) and now considering 350/1710 (removed 1360) transitions.
// Phase 1: matrix 350 rows 427 cols
[2022-05-16 01:10:20] [INFO ] Computed 103 place invariants in 2 ms
[2022-05-16 01:10:20] [INFO ] Implicit Places using invariants in 264 ms returned [178, 252, 326, 330, 334, 338, 342, 347, 351, 355, 359, 363, 368, 372, 376, 381, 385, 389, 393, 397, 401, 405, 409, 413, 417, 421, 426]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 267 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/1760 places, 350/1710 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 375 transition count 325
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 375 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 374 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 374 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 373 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 373 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 372 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 372 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 371 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 371 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 370 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 370 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 369 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 369 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 368 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 368 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 367 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 367 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 366 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 366 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 365 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 365 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 364 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 364 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 363 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 363 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 362 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 362 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 361 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 361 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 360 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 360 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 359 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 359 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 358 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 358 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 357 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 357 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 356 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 356 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 355 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 355 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 354 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 354 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 353 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 353 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 352 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 352 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 351 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 351 transition count 301
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 100 place count 350 transition count 300
Applied a total of 100 rules in 219 ms. Remains 350 /400 variables (removed 50) and now considering 300/350 (removed 50) transitions.
// Phase 1: matrix 300 rows 350 cols
[2022-05-16 01:10:20] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:10:21] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 300 rows 350 cols
[2022-05-16 01:10:21] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:10:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:10:21] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/1760 places, 300/1710 transitions.
Finished structural reductions, in 2 iterations. Remains : 350/1760 places, 300/1710 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s75 0) (EQ s171 1)), p1:(EQ s18 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1271 reset in 550 ms.
Product exploration explored 100000 steps with 1269 reset in 449 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 368 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 123 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 300 rows 350 cols
[2022-05-16 01:10:23] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:10:23] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:10:23] [INFO ] [Nat]Absence check using 76 positive place invariants in 10 ms returned sat
[2022-05-16 01:10:23] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:10:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:10:23] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 01:10:23] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-16 01:10:23] [INFO ] After 263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 350 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 350/350 places, 300/300 transitions.
Free-agglomeration rule applied 122 times.
Iterating global reduction 0 with 122 rules applied. Total rules applied 122 place count 350 transition count 178
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t202.t376 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 161 edges and 157 vertex of which 20 / 157 are part of one of the 1 SCC in 2 ms
Free SCC test removed 19 places
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 115 rules applied. Total rules applied 237 place count 138 transition count 64
Reduce places removed 112 places and 0 transitions.
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 387 place count 26 transition count 26
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 387 place count 26 transition count 23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 393 place count 23 transition count 23
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 398 place count 18 transition count 18
Iterating global reduction 2 with 5 rules applied. Total rules applied 403 place count 18 transition count 18
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 405 place count 16 transition count 16
Iterating global reduction 2 with 2 rules applied. Total rules applied 407 place count 16 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 408 place count 15 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 409 place count 15 transition count 15
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 2 with 2 rules applied. Total rules applied 411 place count 14 transition count 14
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 22 edges and 14 vertex of which 12 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 413 place count 12 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 12 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 415 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 416 place count 11 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 417 place count 11 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 418 place count 11 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 419 place count 10 transition count 9
Applied a total of 419 rules in 31 ms. Remains 10 /350 variables (removed 340) and now considering 9/300 (removed 291) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/350 places, 9/300 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 300/300 transitions.
Applied a total of 0 rules in 24 ms. Remains 350 /350 variables (removed 0) and now considering 300/300 (removed 0) transitions.
// Phase 1: matrix 300 rows 350 cols
[2022-05-16 01:10:24] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:10:24] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 300 rows 350 cols
[2022-05-16 01:10:24] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:10:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:10:24] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2022-05-16 01:10:24] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 300 rows 350 cols
[2022-05-16 01:10:24] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:10:24] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 350/350 places, 300/300 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 123 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 300 rows 350 cols
[2022-05-16 01:10:25] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:10:25] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:10:25] [INFO ] [Nat]Absence check using 76 positive place invariants in 8 ms returned sat
[2022-05-16 01:10:25] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:10:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:10:25] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 01:10:25] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-16 01:10:25] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 350 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 350/350 places, 300/300 transitions.
Free-agglomeration rule applied 122 times.
Iterating global reduction 0 with 122 rules applied. Total rules applied 122 place count 350 transition count 178
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t202.t376 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 161 edges and 157 vertex of which 20 / 157 are part of one of the 1 SCC in 0 ms
Free SCC test removed 19 places
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 115 rules applied. Total rules applied 237 place count 138 transition count 64
Reduce places removed 112 places and 0 transitions.
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 387 place count 26 transition count 26
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 387 place count 26 transition count 23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 393 place count 23 transition count 23
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 398 place count 18 transition count 18
Iterating global reduction 2 with 5 rules applied. Total rules applied 403 place count 18 transition count 18
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 405 place count 16 transition count 16
Iterating global reduction 2 with 2 rules applied. Total rules applied 407 place count 16 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 408 place count 15 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 409 place count 15 transition count 15
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 2 with 2 rules applied. Total rules applied 411 place count 14 transition count 14
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 22 edges and 14 vertex of which 12 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 413 place count 12 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 12 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 415 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 416 place count 11 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 417 place count 11 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 418 place count 11 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 419 place count 10 transition count 9
Applied a total of 419 rules in 20 ms. Remains 10 /350 variables (removed 340) and now considering 9/300 (removed 291) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/350 places, 9/300 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1266 reset in 347 ms.
Product exploration explored 100000 steps with 1282 reset in 383 ms.
Built C files in :
/tmp/ltsmin9126435994627003716
[2022-05-16 01:10:26] [INFO ] Computing symmetric may disable matrix : 300 transitions.
[2022-05-16 01:10:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:10:26] [INFO ] Computing symmetric may enable matrix : 300 transitions.
[2022-05-16 01:10:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:10:26] [INFO ] Computing Do-Not-Accords matrix : 300 transitions.
[2022-05-16 01:10:26] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:10:26] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9126435994627003716
Running compilation step : cd /tmp/ltsmin9126435994627003716;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 656 ms.
Running link step : cd /tmp/ltsmin9126435994627003716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin9126435994627003716;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13659513386300178335.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 300/300 transitions.
Applied a total of 0 rules in 9 ms. Remains 350 /350 variables (removed 0) and now considering 300/300 (removed 0) transitions.
// Phase 1: matrix 300 rows 350 cols
[2022-05-16 01:10:41] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:10:41] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 300 rows 350 cols
[2022-05-16 01:10:41] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:10:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 01:10:42] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2022-05-16 01:10:42] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 300 rows 350 cols
[2022-05-16 01:10:42] [INFO ] Computed 76 place invariants in 3 ms
[2022-05-16 01:10:42] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 350/350 places, 300/300 transitions.
Built C files in :
/tmp/ltsmin6036429355685028054
[2022-05-16 01:10:42] [INFO ] Computing symmetric may disable matrix : 300 transitions.
[2022-05-16 01:10:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:10:42] [INFO ] Computing symmetric may enable matrix : 300 transitions.
[2022-05-16 01:10:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:10:42] [INFO ] Computing Do-Not-Accords matrix : 300 transitions.
[2022-05-16 01:10:42] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:10:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6036429355685028054
Running compilation step : cd /tmp/ltsmin6036429355685028054;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 571 ms.
Running link step : cd /tmp/ltsmin6036429355685028054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6036429355685028054;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1111327525627338485.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:10:57] [INFO ] Flatten gal took : 12 ms
[2022-05-16 01:10:57] [INFO ] Flatten gal took : 12 ms
[2022-05-16 01:10:57] [INFO ] Time to serialize gal into /tmp/LTL303871484015135901.gal : 3 ms
[2022-05-16 01:10:57] [INFO ] Time to serialize properties into /tmp/LTL18244682645262094201.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL303871484015135901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18244682645262094201.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3038714...266
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G((X("((p535==0)&&(p1127==1))"))||(F("(p218==0)"))))))))
Formula 0 simplified : !FGFG(X"((p535==0)&&(p1127==1))" | F"(p218==0)")
Reverse transition relation is NOT exact ! Due to transitions t28, t215, t256.t376, t274.t376, Intersection with reachable at each step enabled. (destroye...194
Computing Next relation with stutter on 6.30823e+09 deadlock states
Detected timeout of ITS tools.
[2022-05-16 01:11:12] [INFO ] Flatten gal took : 29 ms
[2022-05-16 01:11:12] [INFO ] Applying decomposition
[2022-05-16 01:11:12] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8085907286894104711.txt' '-o' '/tmp/graph8085907286894104711.bin' '-w' '/tmp/graph8085907286894104711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8085907286894104711.bin' '-l' '-1' '-v' '-w' '/tmp/graph8085907286894104711.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:11:13] [INFO ] Decomposing Gal with order
[2022-05-16 01:11:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:11:13] [INFO ] Removed a total of 7 redundant transitions.
[2022-05-16 01:11:13] [INFO ] Flatten gal took : 81 ms
[2022-05-16 01:11:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-16 01:11:13] [INFO ] Time to serialize gal into /tmp/LTL10595986833999731372.gal : 9 ms
[2022-05-16 01:11:13] [INFO ] Time to serialize properties into /tmp/LTL12378755652302056540.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10595986833999731372.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12378755652302056540.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1059598...247
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G((X("((i10.i0.u33.p535==0)&&(i2.i1.u74.p1127==1))"))||(F("(i2.i0.u7.p218==0)"))))))))
Formula 0 simplified : !FGFG(X"((i10.i0.u33.p535==0)&&(i2.i1.u74.p1127==1))" | F"(i2.i0.u7.p218==0)")
Reverse transition relation is NOT exact ! Due to transitions t28, t256_t376, t274_t376, i2.i0.u7.t215, Intersection with reachable at each step enabled. ...203
Computing Next relation with stutter on 6.30823e+09 deadlock states
78 unique states visited
78 strongly connected components in search stack
79 transitions explored
78 items max in DFS search stack
156 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.62715,70008,1,0,110159,23034,3961,172108,1183,79383,121152
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24b-LTLCardinality-01 finished in 54968 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U X(p1)))'
Support contains 6 out of 1760 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1760/1760 places, 1710/1710 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1745 transition count 1695
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1745 transition count 1695
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 1736 transition count 1686
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 1736 transition count 1686
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 1732 transition count 1682
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 1732 transition count 1682
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 1729 transition count 1679
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 1729 transition count 1679
Applied a total of 62 rules in 427 ms. Remains 1729 /1760 variables (removed 31) and now considering 1679/1710 (removed 31) transitions.
// Phase 1: matrix 1679 rows 1729 cols
[2022-05-16 01:11:15] [INFO ] Computed 148 place invariants in 14 ms
[2022-05-16 01:11:16] [INFO ] Implicit Places using invariants in 709 ms returned []
// Phase 1: matrix 1679 rows 1729 cols
[2022-05-16 01:11:16] [INFO ] Computed 148 place invariants in 15 ms
[2022-05-16 01:11:17] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 2296 ms to find 0 implicit places.
// Phase 1: matrix 1679 rows 1729 cols
[2022-05-16 01:11:17] [INFO ] Computed 148 place invariants in 9 ms
[2022-05-16 01:11:18] [INFO ] Dead Transitions using invariants and state equation in 978 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1729/1760 places, 1679/1710 transitions.
Finished structural reductions, in 1 iterations. Remains : 1729/1760 places, 1679/1710 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s1294 0) (EQ s746 1) (EQ s284 0) (EQ s1656 1)), p0:(OR (EQ s1034 0) (EQ s723 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 989 ms.
Product exploration explored 100000 steps with 50000 reset in 1175 ms.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-24b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLCardinality-03 finished in 6181 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1760 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1760/1760 places, 1710/1710 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1743 transition count 1693
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1743 transition count 1693
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1733 transition count 1683
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1733 transition count 1683
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 1728 transition count 1678
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 1728 transition count 1678
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 1724 transition count 1674
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 1724 transition count 1674
Applied a total of 72 rules in 427 ms. Remains 1724 /1760 variables (removed 36) and now considering 1674/1710 (removed 36) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2022-05-16 01:11:21] [INFO ] Computed 148 place invariants in 7 ms
[2022-05-16 01:11:22] [INFO ] Implicit Places using invariants in 482 ms returned []
// Phase 1: matrix 1674 rows 1724 cols
[2022-05-16 01:11:22] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:11:25] [INFO ] Implicit Places using invariants and state equation in 2900 ms returned []
Implicit Place search using SMT with State Equation took 3385 ms to find 0 implicit places.
// Phase 1: matrix 1674 rows 1724 cols
[2022-05-16 01:11:25] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:11:26] [INFO ] Dead Transitions using invariants and state equation in 943 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1724/1760 places, 1674/1710 transitions.
Finished structural reductions, in 1 iterations. Remains : 1724/1760 places, 1674/1710 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1415 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 384 reset in 289 ms.
Product exploration explored 100000 steps with 380 reset in 389 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Detected a total of 414/1724 stabilizing places and 414/1674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 259 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=129 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 1674 rows 1724 cols
[2022-05-16 01:11:27] [INFO ] Computed 148 place invariants in 8 ms
[2022-05-16 01:11:28] [INFO ] [Real]Absence check using 147 positive place invariants in 138 ms returned sat
[2022-05-16 01:11:28] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 7 ms returned sat
[2022-05-16 01:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:11:38] [INFO ] [Real]Absence check using state equation in 10325 ms returned sat
[2022-05-16 01:11:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:11:39] [INFO ] [Nat]Absence check using 147 positive place invariants in 180 ms returned sat
[2022-05-16 01:11:39] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 9 ms returned sat
[2022-05-16 01:11:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:11:45] [INFO ] [Nat]Absence check using state equation in 6086 ms returned sat
[2022-05-16 01:11:45] [INFO ] Computed and/alt/rep : 1671/2327/1671 causal constraints (skipped 2 transitions) in 114 ms.
[2022-05-16 01:11:53] [INFO ] Added : 215 causal constraints over 43 iterations in 7883 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 623 transitions
Trivial Post-agglo rules discarded 623 transitions
Performed 623 trivial Post agglomeration. Transition count delta: 623
Iterating post reduction 0 with 623 rules applied. Total rules applied 623 place count 1723 transition count 1050
Reduce places removed 623 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 1 with 695 rules applied. Total rules applied 1318 place count 1100 transition count 978
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1367 place count 1052 transition count 977
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1368 place count 1051 transition count 977
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1368 place count 1051 transition count 778
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1766 place count 852 transition count 778
Performed 339 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 2444 place count 513 transition count 391
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 2445 place count 512 transition count 390
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2517 place count 464 transition count 366
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2541 place count 440 transition count 366
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2541 place count 440 transition count 342
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2589 place count 416 transition count 342
Applied a total of 2589 rules in 169 ms. Remains 416 /1724 variables (removed 1308) and now considering 342/1674 (removed 1332) transitions.
// Phase 1: matrix 342 rows 416 cols
[2022-05-16 01:11:53] [INFO ] Computed 100 place invariants in 14 ms
[2022-05-16 01:11:54] [INFO ] Implicit Places using invariants in 681 ms returned [168, 242, 316, 320, 324, 328, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 415]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 683 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 390/1724 places, 342/1674 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 366 transition count 318
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 366 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 365 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 365 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 364 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 364 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 363 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 363 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 362 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 362 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 361 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 361 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 360 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 360 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 359 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 359 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 358 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 358 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 357 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 357 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 356 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 356 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 355 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 355 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 354 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 354 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 353 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 353 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 352 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 352 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 351 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 351 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 350 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 350 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 349 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 349 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 348 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 348 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 347 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 347 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 346 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 346 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 345 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 345 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 344 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 344 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 343 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 343 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 342 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 342 transition count 294
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 340 transition count 292
Applied a total of 100 rules in 137 ms. Remains 340 /390 variables (removed 50) and now considering 292/342 (removed 50) transitions.
// Phase 1: matrix 292 rows 340 cols
[2022-05-16 01:11:54] [INFO ] Computed 74 place invariants in 2 ms
[2022-05-16 01:11:54] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 292 rows 340 cols
[2022-05-16 01:11:54] [INFO ] Computed 74 place invariants in 9 ms
[2022-05-16 01:11:55] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 340/1724 places, 292/1674 transitions.
Finished structural reductions, in 2 iterations. Remains : 340/1724 places, 292/1674 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/340 stabilizing places and 2/292 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 65 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
// Phase 1: matrix 292 rows 340 cols
[2022-05-16 01:11:55] [INFO ] Computed 74 place invariants in 1 ms
[2022-05-16 01:11:56] [INFO ] [Real]Absence check using 74 positive place invariants in 22 ms returned sat
[2022-05-16 01:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:11:56] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2022-05-16 01:11:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:11:56] [INFO ] [Nat]Absence check using 74 positive place invariants in 18 ms returned sat
[2022-05-16 01:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:11:56] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-16 01:11:57] [INFO ] Computed and/alt/rep : 170/268/170 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-16 01:11:57] [INFO ] Added : 40 causal constraints over 8 iterations in 288 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2285 reset in 532 ms.
Product exploration explored 100000 steps with 2246 reset in 497 ms.
Built C files in :
/tmp/ltsmin6660187318524018205
[2022-05-16 01:11:58] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2022-05-16 01:11:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:11:58] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2022-05-16 01:11:58] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:11:58] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2022-05-16 01:11:58] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:11:58] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6660187318524018205
Running compilation step : cd /tmp/ltsmin6660187318524018205;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 672 ms.
Running link step : cd /tmp/ltsmin6660187318524018205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin6660187318524018205;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8308873193685483083.hoa' '--buchi-type=spotba'
LTSmin run took 967 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-24b-LTLCardinality-05 finished in 38845 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(p0) U p1)))'
Support contains 3 out of 1760 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1760/1760 places, 1710/1710 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1746 transition count 1696
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1746 transition count 1696
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1739 transition count 1689
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1739 transition count 1689
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 1736 transition count 1686
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 1736 transition count 1686
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 1733 transition count 1683
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 1733 transition count 1683
Applied a total of 54 rules in 401 ms. Remains 1733 /1760 variables (removed 27) and now considering 1683/1710 (removed 27) transitions.
// Phase 1: matrix 1683 rows 1733 cols
[2022-05-16 01:12:00] [INFO ] Computed 148 place invariants in 15 ms
[2022-05-16 01:12:01] [INFO ] Implicit Places using invariants in 451 ms returned []
// Phase 1: matrix 1683 rows 1733 cols
[2022-05-16 01:12:01] [INFO ] Computed 148 place invariants in 5 ms
[2022-05-16 01:12:02] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
// Phase 1: matrix 1683 rows 1733 cols
[2022-05-16 01:12:02] [INFO ] Computed 148 place invariants in 9 ms
[2022-05-16 01:12:03] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1733/1760 places, 1683/1710 transitions.
Finished structural reductions, in 1 iterations. Remains : 1733/1760 places, 1683/1710 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, p0, p1, p1, (AND p0 p1)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s471 0) (EQ s353 1)), p1:(EQ s830 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 132 reset in 418 ms.
Product exploration explored 100000 steps with 132 reset in 412 ms.
Computed a total of 421 stabilizing places and 421 stable transitions
Computed a total of 421 stabilizing places and 421 stable transitions
Detected a total of 421/1733 stabilizing places and 421/1683 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 311 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[p0, (AND p0 p1), (AND p0 p1)]
Finished random walk after 1487 steps, including 1 resets, run visited all 3 properties in 47 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 342 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 130 ms :[p0, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 1733 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1733/1733 places, 1683/1683 transitions.
Applied a total of 0 rules in 90 ms. Remains 1733 /1733 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
// Phase 1: matrix 1683 rows 1733 cols
[2022-05-16 01:12:05] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:12:06] [INFO ] Implicit Places using invariants in 515 ms returned []
// Phase 1: matrix 1683 rows 1733 cols
[2022-05-16 01:12:06] [INFO ] Computed 148 place invariants in 6 ms
[2022-05-16 01:12:08] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2329 ms to find 0 implicit places.
// Phase 1: matrix 1683 rows 1733 cols
[2022-05-16 01:12:08] [INFO ] Computed 148 place invariants in 6 ms
[2022-05-16 01:12:08] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1733/1733 places, 1683/1683 transitions.
Computed a total of 421 stabilizing places and 421 stable transitions
Computed a total of 421 stabilizing places and 421 stable transitions
Detected a total of 421/1733 stabilizing places and 421/1683 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[p0, (AND p0 p1), (AND p0 p1)]
Finished random walk after 1382 steps, including 1 resets, run visited all 3 properties in 20 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 343 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 150 ms :[p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 145 ms :[p0, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 132 reset in 353 ms.
Product exploration explored 100000 steps with 132 reset in 383 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 118 ms :[p0, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 1733 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1733/1733 places, 1683/1683 transitions.
Performed 556 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 1733 transition count 1683
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 46 rules applied. Total rules applied 602 place count 1733 transition count 1660
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 220 Pre rules applied. Total rules applied 602 place count 1733 transition count 1661
Deduced a syphon composed of 799 places in 7 ms
Iterating global reduction 2 with 220 rules applied. Total rules applied 822 place count 1733 transition count 1661
Discarding 472 places :
Symmetric choice reduction at 2 with 472 rule applications. Total rules 1294 place count 1261 transition count 1189
Deduced a syphon composed of 327 places in 5 ms
Iterating global reduction 2 with 472 rules applied. Total rules applied 1766 place count 1261 transition count 1189
Performed 416 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 743 places in 0 ms
Iterating global reduction 2 with 416 rules applied. Total rules applied 2182 place count 1261 transition count 1141
Renaming transitions due to excessive name length > 1024 char.
Discarding 269 places :
Symmetric choice reduction at 2 with 269 rule applications. Total rules 2451 place count 992 transition count 872
Deduced a syphon composed of 474 places in 0 ms
Iterating global reduction 2 with 269 rules applied. Total rules applied 2720 place count 992 transition count 872
Deduced a syphon composed of 474 places in 1 ms
Applied a total of 2720 rules in 786 ms. Remains 992 /1733 variables (removed 741) and now considering 872/1683 (removed 811) transitions.
[2022-05-16 01:12:11] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 872 rows 992 cols
[2022-05-16 01:12:11] [INFO ] Computed 148 place invariants in 42 ms
[2022-05-16 01:12:12] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 992/1733 places, 872/1683 transitions.
Finished structural reductions, in 1 iterations. Remains : 992/1733 places, 872/1683 transitions.
Stuttering criterion allowed to conclude after 1611 steps with 30 reset in 14 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-06 finished in 12397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F(p0)))||F(!(p1 U p2))))'
Support contains 5 out of 1760 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1760/1760 places, 1710/1710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 631 transitions
Trivial Post-agglo rules discarded 631 transitions
Performed 631 trivial Post agglomeration. Transition count delta: 631
Iterating post reduction 0 with 631 rules applied. Total rules applied 631 place count 1759 transition count 1078
Reduce places removed 631 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 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 1 with 700 rules applied. Total rules applied 1331 place count 1128 transition count 1009
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 48 rules applied. Total rules applied 1379 place count 1082 transition count 1007
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1381 place count 1080 transition count 1007
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 203 Pre rules applied. Total rules applied 1381 place count 1080 transition count 804
Deduced a syphon composed of 203 places in 3 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 4 with 406 rules applied. Total rules applied 1787 place count 877 transition count 804
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1797 place count 867 transition count 794
Iterating global reduction 4 with 10 rules applied. Total rules applied 1807 place count 867 transition count 794
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 1807 place count 867 transition count 786
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1823 place count 859 transition count 786
Performed 337 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 4 with 674 rules applied. Total rules applied 2497 place count 522 transition count 401
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 2498 place count 521 transition count 400
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 4 with 64 rules applied. Total rules applied 2562 place count 477 transition count 380
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 2582 place count 457 transition count 380
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2582 place count 457 transition count 356
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2630 place count 433 transition count 356
Applied a total of 2630 rules in 134 ms. Remains 433 /1760 variables (removed 1327) and now considering 356/1710 (removed 1354) transitions.
// Phase 1: matrix 356 rows 433 cols
[2022-05-16 01:12:12] [INFO ] Computed 104 place invariants in 1 ms
[2022-05-16 01:12:12] [INFO ] Implicit Places using invariants in 200 ms returned [181, 255, 329, 333, 337, 341, 345, 350, 360, 364, 368, 373, 377, 381, 386, 390, 394, 398, 402, 406, 410, 415, 419, 423, 427, 432]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 203 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 407/1760 places, 356/1710 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 383 transition count 332
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 383 transition count 332
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 382 transition count 331
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 382 transition count 331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 381 transition count 330
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 381 transition count 330
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 380 transition count 329
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 380 transition count 329
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 379 transition count 328
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 379 transition count 328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 378 transition count 327
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 378 transition count 327
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 377 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 377 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 376 transition count 325
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 376 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 375 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 375 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 374 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 374 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 373 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 373 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 372 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 372 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 371 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 371 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 370 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 370 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 369 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 369 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 368 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 368 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 367 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 367 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 366 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 366 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 365 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 365 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 364 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 364 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 363 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 363 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 362 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 362 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 361 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 361 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 360 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 360 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 359 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 359 transition count 308
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 0 with 4 rules applied. Total rules applied 100 place count 357 transition count 306
Applied a total of 100 rules in 163 ms. Remains 357 /407 variables (removed 50) and now considering 306/356 (removed 50) transitions.
// Phase 1: matrix 306 rows 357 cols
[2022-05-16 01:12:13] [INFO ] Computed 78 place invariants in 1 ms
[2022-05-16 01:12:13] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 306 rows 357 cols
[2022-05-16 01:12:13] [INFO ] Computed 78 place invariants in 1 ms
[2022-05-16 01:12:13] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-05-16 01:12:13] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 357/1760 places, 306/1710 transitions.
Finished structural reductions, in 2 iterations. Remains : 357/1760 places, 306/1710 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s318 1), p2:(OR (EQ s1 0) (EQ s170 1)), p0:(OR (EQ s180 0) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3566 reset in 443 ms.
Product exploration explored 100000 steps with 3486 reset in 416 ms.
Computed a total of 8 stabilizing places and 6 stable transitions
Computed a total of 8 stabilizing places and 6 stable transitions
Detected a total of 8/357 stabilizing places and 6/306 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 379 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 163 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (NOT (OR p2 p1))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 4 factoid took 419 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 5 out of 357 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 357/357 places, 306/306 transitions.
Applied a total of 0 rules in 12 ms. Remains 357 /357 variables (removed 0) and now considering 306/306 (removed 0) transitions.
// Phase 1: matrix 306 rows 357 cols
[2022-05-16 01:12:16] [INFO ] Computed 78 place invariants in 1 ms
[2022-05-16 01:12:16] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 306 rows 357 cols
[2022-05-16 01:12:16] [INFO ] Computed 78 place invariants in 1 ms
[2022-05-16 01:12:16] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-05-16 01:12:16] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2022-05-16 01:12:16] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 306 rows 357 cols
[2022-05-16 01:12:16] [INFO ] Computed 78 place invariants in 1 ms
[2022-05-16 01:12:17] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 357/357 places, 306/306 transitions.
Computed a total of 8 stabilizing places and 6 stable transitions
Computed a total of 8 stabilizing places and 6 stable transitions
Detected a total of 8/357 stabilizing places and 6/306 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR p2 p1)), (X (NOT (OR p2 p1))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (OR p2 p1))))]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 261 steps, including 3 resets, run visited all 3 properties in 3 ms. (steps per millisecond=87 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR p2 p1)), (X (NOT (OR p2 p1))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (F (NOT (OR p2 p1))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 3624 reset in 320 ms.
Stack based approach found an accepted trace after 48876 steps with 1712 reset with depth 14 and stack size 14 in 160 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-07 finished in 5853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1760 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1760/1760 places, 1710/1710 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1744 transition count 1694
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1744 transition count 1694
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 1734 transition count 1684
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 1734 transition count 1684
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1729 transition count 1679
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1729 transition count 1679
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1725 transition count 1675
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1725 transition count 1675
Applied a total of 70 rules in 437 ms. Remains 1725 /1760 variables (removed 35) and now considering 1675/1710 (removed 35) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:12:18] [INFO ] Computed 148 place invariants in 11 ms
[2022-05-16 01:12:19] [INFO ] Implicit Places using invariants in 555 ms returned []
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:12:19] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:12:21] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2188 ms to find 0 implicit places.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:12:21] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:12:21] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1760 places, 1675/1710 transitions.
Finished structural reductions, in 1 iterations. Remains : 1725/1760 places, 1675/1710 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s833 0) (NEQ s432 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-09 finished in 3580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(X(F(p0)))))))'
Support contains 1 out of 1760 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1760/1760 places, 1710/1710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 637 transitions
Trivial Post-agglo rules discarded 637 transitions
Performed 637 trivial Post agglomeration. Transition count delta: 637
Iterating post reduction 0 with 637 rules applied. Total rules applied 637 place count 1759 transition count 1072
Reduce places removed 637 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 1 with 709 rules applied. Total rules applied 1346 place count 1122 transition count 1000
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1394 place count 1074 transition count 1000
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 202 Pre rules applied. Total rules applied 1394 place count 1074 transition count 798
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 3 with 404 rules applied. Total rules applied 1798 place count 872 transition count 798
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1807 place count 863 transition count 789
Iterating global reduction 3 with 9 rules applied. Total rules applied 1816 place count 863 transition count 789
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1816 place count 863 transition count 782
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1830 place count 856 transition count 782
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 2510 place count 516 transition count 394
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 2511 place count 515 transition count 393
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 66 rules applied. Total rules applied 2577 place count 470 transition count 372
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 2598 place count 449 transition count 372
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2598 place count 449 transition count 348
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2646 place count 425 transition count 348
Applied a total of 2646 rules in 122 ms. Remains 425 /1760 variables (removed 1335) and now considering 348/1710 (removed 1362) transitions.
// Phase 1: matrix 348 rows 425 cols
[2022-05-16 01:12:22] [INFO ] Computed 103 place invariants in 2 ms
[2022-05-16 01:12:22] [INFO ] Implicit Places using invariants in 230 ms returned [176, 250, 324, 328, 332, 336, 340, 345, 349, 353, 357, 361, 366, 370, 374, 379, 383, 387, 391, 395, 399, 403, 407, 411, 415, 419, 424]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 231 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/1760 places, 348/1710 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 373 transition count 323
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 373 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 372 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 372 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 371 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 371 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 370 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 370 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 369 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 369 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 368 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 368 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 367 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 367 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 366 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 366 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 365 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 365 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 364 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 364 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 363 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 363 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 362 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 362 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 361 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 361 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 360 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 360 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 359 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 359 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 358 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 358 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 357 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 357 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 356 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 356 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 355 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 355 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 354 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 354 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 353 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 353 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 352 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 352 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 351 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 351 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 350 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 350 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 349 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 349 transition count 299
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 100 place count 348 transition count 298
Applied a total of 100 rules in 99 ms. Remains 348 /398 variables (removed 50) and now considering 298/348 (removed 50) transitions.
// Phase 1: matrix 298 rows 348 cols
[2022-05-16 01:12:22] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:12:22] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 298 rows 348 cols
[2022-05-16 01:12:22] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:12:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:12:22] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 348/1760 places, 298/1710 transitions.
Finished structural reductions, in 2 iterations. Remains : 348/1760 places, 298/1710 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-10 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 s151 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1261 reset in 393 ms.
Product exploration explored 100000 steps with 1265 reset in 367 ms.
Computed a total of 6 stabilizing places and 3 stable transitions
Computed a total of 6 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8433 steps, including 105 resets, run visited all 1 properties in 42 ms. (steps per millisecond=200 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 348/348 places, 298/298 transitions.
Applied a total of 0 rules in 5 ms. Remains 348 /348 variables (removed 0) and now considering 298/298 (removed 0) transitions.
// Phase 1: matrix 298 rows 348 cols
[2022-05-16 01:12:24] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:12:24] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 298 rows 348 cols
[2022-05-16 01:12:24] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:12:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:12:24] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2022-05-16 01:12:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 298 rows 348 cols
[2022-05-16 01:12:24] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:12:25] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 348/348 places, 298/298 transitions.
Computed a total of 6 stabilizing places and 3 stable transitions
Computed a total of 6 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 276 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=138 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1266 reset in 483 ms.
Product exploration explored 100000 steps with 1260 reset in 475 ms.
Built C files in :
/tmp/ltsmin2315340999022183994
[2022-05-16 01:12:26] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2022-05-16 01:12:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:26] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2022-05-16 01:12:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:26] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2022-05-16 01:12:26] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:26] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2315340999022183994
Running compilation step : cd /tmp/ltsmin2315340999022183994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 686 ms.
Running link step : cd /tmp/ltsmin2315340999022183994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2315340999022183994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4543935558270131072.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 348/348 places, 298/298 transitions.
Applied a total of 0 rules in 6 ms. Remains 348 /348 variables (removed 0) and now considering 298/298 (removed 0) transitions.
// Phase 1: matrix 298 rows 348 cols
[2022-05-16 01:12:41] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:12:42] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 298 rows 348 cols
[2022-05-16 01:12:42] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-16 01:12:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:12:42] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2022-05-16 01:12:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 298 rows 348 cols
[2022-05-16 01:12:42] [INFO ] Computed 76 place invariants in 2 ms
[2022-05-16 01:12:42] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 348/348 places, 298/298 transitions.
Built C files in :
/tmp/ltsmin6706631365937400552
[2022-05-16 01:12:42] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2022-05-16 01:12:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:42] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2022-05-16 01:12:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:42] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2022-05-16 01:12:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:12:42] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6706631365937400552
Running compilation step : cd /tmp/ltsmin6706631365937400552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 533 ms.
Running link step : cd /tmp/ltsmin6706631365937400552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6706631365937400552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6847588459471486880.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:12:57] [INFO ] Flatten gal took : 13 ms
[2022-05-16 01:12:57] [INFO ] Flatten gal took : 17 ms
[2022-05-16 01:12:57] [INFO ] Time to serialize gal into /tmp/LTL8466697510221262527.gal : 2 ms
[2022-05-16 01:12:57] [INFO ] Time to serialize properties into /tmp/LTL1671324140726479987.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8466697510221262527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1671324140726479987.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8466697...266
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(X(F("(p964==0)"))))))))
Formula 0 simplified : !XGXFXF"(p964==0)"
Reverse transition relation is NOT exact ! Due to transitions t224.t374, t254.t374, t272.t374, Intersection with reachable at each step enabled. (destroye...194
Computing Next relation with stutter on 1.24822e+10 deadlock states
Detected timeout of ITS tools.
[2022-05-16 01:13:12] [INFO ] Flatten gal took : 10 ms
[2022-05-16 01:13:12] [INFO ] Applying decomposition
[2022-05-16 01:13:12] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6560302321628077706.txt' '-o' '/tmp/graph6560302321628077706.bin' '-w' '/tmp/graph6560302321628077706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6560302321628077706.bin' '-l' '-1' '-v' '-w' '/tmp/graph6560302321628077706.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:13:12] [INFO ] Decomposing Gal with order
[2022-05-16 01:13:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:13:12] [INFO ] Removed a total of 4 redundant transitions.
[2022-05-16 01:13:12] [INFO ] Flatten gal took : 17 ms
[2022-05-16 01:13:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 01:13:12] [INFO ] Time to serialize gal into /tmp/LTL4072524200114496721.gal : 3 ms
[2022-05-16 01:13:12] [INFO ] Time to serialize properties into /tmp/LTL12101310300857492892.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4072524200114496721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12101310300857492892.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4072524...246
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(X(F("(i10.u65.p964==0)"))))))))
Formula 0 simplified : !XGXFXF"(i10.u65.p964==0)"
Reverse transition relation is NOT exact ! Due to transitions t224_t374, t254_t374, t272_t374, Intersection with reachable at each step enabled. (destroye...194
Computing Next relation with stutter on 1.24822e+10 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
119 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.26047,69404,1,0,92981,37028,3855,201991,1274,131870,86923
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24b-LTLCardinality-10 finished in 52459 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 2 out of 1760 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1760/1760 places, 1710/1710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 633 transitions
Trivial Post-agglo rules discarded 633 transitions
Performed 633 trivial Post agglomeration. Transition count delta: 633
Iterating post reduction 0 with 633 rules applied. Total rules applied 633 place count 1759 transition count 1076
Reduce places removed 633 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 1 with 705 rules applied. Total rules applied 1338 place count 1126 transition count 1004
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1387 place count 1078 transition count 1003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1388 place count 1077 transition count 1003
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 203 Pre rules applied. Total rules applied 1388 place count 1077 transition count 800
Deduced a syphon composed of 203 places in 2 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 4 with 406 rules applied. Total rules applied 1794 place count 874 transition count 800
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1803 place count 865 transition count 791
Iterating global reduction 4 with 9 rules applied. Total rules applied 1812 place count 865 transition count 791
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 1812 place count 865 transition count 783
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1828 place count 857 transition count 783
Performed 339 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 2506 place count 518 transition count 396
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 2507 place count 517 transition count 395
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 66 rules applied. Total rules applied 2573 place count 472 transition count 374
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 2594 place count 451 transition count 374
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2594 place count 451 transition count 350
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2642 place count 427 transition count 350
Applied a total of 2642 rules in 166 ms. Remains 427 /1760 variables (removed 1333) and now considering 350/1710 (removed 1360) transitions.
// Phase 1: matrix 350 rows 427 cols
[2022-05-16 01:13:14] [INFO ] Computed 103 place invariants in 2 ms
[2022-05-16 01:13:14] [INFO ] Implicit Places using invariants in 354 ms returned [174, 248, 322, 326, 330, 334, 338, 343, 347, 351, 355, 359, 370, 374, 379, 383, 387, 391, 395, 399, 403, 407, 411, 421, 426]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 355 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1760 places, 350/1710 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 379 transition count 327
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 379 transition count 327
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 378 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 378 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 377 transition count 325
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 377 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 376 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 376 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 375 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 375 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 374 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 374 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 373 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 373 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 372 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 372 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 371 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 371 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 370 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 370 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 369 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 369 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 368 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 368 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 367 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 367 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 366 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 366 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 365 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 365 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 364 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 364 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 363 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 363 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 362 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 362 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 361 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 361 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 360 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 360 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 359 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 359 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 358 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 358 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 357 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 357 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 356 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 356 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 355 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 355 transition count 303
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 352 transition count 300
Applied a total of 100 rules in 124 ms. Remains 352 /402 variables (removed 50) and now considering 300/350 (removed 50) transitions.
// Phase 1: matrix 300 rows 352 cols
[2022-05-16 01:13:15] [INFO ] Computed 78 place invariants in 1 ms
[2022-05-16 01:13:15] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 300 rows 352 cols
[2022-05-16 01:13:15] [INFO ] Computed 78 place invariants in 1 ms
[2022-05-16 01:13:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 01:13:15] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 352/1760 places, 300/1710 transitions.
Finished structural reductions, in 2 iterations. Remains : 352/1760 places, 300/1710 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s320 0) (NEQ s348 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-13 finished in 1267 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(!G(p0) U (F(G(p2))||p1)))))'
Support contains 5 out of 1760 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1760/1760 places, 1710/1710 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1744 transition count 1694
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1744 transition count 1694
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 1734 transition count 1684
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 1734 transition count 1684
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1729 transition count 1679
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1729 transition count 1679
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1725 transition count 1675
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1725 transition count 1675
Applied a total of 70 rules in 322 ms. Remains 1725 /1760 variables (removed 35) and now considering 1675/1710 (removed 35) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:13:16] [INFO ] Computed 148 place invariants in 12 ms
[2022-05-16 01:13:16] [INFO ] Implicit Places using invariants in 455 ms returned []
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:13:16] [INFO ] Computed 148 place invariants in 6 ms
[2022-05-16 01:13:18] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
// Phase 1: matrix 1675 rows 1725 cols
[2022-05-16 01:13:18] [INFO ] Computed 148 place invariants in 6 ms
[2022-05-16 01:13:19] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1760 places, 1675/1710 transitions.
Finished structural reductions, in 1 iterations. Remains : 1725/1760 places, 1675/1710 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR p1 p2), (OR p1 p2), (OR p1 p2), true, p2, p2, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s380 0) (EQ s1678 1)), p1:(OR (EQ s120 0) (EQ s791 1)), p2:(EQ s1623 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-15 finished in 3746 ms.
All properties solved by simple procedures.
Total runtime 210476 ms.

BK_STOP 1652663599531

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-24b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689400491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-24b.tgz
mv AutoFlight-PT-24b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;