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-165245689300460.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-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 7.4K Apr 30 01:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 01:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 01:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 01:40 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.4K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 134K 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-06b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652662699102

Running Version 202205111006
[2022-05-16 00:58:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 00:58:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:58:20] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2022-05-16 00:58:20] [INFO ] Transformed 574 places.
[2022-05-16 00:58:20] [INFO ] Transformed 572 transitions.
[2022-05-16 00:58:20] [INFO ] Found NUPN structural information;
[2022-05-16 00:58:20] [INFO ] Parsed PT model containing 574 places and 572 transitions in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA AutoFlight-PT-06b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 503 transition count 501
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 503 transition count 501
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 154 place count 503 transition count 489
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 180 place count 477 transition count 463
Iterating global reduction 1 with 26 rules applied. Total rules applied 206 place count 477 transition count 463
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 210 place count 473 transition count 459
Iterating global reduction 1 with 4 rules applied. Total rules applied 214 place count 473 transition count 459
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 217 place count 470 transition count 456
Iterating global reduction 1 with 3 rules applied. Total rules applied 220 place count 470 transition count 456
Applied a total of 220 rules in 124 ms. Remains 470 /574 variables (removed 104) and now considering 456/572 (removed 116) transitions.
// Phase 1: matrix 456 rows 470 cols
[2022-05-16 00:58:20] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-16 00:58:21] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 456 rows 470 cols
[2022-05-16 00:58:21] [INFO ] Computed 40 place invariants in 4 ms
[2022-05-16 00:58:21] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
// Phase 1: matrix 456 rows 470 cols
[2022-05-16 00:58:21] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-16 00:58:21] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/574 places, 456/572 transitions.
Finished structural reductions, in 1 iterations. Remains : 470/574 places, 456/572 transitions.
Support contains 34 out of 470 places after structural reductions.
[2022-05-16 00:58:21] [INFO ] Flatten gal took : 55 ms
[2022-05-16 00:58:21] [INFO ] Flatten gal took : 23 ms
[2022-05-16 00:58:21] [INFO ] Input system was already deterministic with 456 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 30) seen :21
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
// Phase 1: matrix 456 rows 470 cols
[2022-05-16 00:58:22] [INFO ] Computed 40 place invariants in 6 ms
[2022-05-16 00:58:23] [INFO ] [Real]Absence check using 39 positive place invariants in 21 ms returned sat
[2022-05-16 00:58:23] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 00:58:23] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2022-05-16 00:58:23] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 4 ms to minimize.
[2022-05-16 00:58:23] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2022-05-16 00:58:23] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2022-05-16 00:58:23] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2022-05-16 00:58:23] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 1 ms to minimize.
[2022-05-16 00:58:23] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2022-05-16 00:58:24] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 11 ms to minimize.
[2022-05-16 00:58:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 842 ms
[2022-05-16 00:58:24] [INFO ] After 1082ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-16 00:58:24] [INFO ] After 1319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-16 00:58:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 25 ms returned sat
[2022-05-16 00:58:24] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 8 ms returned sat
[2022-05-16 00:58:24] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-16 00:58:24] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 5 ms to minimize.
[2022-05-16 00:58:25] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2022-05-16 00:58:25] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 1 ms to minimize.
[2022-05-16 00:58:25] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 1 ms to minimize.
[2022-05-16 00:58:25] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2022-05-16 00:58:25] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 0 ms to minimize.
[2022-05-16 00:58:25] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2022-05-16 00:58:25] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 0 ms to minimize.
[2022-05-16 00:58:25] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 1 ms to minimize.
[2022-05-16 00:58:26] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2022-05-16 00:58:26] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 0 ms to minimize.
[2022-05-16 00:58:26] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2022-05-16 00:58:26] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 1 ms to minimize.
[2022-05-16 00:58:26] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 1 ms to minimize.
[2022-05-16 00:58:26] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2022-05-16 00:58:26] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2022-05-16 00:58:26] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2063 ms
[2022-05-16 00:58:27] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 0 ms to minimize.
[2022-05-16 00:58:27] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 0 ms to minimize.
[2022-05-16 00:58:27] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2022-05-16 00:58:27] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 1 ms to minimize.
[2022-05-16 00:58:27] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2022-05-16 00:58:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 670 ms
[2022-05-16 00:58:27] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 0 ms to minimize.
[2022-05-16 00:58:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-16 00:58:27] [INFO ] After 3369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 144 ms.
[2022-05-16 00:58:27] [INFO ] After 3831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 6 properties in 97 ms.
Support contains 2 out of 470 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 470/470 places, 456/456 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 0 with 167 rules applied. Total rules applied 167 place count 470 transition count 289
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 187 rules applied. Total rules applied 354 place count 303 transition count 269
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 366 place count 291 transition count 269
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 366 place count 291 transition count 213
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 478 place count 235 transition count 213
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 489 place count 224 transition count 202
Iterating global reduction 3 with 11 rules applied. Total rules applied 500 place count 224 transition count 202
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 500 place count 224 transition count 196
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 512 place count 218 transition count 196
Performed 82 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 676 place count 136 transition count 104
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 700 place count 136 transition count 80
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 724 place count 112 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 725 place count 111 transition count 79
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 79 rules applied. Total rules applied 804 place count 82 transition count 29
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 5 with 50 rules applied. Total rules applied 854 place count 32 transition count 29
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 854 place count 32 transition count 20
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 872 place count 23 transition count 20
Applied a total of 872 rules in 72 ms. Remains 23 /470 variables (removed 447) and now considering 20/456 (removed 436) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/470 places, 20/456 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
FORMULA AutoFlight-PT-06b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 122 stabilizing places and 122 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 469 transition count 290
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 185 rules applied. Total rules applied 350 place count 304 transition count 270
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 362 place count 292 transition count 270
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 362 place count 292 transition count 212
Deduced a syphon composed of 58 places in 8 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 478 place count 234 transition count 212
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 489 place count 223 transition count 201
Iterating global reduction 3 with 11 rules applied. Total rules applied 500 place count 223 transition count 201
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 500 place count 223 transition count 195
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 512 place count 217 transition count 195
Performed 81 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 674 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 675 place count 135 transition count 103
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 15 rules applied. Total rules applied 690 place count 125 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 695 place count 120 transition count 98
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 695 place count 120 transition count 93
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 705 place count 115 transition count 93
Applied a total of 705 rules in 64 ms. Remains 115 /470 variables (removed 355) and now considering 93/456 (removed 363) transitions.
// Phase 1: matrix 93 rows 115 cols
[2022-05-16 00:58:28] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-16 00:58:34] [INFO ] Implicit Places using invariants in 6004 ms returned [47, 67, 87, 91, 95, 99, 105, 109, 114]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 6010 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/470 places, 93/456 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 99 transition count 86
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 99 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 98 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 98 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 97 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 97 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 96 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 96 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 95 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 95 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 94 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 94 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 93 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 93 transition count 80
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 28 place count 92 transition count 79
Applied a total of 28 rules in 28 ms. Remains 92 /106 variables (removed 14) and now considering 79/93 (removed 14) transitions.
// Phase 1: matrix 79 rows 92 cols
[2022-05-16 00:58:34] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-16 00:58:34] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 79 rows 92 cols
[2022-05-16 00:58:34] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 00:58:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:58:34] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/470 places, 79/456 transitions.
Finished structural reductions, in 2 iterations. Remains : 92/470 places, 79/456 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-00 finished in 6580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(F(p0)))||X(F(p1))))||!(p2 U p3)))'
Support contains 4 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 469 transition count 293
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 182 rules applied. Total rules applied 344 place count 307 transition count 273
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 358 place count 295 transition count 271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 360 place count 293 transition count 271
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 360 place count 293 transition count 215
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 472 place count 237 transition count 215
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 482 place count 227 transition count 205
Iterating global reduction 4 with 10 rules applied. Total rules applied 492 place count 227 transition count 205
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 492 place count 227 transition count 199
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 504 place count 221 transition count 199
Performed 79 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 662 place count 142 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 663 place count 141 transition count 109
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 16 rules applied. Total rules applied 679 place count 130 transition count 104
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 684 place count 125 transition count 104
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 684 place count 125 transition count 98
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 696 place count 119 transition count 98
Applied a total of 696 rules in 79 ms. Remains 119 /470 variables (removed 351) and now considering 98/456 (removed 358) transitions.
// Phase 1: matrix 98 rows 119 cols
[2022-05-16 00:58:35] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 00:58:35] [INFO ] Implicit Places using invariants in 109 ms returned [109, 113, 118]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 111 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/470 places, 98/456 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 97
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 108 transition count 90
Applied a total of 16 rules in 12 ms. Remains 108 /116 variables (removed 8) and now considering 90/98 (removed 8) transitions.
// Phase 1: matrix 90 rows 108 cols
[2022-05-16 00:58:35] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 00:58:39] [INFO ] Implicit Places using invariants in 4434 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2022-05-16 00:58:39] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 00:58:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:58:39] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 4585 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/470 places, 90/456 transitions.
Finished structural reductions, in 2 iterations. Remains : 108/470 places, 90/456 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s16 1), p3:(EQ s98 1), p1:(EQ s10 0), p0:(EQ s50 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4678 reset in 382 ms.
Product exploration explored 100000 steps with 4671 reset in 275 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/108 stabilizing places and 5/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p3) p1 p0), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (NOT p1)), (X p1), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 7 factoid took 908 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 21 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p2 (NOT p3) p1 p0), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (NOT p1)), (X p1), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p2 (NOT p3)))), (F (AND p3 (NOT p1))), (F p3)]
Knowledge based reduction with 7 factoid took 1031 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2022-05-16 00:58:43] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 00:58:43] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2022-05-16 00:58:43] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 00:58:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:58:43] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2022-05-16 00:58:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2022-05-16 00:58:43] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 00:58:43] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/108 stabilizing places and 5/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p3) p1 p0), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (NOT p1)), (X p1), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 7 factoid took 793 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 37 steps, including 1 resets, run visited all 5 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p2 (NOT p3) p1 p0), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (NOT p1)), (X p1), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p2 (NOT p3)))), (F (AND p3 (NOT p1))), (F p3)]
Knowledge based reduction with 7 factoid took 967 ms. Reduced automaton from 3 states, 6 edges and 4 AP to 3 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4646 reset in 269 ms.
Product exploration explored 100000 steps with 4656 reset in 321 ms.
Built C files in :
/tmp/ltsmin204776009696091563
[2022-05-16 00:58:46] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2022-05-16 00:58:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:58:46] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2022-05-16 00:58:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:58:46] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2022-05-16 00:58:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:58:46] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin204776009696091563
Running compilation step : cd /tmp/ltsmin204776009696091563;'/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 356 ms.
Running link step : cd /tmp/ltsmin204776009696091563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin204776009696091563;'/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/stateBased9598326633420150364.hoa' '--buchi-type=spotba'
LTSmin run took 5295 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-06b-LTLFireability-02 finished in 17476 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)&&X(((p2 U p0)||p3))))'
Support contains 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 456/456 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 459 transition count 445
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 459 transition count 445
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 454 transition count 440
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 454 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 452 transition count 438
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 452 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 451 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 451 transition count 437
Applied a total of 38 rules in 55 ms. Remains 451 /470 variables (removed 19) and now considering 437/456 (removed 19) transitions.
// Phase 1: matrix 437 rows 451 cols
[2022-05-16 00:58:52] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-16 00:58:52] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 437 rows 451 cols
[2022-05-16 00:58:52] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-16 00:58:53] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
// Phase 1: matrix 437 rows 451 cols
[2022-05-16 00:58:53] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-16 00:58:53] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 451/470 places, 437/456 transitions.
Finished structural reductions, in 1 iterations. Remains : 451/470 places, 437/456 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR p1 (AND (NOT p0) (NOT p3))), true, p1, (AND (NOT p0) (NOT p3)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s135 1), p0:(EQ s146 1), p3:(EQ s188 1), p2:(AND (EQ s369 1) (EQ s449 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-06 finished in 826 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 166 rules applied. Total rules applied 166 place count 469 transition count 289
Reduce places removed 166 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 186 rules applied. Total rules applied 352 place count 303 transition count 269
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 364 place count 291 transition count 269
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 364 place count 291 transition count 211
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 480 place count 233 transition count 211
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 491 place count 222 transition count 200
Iterating global reduction 3 with 11 rules applied. Total rules applied 502 place count 222 transition count 200
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 502 place count 222 transition count 194
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 514 place count 216 transition count 194
Performed 80 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 674 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 675 place count 135 transition count 103
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 683 place count 129 transition count 101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 685 place count 127 transition count 101
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 685 place count 127 transition count 97
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 693 place count 123 transition count 97
Applied a total of 693 rules in 40 ms. Remains 123 /470 variables (removed 347) and now considering 97/456 (removed 359) transitions.
// Phase 1: matrix 97 rows 123 cols
[2022-05-16 00:58:53] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 00:58:53] [INFO ] Implicit Places using invariants in 91 ms returned [51, 71, 91, 97, 103, 108, 113, 117, 122]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 93 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/470 places, 97/456 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 107 transition count 90
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 107 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 106 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 106 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 105 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 105 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 104 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 104 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 103 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 103 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 102 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 102 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 101 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 101 transition count 84
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 28 place count 100 transition count 83
Applied a total of 28 rules in 20 ms. Remains 100 /114 variables (removed 14) and now considering 83/97 (removed 14) transitions.
// Phase 1: matrix 83 rows 100 cols
[2022-05-16 00:58:53] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 00:58:53] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 83 rows 100 cols
[2022-05-16 00:58:53] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 00:58:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-16 00:58:53] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [44, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 180 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/470 places, 83/456 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 98 transition count 81
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 4 place count 96 transition count 81
Applied a total of 4 rules in 8 ms. Remains 96 /98 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 96 cols
[2022-05-16 00:58:53] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 00:58:53] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 81 rows 96 cols
[2022-05-16 00:58:53] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 00:58:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-16 00:58:53] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 96/470 places, 81/456 transitions.
Finished structural reductions, in 3 iterations. Remains : 96/470 places, 81/456 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 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 22 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-08 finished in 595 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 456/456 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 443
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 443
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 451 transition count 437
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 451 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 449 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 449 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 448 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 448 transition count 434
Applied a total of 44 rules in 40 ms. Remains 448 /470 variables (removed 22) and now considering 434/456 (removed 22) transitions.
// Phase 1: matrix 434 rows 448 cols
[2022-05-16 00:58:54] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-16 00:58:54] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 434 rows 448 cols
[2022-05-16 00:58:54] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-16 00:58:54] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
// Phase 1: matrix 434 rows 448 cols
[2022-05-16 00:58:54] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-16 00:58:54] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/470 places, 434/456 transitions.
Finished structural reductions, in 1 iterations. Remains : 448/470 places, 434/456 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-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:(EQ s102 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 29604 steps with 102 reset in 68 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-09 finished in 832 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||F(G((X(p1)||F(p2))))))))'
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 469 transition count 295
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 180 rules applied. Total rules applied 340 place count 309 transition count 275
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 353 place count 297 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 354 place count 296 transition count 274
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 354 place count 296 transition count 215
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 472 place count 237 transition count 215
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 482 place count 227 transition count 205
Iterating global reduction 4 with 10 rules applied. Total rules applied 492 place count 227 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 492 place count 227 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 502 place count 222 transition count 200
Performed 81 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 664 place count 141 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 665 place count 140 transition count 108
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 10 rules applied. Total rules applied 675 place count 133 transition count 105
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 678 place count 130 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 678 place count 130 transition count 101
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 686 place count 126 transition count 101
Applied a total of 686 rules in 45 ms. Remains 126 /470 variables (removed 344) and now considering 101/456 (removed 355) transitions.
// Phase 1: matrix 101 rows 126 cols
[2022-05-16 00:58:54] [INFO ] Computed 33 place invariants in 0 ms
[2022-05-16 00:58:54] [INFO ] Implicit Places using invariants in 94 ms returned [53, 75, 95, 101, 107, 111, 116, 120, 125]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 96 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/470 places, 101/456 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 110 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 110 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 109 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 109 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 108 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 108 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 107 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 107 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 106 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 106 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 105 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 105 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 104 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 104 transition count 88
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 28 place count 103 transition count 87
Applied a total of 28 rules in 12 ms. Remains 103 /117 variables (removed 14) and now considering 87/101 (removed 14) transitions.
// Phase 1: matrix 87 rows 103 cols
[2022-05-16 00:58:54] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-16 00:58:55] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 87 rows 103 cols
[2022-05-16 00:58:55] [INFO ] Computed 24 place invariants in 0 ms
[2022-05-16 00:58:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-16 00:58:55] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 156 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/470 places, 87/456 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 102 transition count 86
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 2 place count 101 transition count 86
Applied a total of 2 rules in 4 ms. Remains 101 /102 variables (removed 1) and now considering 86/87 (removed 1) transitions.
// Phase 1: matrix 86 rows 101 cols
[2022-05-16 00:58:55] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-16 00:58:55] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 86 rows 101 cols
[2022-05-16 00:58:55] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-16 00:58:55] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-05-16 00:58:55] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 101/470 places, 86/456 transitions.
Finished structural reductions, in 3 iterations. Remains : 101/470 places, 86/456 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s58 0), p2:(EQ s9 1), p1:(EQ s47 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 3442 reset in 203 ms.
Product exploration explored 100000 steps with 3433 reset in 241 ms.
Computed a total of 7 stabilizing places and 4 stable transitions
Computed a total of 7 stabilizing places and 4 stable transitions
Detected a total of 7/101 stabilizing places and 4/86 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 372 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 83 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 340 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2022-05-16 00:58:56] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 00:58:56] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:58:56] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2022-05-16 00:58:56] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:58:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-05-16 00:58:56] [INFO ] After 11ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 00:58:56] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 0 ms to minimize.
[2022-05-16 00:58:56] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2022-05-16 00:58:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2022-05-16 00:58:56] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 00:58:56] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 6 factoid took 237 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 87 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 101 cols
[2022-05-16 00:58:57] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 00:58:57] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 86 rows 101 cols
[2022-05-16 00:58:57] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 00:58:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-05-16 00:58:57] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2022-05-16 00:58:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 86 rows 101 cols
[2022-05-16 00:58:57] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 00:58:57] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 86/86 transitions.
Computed a total of 7 stabilizing places and 4 stable transitions
Computed a total of 7 stabilizing places and 4 stable transitions
Detected a total of 7/101 stabilizing places and 4/86 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 293 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 113 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1173232 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :{}
Probabilistic random walk after 1173232 steps, saw 151170 distinct states, run finished after 3002 ms. (steps per millisecond=390 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 86 rows 101 cols
[2022-05-16 00:59:01] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 00:59:01] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:59:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 6 ms returned sat
[2022-05-16 00:59:01] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:59:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-05-16 00:59:01] [INFO ] After 14ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 00:59:01] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2022-05-16 00:59:01] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2022-05-16 00:59:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2022-05-16 00:59:01] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-16 00:59:01] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 101/101 places, 86/86 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 101 transition count 54
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 64 place count 69 transition count 54
Applied a total of 64 rules in 7 ms. Remains 69 /101 variables (removed 32) and now considering 54/86 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/101 places, 54/86 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Finished Best-First random walk after 338 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=169 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 6 factoid took 266 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 70 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 3444 reset in 191 ms.
Product exploration explored 100000 steps with 3471 reset in 203 ms.
Built C files in :
/tmp/ltsmin2557546418822612388
[2022-05-16 00:59:02] [INFO ] Computing symmetric may disable matrix : 86 transitions.
[2022-05-16 00:59:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:02] [INFO ] Computing symmetric may enable matrix : 86 transitions.
[2022-05-16 00:59:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:02] [INFO ] Computing Do-Not-Accords matrix : 86 transitions.
[2022-05-16 00:59:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:02] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2557546418822612388
Running compilation step : cd /tmp/ltsmin2557546418822612388;'/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 228 ms.
Running link step : cd /tmp/ltsmin2557546418822612388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2557546418822612388;'/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/stateBased7414399990257117339.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 101 cols
[2022-05-16 00:59:17] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 00:59:17] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 86 rows 101 cols
[2022-05-16 00:59:17] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-16 00:59:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-05-16 00:59:17] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2022-05-16 00:59:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 86 rows 101 cols
[2022-05-16 00:59:17] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 00:59:17] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 86/86 transitions.
Built C files in :
/tmp/ltsmin8035398631106366410
[2022-05-16 00:59:17] [INFO ] Computing symmetric may disable matrix : 86 transitions.
[2022-05-16 00:59:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:17] [INFO ] Computing symmetric may enable matrix : 86 transitions.
[2022-05-16 00:59:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:17] [INFO ] Computing Do-Not-Accords matrix : 86 transitions.
[2022-05-16 00:59:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:17] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8035398631106366410
Running compilation step : cd /tmp/ltsmin8035398631106366410;'/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 196 ms.
Running link step : cd /tmp/ltsmin8035398631106366410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin8035398631106366410;'/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/stateBased10277265818816997411.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 00:59:32] [INFO ] Flatten gal took : 9 ms
[2022-05-16 00:59:32] [INFO ] Flatten gal took : 7 ms
[2022-05-16 00:59:32] [INFO ] Time to serialize gal into /tmp/LTL16540521776021453239.gal : 2 ms
[2022-05-16 00:59:33] [INFO ] Time to serialize properties into /tmp/LTL6869983027396494114.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16540521776021453239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6869983027396494114.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/LTL1654052...267
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(p392==0)"))||(F(G((X("(p296==1)"))||(F("(p69==1)")))))))))
Formula 0 simplified : !XG(F"(p392==0)" | FG(X"(p296==1)" | F"(p69==1)"))
Reverse transition relation is NOT exact ! Due to transitions t341, t192.t195.t207.t210.t220.t228.t235.t242.t252.t259.t266.t274.t281.t289.t297.t304.t311.t3...463
Computing Next relation with stutter on 2944 deadlock states
113 unique states visited
0 strongly connected components in search stack
186 transitions explored
24 items max in DFS search stack
38 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,0.420408,36440,1,0,321,91566,216,264,2947,103282,775
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06b-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-06b-LTLFireability-10 finished in 38659 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p1)&&p0))||F((p2 U !p2))||G(p3)))'
Support contains 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 456/456 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 443
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 443
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 450 transition count 436
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 448 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 447 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 447 transition count 433
Applied a total of 46 rules in 33 ms. Remains 447 /470 variables (removed 23) and now considering 433/456 (removed 23) transitions.
// Phase 1: matrix 433 rows 447 cols
[2022-05-16 00:59:33] [INFO ] Computed 40 place invariants in 4 ms
[2022-05-16 00:59:33] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 433 rows 447 cols
[2022-05-16 00:59:33] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-16 00:59:33] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
// Phase 1: matrix 433 rows 447 cols
[2022-05-16 00:59:33] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-16 00:59:34] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/470 places, 433/456 transitions.
Finished structural reductions, in 1 iterations. Remains : 447/470 places, 433/456 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND p2 (NOT p1)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND p2 (NOT p1) (NOT p3)), p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (AND p2 (NOT p3))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) p2 p0), acceptance={} source=1 dest: 0}, { cond=(AND p3 p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 3}], [{ cond=(AND p3 p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 3}, { cond=(AND p3 p2), acceptance={} source=6 dest: 6}]], initial=5, aps=[p2:(NEQ s251 1), p1:(EQ s82 1), p3:(EQ s59 1), p0:(AND (EQ s227 1) (EQ s418 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10059 reset in 199 ms.
Product exploration explored 100000 steps with 10112 reset in 200 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/447 stabilizing places and 108/433 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p3) (NOT p0)), (X (NOT (AND p3 p2 p0))), (X (NOT (AND (NOT p3) p2 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p3 p2 (NOT p0)))), (X (AND (NOT p3) p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (X p2)), (X (X (AND (NOT p3) p2 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p3 p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 672 ms. Reduced automaton from 7 states, 14 edges and 4 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[p2, p2]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p3) (NOT p0)), (X (NOT (AND p3 p2 p0))), (X (NOT (AND (NOT p3) p2 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p3 p2 (NOT p0)))), (X (AND (NOT p3) p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (X p2)), (X (X (AND (NOT p3) p2 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p3 p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 14 factoid took 583 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 29 ms :[p2]
Stuttering acceptance computed with spot in 47 ms :[p2]
// Phase 1: matrix 433 rows 447 cols
[2022-05-16 00:59:36] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-16 00:59:36] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2022-05-16 00:59:36] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:59:37] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2022-05-16 00:59:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:59:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2022-05-16 00:59:37] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:59:37] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-16 00:59:37] [INFO ] Computed and/alt/rep : 432/616/432 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-16 00:59:39] [INFO ] Added : 341 causal constraints over 69 iterations in 1944 ms. Result :sat
Could not prove EG p2
Support contains 1 out of 447 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 447/447 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 446 transition count 276
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 174 rules applied. Total rules applied 330 place count 290 transition count 258
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 342 place count 278 transition count 258
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 342 place count 278 transition count 203
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 452 place count 223 transition count 203
Performed 84 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 620 place count 139 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 621 place count 139 transition count 108
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 622 place count 139 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 623 place count 138 transition count 107
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 16 rules applied. Total rules applied 639 place count 127 transition count 102
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 644 place count 122 transition count 102
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 644 place count 122 transition count 97
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 654 place count 117 transition count 97
Applied a total of 654 rules in 37 ms. Remains 117 /447 variables (removed 330) and now considering 97/433 (removed 336) transitions.
// Phase 1: matrix 97 rows 117 cols
[2022-05-16 00:59:39] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 00:59:39] [INFO ] Implicit Places using invariants in 85 ms returned [116]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/447 places, 97/433 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 108 transition count 89
Applied a total of 16 rules in 4 ms. Remains 108 /116 variables (removed 8) and now considering 89/97 (removed 8) transitions.
// Phase 1: matrix 89 rows 108 cols
[2022-05-16 00:59:39] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:59:39] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 89 rows 108 cols
[2022-05-16 00:59:39] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:59:39] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/447 places, 89/433 transitions.
Finished structural reductions, in 2 iterations. Remains : 108/447 places, 89/433 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/108 stabilizing places and 2/89 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p2, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 2 factoid took 151 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 25 ms :[p2]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [p2, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 149 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 39 ms :[p2]
Stuttering acceptance computed with spot in 35 ms :[p2]
// Phase 1: matrix 89 rows 108 cols
[2022-05-16 00:59:40] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-16 00:59:40] [INFO ] [Real]Absence check using 28 positive place invariants in 4 ms returned sat
[2022-05-16 00:59:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:59:40] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-16 00:59:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:59:40] [INFO ] [Nat]Absence check using 28 positive place invariants in 4 ms returned sat
[2022-05-16 00:59:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:59:40] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-16 00:59:40] [INFO ] Computed and/alt/rep : 63/97/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 00:59:40] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 48 ms :[p2]
Product exploration explored 100000 steps with 8013 reset in 149 ms.
Product exploration explored 100000 steps with 7959 reset in 165 ms.
Built C files in :
/tmp/ltsmin9802403453692176010
[2022-05-16 00:59:40] [INFO ] Computing symmetric may disable matrix : 89 transitions.
[2022-05-16 00:59:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:40] [INFO ] Computing symmetric may enable matrix : 89 transitions.
[2022-05-16 00:59:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:40] [INFO ] Computing Do-Not-Accords matrix : 89 transitions.
[2022-05-16 00:59:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:40] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9802403453692176010
Running compilation step : cd /tmp/ltsmin9802403453692176010;'/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 264 ms.
Running link step : cd /tmp/ltsmin9802403453692176010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9802403453692176010;'/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/stateBased14194983852558391523.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 89/89 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 106 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 106 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 104 transition count 86
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 104 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 103 transition count 85
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 4 with 4 rules applied. Total rules applied 13 place count 101 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 14 place count 101 transition count 82
Applied a total of 14 rules in 21 ms. Remains 101 /108 variables (removed 7) and now considering 82/89 (removed 7) transitions.
// Phase 1: matrix 82 rows 101 cols
[2022-05-16 00:59:55] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-16 00:59:56] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 82 rows 101 cols
[2022-05-16 00:59:56] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-16 00:59:56] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-05-16 00:59:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 101 cols
[2022-05-16 00:59:56] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-16 00:59:56] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/108 places, 82/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/108 places, 82/89 transitions.
Built C files in :
/tmp/ltsmin10599094488894172719
[2022-05-16 00:59:56] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2022-05-16 00:59:56] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:56] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2022-05-16 00:59:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:56] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2022-05-16 00:59:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:59:56] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10599094488894172719
Running compilation step : cd /tmp/ltsmin10599094488894172719;'/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 174 ms.
Running link step : cd /tmp/ltsmin10599094488894172719;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10599094488894172719;'/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/stateBased10360809841348018727.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:00:11] [INFO ] Flatten gal took : 10 ms
[2022-05-16 01:00:11] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:00:11] [INFO ] Time to serialize gal into /tmp/LTL5547132095093925207.gal : 38 ms
[2022-05-16 01:00:11] [INFO ] Time to serialize properties into /tmp/LTL9905340802606482175.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5547132095093925207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9905340802606482175.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/LTL5547132...266
Read 1 LTL properties
Checking formula 0 : !((((X(((X("(p116==1)"))&&("(p339==1)"))&&("(p543==1)")))||(F(("(p370!=1)")U("(p370==1)"))))||(G("(p78==1)"))))
Formula 0 simplified : !(X("(p339==1)" & "(p543==1)" & X"(p116==1)") | F("(p370!=1)" U "(p370==1)") | G"(p78==1)")
Reverse transition relation is NOT exact ! Due to transitions t9, t334.t332, t50.t61.t72.t83.t94.t105.t115.t116.t117.t118.t119.t120.t121.t122.t123.t124.t12...519
Computing Next relation with stutter on 1920 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
23 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,0.256215,28644,1,0,271,51707,229,136,3064,46098,379
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06b-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-06b-LTLFireability-11 finished in 38148 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(G(X(X(!X(p0)))) U p1))))'
Support contains 2 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 164 rules applied. Total rules applied 164 place count 469 transition count 291
Reduce places removed 164 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 184 rules applied. Total rules applied 348 place count 305 transition count 271
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 360 place count 293 transition count 271
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 360 place count 293 transition count 214
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 474 place count 236 transition count 214
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 485 place count 225 transition count 203
Iterating global reduction 3 with 11 rules applied. Total rules applied 496 place count 225 transition count 203
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 496 place count 225 transition count 197
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 508 place count 219 transition count 197
Performed 83 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 674 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 675 place count 135 transition count 103
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 691 place count 124 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 696 place count 119 transition count 98
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 696 place count 119 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 708 place count 113 transition count 92
Applied a total of 708 rules in 27 ms. Remains 113 /470 variables (removed 357) and now considering 92/456 (removed 364) transitions.
// Phase 1: matrix 92 rows 113 cols
[2022-05-16 01:00:11] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-16 01:00:11] [INFO ] Implicit Places using invariants in 52 ms returned [46, 66, 86, 90, 94, 98, 103, 107, 112]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 53 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/470 places, 92/456 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 85
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 96 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 96 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 95 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 95 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 94 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 93 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 93 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 92 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 92 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 91 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 91 transition count 79
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 28 place count 90 transition count 78
Applied a total of 28 rules in 6 ms. Remains 90 /104 variables (removed 14) and now considering 78/92 (removed 14) transitions.
// Phase 1: matrix 78 rows 90 cols
[2022-05-16 01:00:11] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 01:00:11] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 78 rows 90 cols
[2022-05-16 01:00:11] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 01:00:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:00:11] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/470 places, 78/456 transitions.
Finished structural reductions, in 2 iterations. Remains : 90/470 places, 78/456 transitions.
Stuttering acceptance computed with spot in 31 ms :[p1]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s45 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3691 reset in 125 ms.
Stack based approach found an accepted trace after 62038 steps with 2305 reset with depth 14 and stack size 14 in 142 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-12 finished in 529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||(X(X((X(p1)&&p2)))&&p2)) U p3))'
Support contains 4 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 456/456 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 459 transition count 445
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 459 transition count 445
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 452 transition count 438
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 452 transition count 438
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 450 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 450 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 449 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 449 transition count 435
Applied a total of 42 rules in 71 ms. Remains 449 /470 variables (removed 21) and now considering 435/456 (removed 21) transitions.
// Phase 1: matrix 435 rows 449 cols
[2022-05-16 01:00:12] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-16 01:00:12] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 435 rows 449 cols
[2022-05-16 01:00:12] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-16 01:00:12] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
// Phase 1: matrix 435 rows 449 cols
[2022-05-16 01:00:12] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-16 01:00:13] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/470 places, 435/456 transitions.
Finished structural reductions, in 1 iterations. Remains : 449/470 places, 435/456 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p3), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}]], initial=0, aps=[p3:(EQ s145 1), p0:(EQ s201 1), p2:(EQ s32 1), p1:(EQ s84 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 285 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-14 finished in 1080 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(X(G(p0)) U (F(p1)&&p0)))||X(p2))))'
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 456/456 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 456 transition count 442
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 456 transition count 442
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 449 transition count 435
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 449 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 447 transition count 433
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 447 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 446 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 446 transition count 432
Applied a total of 48 rules in 63 ms. Remains 446 /470 variables (removed 24) and now considering 432/456 (removed 24) transitions.
// Phase 1: matrix 432 rows 446 cols
[2022-05-16 01:00:13] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-16 01:00:13] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 432 rows 446 cols
[2022-05-16 01:00:13] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-16 01:00:13] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
// Phase 1: matrix 432 rows 446 cols
[2022-05-16 01:00:13] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-16 01:00:13] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/470 places, 432/456 transitions.
Finished structural reductions, in 1 iterations. Remains : 446/470 places, 432/456 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, p0, (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), p1, (AND p0 p1)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(EQ s6 1), p2:(EQ s136 1), p1:(EQ s409 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 322 ms.
Product exploration explored 100000 steps with 25000 reset in 300 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/446 stabilizing places and 108/432 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 346 ms. Reduced automaton from 7 states, 11 edges and 3 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 225 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 1154 steps, including 4 resets, run visited all 3 properties in 4 ms. (steps per millisecond=288 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 359 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 213 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 232 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 2 out of 446 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 432/432 transitions.
Applied a total of 0 rules in 13 ms. Remains 446 /446 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 446 cols
[2022-05-16 01:00:16] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-16 01:00:16] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 432 rows 446 cols
[2022-05-16 01:00:16] [INFO ] Computed 40 place invariants in 4 ms
[2022-05-16 01:00:16] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
// Phase 1: matrix 432 rows 446 cols
[2022-05-16 01:00:16] [INFO ] Computed 40 place invariants in 4 ms
[2022-05-16 01:00:17] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 446/446 places, 432/432 transitions.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/446 stabilizing places and 108/432 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 233 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 26 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 4 factoid took 245 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 172 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 199 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 184 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 25000 reset in 313 ms.
Product exploration explored 100000 steps with 25000 reset in 284 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 184 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 432/432 transitions.
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 446 transition count 432
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 12 rules applied. Total rules applied 151 place count 446 transition count 426
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 151 place count 446 transition count 426
Deduced a syphon composed of 205 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 211 place count 446 transition count 426
Discarding 118 places :
Symmetric choice reduction at 2 with 118 rule applications. Total rules 329 place count 328 transition count 308
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 118 rules applied. Total rules applied 447 place count 328 transition count 308
Performed 104 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 191 places in 0 ms
Iterating global reduction 2 with 104 rules applied. Total rules applied 551 place count 328 transition count 296
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 618 place count 261 transition count 229
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 685 place count 261 transition count 229
Deduced a syphon composed of 124 places in 0 ms
Applied a total of 685 rules in 94 ms. Remains 261 /446 variables (removed 185) and now considering 229/432 (removed 203) transitions.
[2022-05-16 01:00:19] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 229 rows 261 cols
[2022-05-16 01:00:19] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-16 01:00:19] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 261/446 places, 229/432 transitions.
Finished structural reductions, in 1 iterations. Remains : 261/446 places, 229/432 transitions.
Product exploration explored 100000 steps with 25000 reset in 693 ms.
Product exploration explored 100000 steps with 25000 reset in 552 ms.
Built C files in :
/tmp/ltsmin15070927118134284620
[2022-05-16 01:00:20] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15070927118134284620
Running compilation step : cd /tmp/ltsmin15070927118134284620;'/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 801 ms.
Running link step : cd /tmp/ltsmin15070927118134284620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15070927118134284620;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10141610045625960477.hoa' '--buchi-type=spotba'
LTSmin run took 237 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-06b-LTLFireability-15 finished in 8841 ms.
All properties solved by simple procedures.
Total runtime 121628 ms.

BK_STOP 1652662822187

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-06b"
export BK_EXAMINATION="LTLFireability"
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-06b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689300460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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